Parallelizing the data cube

MaRDI QIDQ4408092zbMATH OpenFDO

Authors Frank Dehne, Todd Eavis, Susanne E. Hambrusch, Andrew Rau-Chaplin

Publication date 1 July 2003

zbMATH Keywords

data cubeload balancingOLAPparallel processingpartitioning

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15) Computing methodologies and applications (68U99) Parallel algorithms in computer science (68W10)

Recommendations

• Parallelizing the data cube
• High Performance Computing - HiPC 2003
• Computing partial data cubes for parallel data warehousing applications
• Coarse grained parallel on-line analytical processing (OLAP) for data mining
• PARSIMONY: An infrastructure for parallel multidimensional analysis and data mining

Cited in

(8)

• A cubic-wise balance approach for privacy preservation in data cubes.
• scientific article; zbMATH DE number 2089449 (Why is no real title available?)
• PARALLEL PROCESSING OF OLAP QUERIES USING A CLUSTER OF WORKSTATIONS
• Parallelizing the data cube
• Computing partial data cubes for parallel data warehousing applications
• Fully dynamic partitioning: Handling data skew in parallel data cube computation
• High Performance Computing - HiPC 2003
• Hash partitioning optimizations based on MapReduce for chip multiprocessors

Describes a project that uses

Uses Software

• LEDA

This page was built for publication: Parallelizing the data cube

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