An Efficient Processing of a Chain Join with the Minimum Com…

Emerging


0
Citations
0
Refs
1995
Year
Search Works
Work Details
  • OpenAlex ID W7097959709
  • Type Article
  • Language EN
  • Published 01 Jan 1995
  • Added 27 Oct 2025
  • Updated 14 Oct 2026
MENU
0

An Efficient Processing of a Chain Join with the Minimum Communication Cost

Article 1995 EN

Abstract. This paper investigates the optimization problem when executing a join in a distributed database environment. The minimization of the communication cost for sending data through links has been adopted as an optimization criterion. We explore in this paper the approach of judiciously using join operations as reducers in distributed query processing. In general, this problem is computation…

0

Citations

0

References

4

Authors

0.00

FWCI

Topics
Keywords
Authors & Affiliations
4 authors
#AuthorInstitutionsORCID
1 Xuemin Lin —
2 Maria E. Orłowska —
3 Maria}~cs. Uq. Oz. Au — —
4 Peter M. G. Apers — —

Data: OpenAlex