Keywords (1)

Academic
Publications
A Skew-insensitive Algorithm for Join and Multi-join Operations on Shared Nothing Machines

A Skew-insensitive Algorithm for Join and Multi-join Operations on Shared Nothing Machines,10.1007/3-540-44469-6_60,Mostafa Bamha,Gaétan Hains

A Skew-insensitive Algorithm for Join and Multi-join Operations on Shared Nothing Machines   (Citations: 5)
BibTex | RIS | RefWorks Download
Join is an expensive and frequently used operation whose parallelization is highly desirable. However effectiveness of parallel joins depends on the ability to evenly divide load among processors. Data skew can have a disastrous effect on performance. Although many skew-handling algorithms have been proposed they remain generally inefficient in the case of multi-joins due to join product skew, costly and unnecessary redistribution and communication costs. A parallel join algorithm called fa...
Conference: Database and Expert Systems Applications - DEXA , pp. 644-653, 2000
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...Research has shown that join, which is one of the most expansive operations in DBMS, is parallelizable with nearlinear speed-up only in ideal cases [5]...
    • ...However, data skew degrades the performance of parallel systems [6,5,7,8,9,10]...
    • ...It is proved in [5,6], using the BSP model, that histogram management has a negligible cost when compared to the gain it provides in reducing the communication cost...
    • ...Our experience with the join operation [5,6,19] is evidence that the above theoretical analysis is accurate in practice...

    M. Al Hajj Hassanet al. Parallel processing of "group-by join" queries on shared nothing machi...

Sort by: