Efficient aggregation algorithms on very large compressed data warehouses

DOI10.1007/BF02948809MaRDI QIDQ5938681zbMATH OpenOpenAlexFDO

Authors Jianzhong Li, Yingshu Li, J. Srivastava

Publication date 1 October 2001

Published in Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02948809

zbMATH Keywords

aggregationdata warehouseOLAP

Mathematics Subject Classification ID

Database theory (68P15) Computing methodologies and applications (68U99)

Recommendations

• An iceberg cube algorithm for large compressed data warehouses
• scientific article; zbMATH DE number 1792115
• High Performance Computing - HiPC 2003
• Compressed data cube for approximate OLAP query processing.
• scientific article; zbMATH DE number 1792111

Cites work

• Batched interpolation searching on databases
• Efficient aggregation algorithms on very large compressed data warehouses

Cited in

(9)

• An efficient workload-based data layout scheme for multidimensional data
• Polynomial asymptotic complexity of multiple-objective OLAP data cube compression
• An iceberg cube algorithm for large compressed data warehouses
• scientific article; zbMATH DE number 1983243 (Why is no real title available?)
• scientific article; zbMATH DE number 1919445 (Why is no real title available?)
• scientific article; zbMATH DE number 1755588 (Why is no real title available?)
• scientific article; zbMATH DE number 1792111 (Why is no real title available?)
• scientific article; zbMATH DE number 1927132 (Why is no real title available?)
• Efficient aggregation algorithms on very large compressed data warehouses

This page was built for publication: Efficient aggregation algorithms on very large compressed data warehouses

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