Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Cubetree: organization of and bulk incremental updates on the data cube
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Maintenance of data cubes and summary tables in a warehouse
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
An array-based algorithm for simultaneous multidimensional aggregates
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
On-line warehouse view maintenance
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Bottom-up computation of sparse and Iceberg CUBE
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Visual J++ 6 from the Ground Up: The Accelerated Track for Professional Programmers
Visual J++ 6 from the Ground Up: The Accelerated Track for Professional Programmers
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
A class of data structures for associative searching
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals
Data Mining and Knowledge Discovery
Computing Iceberg Queries Efficiently
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The DC-Tree: A Fully Dynamic Index Structure for Data Warehouses
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
QC-trees: an efficient summary structure for semantic OLAP
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Condensed Cube: An Efficient Approach to Reducing Data Cube Size
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Incremental maintenance of quotient cube for median
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Indexing and incremental updating condensed data cube
SSDBM '03 Proceedings of the 15th International Conference on Scientific and Statistical Database Management
Quotient cube: how to summarize the semantics of a data cube
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Star-cubing: computing iceberg cubes by top-down and bottom-up integration
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
| Hi-index | 0.00 |
The OnLine Analytical Processing (OLAP) operate on the information from the Data Warehouses, pre-calculating and processing all combinations of the group-by operator and materializing them in Multidimensional Structures or Data Cubes. It is a computational task to realize that needs time, space to store the data. Many studies presented various techniques oriented to the Data Cube compression like the Dwarf, Condensed Cube, BU-Condensed Cube, Min Cube, Prefix Cube and Quotient Cube. This paper presents a study of the difficulty to process the Data Cube and we implemented and applied the Prefix Cube and the Bottom-Up Condensed Cube comparing the performance with the traditional Data Cube processing. Good results were achieved reducing in 70% the traditional Data Cube in different types of data sets.