Computing partial data cubes for parallel data warehousing applications

DOI10.1007/3-540-45417-9_44MaRDI QIDQ4785983zbMATH OpenFDO

Authors Frank Dehne, Todd Eavis, Andrew Rau-Chaplin

Publication date 12 December 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2131/21310319

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Computing methodologies and applications (68U99)

Recommendations

• High Performance Computing - HiPC 2003
• scientific article; zbMATH DE number 1944954
• scientific article; zbMATH DE number 2080469
• Coarse grained parallel on-line analytical processing (OLAP) for data mining
• PARALLEL PROCESSING OF OLAP QUERIES USING A CLUSTER OF WORKSTATIONS

Cited in

(9)

• An efficient algorithm for solving the partial sum query problem
• Coarse grained parallel on-line analytical processing (OLAP) for data mining
• scientific article; zbMATH DE number 2089449 (Why is no real title available?)
• Polynomial asymptotic complexity of multiple-objective OLAP data cube compression
• Efficient computation of hierarchical prefixcube
• PARALLEL PROCESSING OF OLAP QUERIES USING A CLUSTER OF WORKSTATIONS
• scientific article; zbMATH DE number 1944954 (Why is no real title available?)
• scientific article; zbMATH DE number 2080469 (Why is no real title available?)
• High Performance Computing - HiPC 2003

This page was built for publication: Computing partial data cubes for parallel data warehousing applications

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