Polynomial asymptotic complexity of multiple-objective OLAP data cube compression

DOI10.1007/978-3-642-31715-6_61zbMATH Open1252.68113OpenAlexW71817608MaRDI QIDQ3143207FDOQ3143207

Authors: Alfredo Cuzzocrea, Marco Fisichella 

Publication date: 28 November 2012

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31715-6_61

Recommendations

• An iceberg cube algorithm for large compressed data warehouses
• Efficient aggregation algorithms on very large compressed data warehouses
• Compressed data cube for approximate OLAP query processing.
• scientific article; zbMATH DE number 1844556
• Loglinear-based quasi cubes

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

This page was built for publication: Polynomial asymptotic complexity of multiple-objective OLAP data cube compression

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