Compressed data cube for approximate OLAP query processing.
From MaRDI portal
Publication:1850694
DOI10.1007/BF02948830zbMATH Open1057.68022MaRDI QIDQ1850694FDOQ1850694
Publication date: 2002
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
Recommendations
Cited In (8)
- Polynomial asymptotic complexity of multiple-objective OLAP data cube compression
- Title not available (Why is that?)
- Efficient OLAP query processing in distributed data warehouses.
- Loglinear-based quasi cubes
- An iceberg cube algorithm for large compressed data warehouses
- Approximate query processing using wavelets
- Title not available (Why is that?)
- Efficient aggregation algorithms on very large compressed data warehouses
This page was built for publication: Compressed data cube for approximate OLAP query processing.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850694)