Handling data skew in parallel joins in shared-nothing systems
Authors:
Open Access
- 9 June 2008
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1043-1052
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Handling data skew in parallel hash join computation using two-phase scheduling2002
- Random sampling from databases: a surveyStatistics and Computing, 1995
- New algorithms for parallelizing relational database joins in the presence of data skewIEEE Transactions on Knowledge and Data Engineering, 1994
- Using shared virtual memory for parallel join processing1993
- A parallel sort merge join algorithm for managing data skewIEEE Transactions on Parallel and Distributed Systems, 1993
- Parallel database systemsCommunications of the ACM, 1992
- Effectiveness of parallel joinsIEEE Transactions on Knowledge and Data Engineering, 1990
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- An Application of Bin-Packing to Multiprocessor SchedulingSIAM Journal on Computing, 1978
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969