An array-based algorithm for simultaneous multidimensional aggregates
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Caching multidimensional queries using chunks
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
Journal of the ACM (JACM)
Towards the building of a dense-region-based OLAP system
Data & Knowledge Engineering
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Block-Oriented Compression Techniques for Large Statistical Databases
IEEE Transactions on Knowledge and Data Engineering
Efficient Aggregation Algorithms for Compressed Data Warehouses
IEEE Transactions on Knowledge and Data Engineering
Coarse Grained Parallel On-Line Analytical Processing (OLAP) for Data Mining
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Efficient Organization of Large Multidimensional Arrays
Proceedings of the Tenth International Conference on Data Engineering
Wavelet-based relative prefix sum methods for range sum queries in data cubes
CASCON '02 Proceedings of the 2002 conference of the Centre for Advanced Studies on Collaborative research
Relative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
High-performance on-line analytical processing and data mining on parallel computers
High-performance on-line analytical processing and data mining on parallel computers
Data compression and harmonic analysis
IEEE Transactions on Information Theory
Compressing arrays by ordering attribute values
Information Processing Letters
Supporting mobile decision making with association rules and multi-layered caching
Decision Support Systems
Compressing arrays by ordering attribute values
Information Processing Letters
Attribute value reordering for efficient hybrid OLAP
Information Sciences: an International Journal
| Hi-index | 0.00 |
The normalization of a data cube is the process of choosing an ordering for the attribute values, and the chosen ordering.Our optimized hybrid OLAP storage mechanism was observed to be 44% more storage efficient than ROLAP and the gains due to normalization alone accounted for 45% of this increase in efficiency.