Browsing large digital library collections using classification hierarchies
Proceedings of the eighth international conference on Information and knowledge management
Using wavelet decomposition to support progressive and approximate range-sum queries over data cubes
Proceedings of the ninth international conference on Information and knowledge management
Improving min/max aggregation over spatial objects
Proceedings of the 9th ACM international symposium on Advances in geographic information systems
Analysis of pre-computed partition top method for range top-k queries in OLAP data cubes
Proceedings of the eleventh international conference on Information and knowledge management
Semantic Data Broadcast for a Mobile Environment Based on Dynamic and Adaptive Chunking
IEEE Transactions on Computers
OLAP-Based Data Mining for Business Intelligence Applications in Telecommunications and E-commerce
DNIS '00 Proceedings of the International Workshop on Databases in Networked Information Systems
View Maintenance and Analytical Processing at Data Warehouses
DNIS '00 Proceedings of the International Workshop on Databases in Networked Information Systems
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
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
Orthogonal Range Queries in OLAP
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Optimal Range Max Datacube for Fixed Dimensions
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Hierarchical Prefix Cubes for Range-Sum Queries
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Hierarchical Compact Cube for Range-Max Queries
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
A Data Warehousing Architecture for Enabling Service Provisioning Process
Proceedings of the 27th International Conference on Very Large Data Bases
Dynamic Update Cube for Range-sum Queries
Proceedings of the 27th International Conference on Very Large Data Bases
OLAP-based Scalable Profiling of Customer Behavior
DaWaK '99 Proceedings of the First International Conference on Data Warehousing and Knowledge Discovery
Space-Efficient Data Cubes for Dynamic Environments
DaWaK 2000 Proceedings of the Second International Conference on Data Warehousing and Knowledge Discovery
Range Top/Bottom k Queries in OLAP Sparse Data Cubes
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
Adaptive Method for Range Top- k Queries in OLAP Data Cubes
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
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
Managing and analyzing massive data sets with data cubes
Handbook of massive data sets
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
Dynamic orthogonal range queries in OLAP
Theoretical Computer Science - Database theory
Dynamic multidimensional data cubes
Multidimensional databases
Attribute value reordering for efficient hybrid OLAP
DOLAP '03 Proceedings of the 6th ACM international workshop on Data warehousing and OLAP
Space-efficient cubes for OLAP range-sum queries
Decision Support Systems
A compression method for prefix-sum cubes
Information Processing Letters
Multidimensional models: constructing data CUBE
CompSysTech '04 Proceedings of the 5th international conference on Computer systems and technologies
Optimizing spatial Min/Max aggregations
The VLDB Journal — The International Journal on Very Large Data Bases
Parallel data cube storage structure for range sum queries and dynamic updates
Journal of Computer Science and Technology
Histogram-by: A grouping operator for continuous domains
Data & Knowledge Engineering
Extending the data warehouse for service provisioning data
Data & Knowledge Engineering - Special issue: ER 2003
Hierarchical bin buffering: Online local moments for dynamic external memory arrays
ACM Transactions on Algorithms (TALG)
Histograms based on the minimum description length principle
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient temporal counting with bounded error
The VLDB Journal — The International Journal on Very Large Data Bases
Plot Query Processing with Wavelets
SSDBM '08 Proceedings of the 20th 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
Supporting asynchronous update for distributed data cubes
Journal of Network and Computer Applications
Efficient Online Aggregates in Dense-Region-Based Data Cube Representations
DaWaK '09 Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery
International Journal of Wireless and Mobile Computing
Efficient online aggregates in dense-region-based data cube representations
Transactions on large-scale data- and knowledge-centered systems II
Efficient online aggregates in dense-region-based data cube representations
Transactions on large-scale data- and knowledge-centered systems II
Sequenced spatiotemporal aggregation for coarse query granularities
The VLDB Journal — The International Journal on Very Large Data Bases
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
| Hi-index | 0.01 |
Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM) over all selected cells in a data cube, where the selection is specified by providing ranges of values for numeric dimensions. Many application domains require that information provided by analysis tools be current or "near-current." Existing techniques for range sum queries on data cubes, however, can incur update costs on the order of the size of the data cube. Since the size of a data cube is exponential in the number of its dimensions, rebuilding the entire data cube can be very costly. We present an approach that achieves constant time range sum queries while constraining update costs. Our method reduces the overall complexity of the range sum problem.