Please use this identifier to cite or link to this item:
DC FieldValue
dc.titleLoad balancing in pipelined processing of multi-join queries
dc.contributor.authorLu, Hongjun
dc.contributor.authorTan, Kian-Lee
dc.contributor.authorLee, Chiang
dc.identifier.citationLu, Hongjun,Tan, Kian-Lee,Lee, Chiang (1994). Load balancing in pipelined processing of multi-join queries. Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS : 670-675. ScholarBank@NUS Repository.
dc.description.abstractThis paper looks at how to effectively exploit pipelining for multi-join queries in shared-nothing systems. A multi-join query can be processed using an iterative approach. In each iteration, several relations are selected, and are joined in a pipelined fashion. However, algorithms that are based on this approach have traditionally assumed that the relations are uniformly distributed or lowly skewed. When this assumption is relaxed, that is when the data is skewed, some nodes may be assigned larger amount of data than can fit in their memories. As such, pipelining cannot be effectively exploited, and performance may degenerate drastically. We propose four skew handling techniques to deal with data skew for multi-join queries. The results of a performance study show that a hybrid technique is superior in most cases.
dc.typeConference Paper
dc.description.sourcetitleProceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.