Fully dynamic partitioning: Handling data skew in parallel data cube computation

DOI10.1023/A:1021567425133MaRDI QIDQ4799618zbMATH OpenOpenAlexFDO

Authors Hongjun Lu, Jeffrey Xu Yu, Ling Feng, Zhixian Li

Publication date 25 March 2003

Published in Distributed and Parallel Databases (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1021567425133, https://ris.utwente.nl/ws/files/6551738/fulltext.pdf

zbMATH Keywords

data cubehashingOLAPparallel processing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Database theory (68P15) Computing methodologies and applications (68U99)

Recommendations

• Dynamic query scheduling in parallel data warehouses
• A classification of skew effects in parallel database systems
• Parallelizing the data cube
• Parallelizing the data cube
• scientific article; zbMATH DE number 2090601

Cited in

(5)

• Dynamic query scheduling in parallel data warehouses
• Parallelizing the data cube
• scientific article; zbMATH DE number 2090601 (Why is no real title available?)
• High Performance Computing - HiPC 2003
• High-performance data distribution algorithm on distributed stream systems

This page was built for publication: Fully dynamic partitioning: Handling data skew in parallel data cube computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4799618)