Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Range queries in OLAP data cubes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Total
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Storage Estimation for Multidimensional Aggregates in the Presence of Hierarchies
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
On the Computation of Multidimensional Aggregates
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Relative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Hierarchically Split Cube Forests for Decision Support: description and tuned design
Hierarchically Split Cube Forests for Decision Support: description and tuned design
performance Characteristics of the Dynamic Data Cube
performance Characteristics of the Dynamic Data Cube
View Maintenance and Analytical Processing at Data Warehouses
DNIS '00 Proceedings of the International Workshop on Databases in Networked Information Systems
ProPolyne: A Fast Wavelet-Based Algorithm for Progressive Evaluation of Polynomial Range-Sum Queries
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Optimal Range Max Datacube for Fixed Dimensions
ICDT '03 Proceedings of the 9th International Conference on Database Theory
CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Space-Efficient Data Cubes for Dynamic Environments
DaWaK 2000 Proceedings of the Second International Conference on Data Warehousing and Knowledge Discovery
Variable Sized Partitions for Range Query Algorithms
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Flexible Data Cubes for Online Aggregation
ICDT '01 Proceedings of the 8th International Conference on Database Theory
pCube: Update-Efficient Online Aggregation with Progressive Feedback and Error Bounds
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Approximate Range-Sum Queries over Data Cubes Using Cosine Transform
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
An efficient algorithm for computing range-groupby queries
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
An effective algorithm to extract dense sub-cubes from a large sparse cube
DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
Spatio-temporal aggregates over streaming geospatial image data
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
| Hi-index | 0.00 |
Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM, AVERAGE) over all selected cells in a data cube, where the selection is specified by providing ranges of values for numeric dimensions. We present the Dynamic Data Cube, a new approach to range sum queries which provides efficient performance for both queries and updates, which handles clustered and sparse data gracefully, and which allows for the dynamic expansion of the data cube in any direction.