Range Queries in OLAP Data Cubes
Summary: Range queries on OLAP cubes for SUM and MAX; precomputed auxiliary data (prefix sums or 1/b^d) enable fast sums with batched updates and dimension-subset blocking. MAX uses precomputed maxima on balanced trees with branch-and-bound search to quickly locate region maxima. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Ching-Tien Ho (IBM)
- 2. Rakesh Agrawal (IBM)
- 3. Nimrod Megiddo (IBM)
- 4. Ramakrishnan Srikant (IBM)
BibTeX Citation
@inproceedings{ho_sigmod97,
title = {{Range Queries in OLAP Data Cubes}},
author = {Ho, Ching-Tien and Agrawal, Rakesh and Megiddo, Nimrod and Srikant, Ramakrishnan},
series = {{SIGMOD} '97},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/253260.253274},
url = {https://dl.acm.org/doi/10.1145/253260.253274},
year = {1997}
}
Incoming Citations (Sorted by Pagerank)
Showing 26 of 26 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4 | The R*-tree: An Efficient and Robust Access Method for Points and Rectangles | 1990 | SIGMOD | 0.001157935 |
| 11 | Implementing Data Cubes Efficiently | 1996 | SIGMOD | 0.00071822821 |
| 71 | Including Group-By in Query Optimization | 1994 | VLDB | 0.00038021159 |
| 198 | Aggregate-Query Processing in Data Warehousing Environments | 1995 | VLDB | 0.00025618616 |
| 206 | Eager Aggregation and Lazy Aggregation | 1995 | VLDB | 0.00025092273 |
| 207 | On the Computation of Multidimensional Aggregates | 1996 | VLDB | 0.00025088003 |
| 654 | Storage Estimation for Multidimensional Aggregates in the Presence of Hierarchies | 1996 | VLDB | 0.0001527187 |
| 1,485 | SPRINT: A Scalable Parallel Classifier for Data Mining | 1996 | VLDB | 0.00010628998 |
| 12,954 | Partial-Sum Queries in OLAP Data Cubes Using Covering Codes | 1997 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,825 | Efficient Computation of Iceberg Cubes with Complex Measures | 2001 | SIGMOD |
| 2 | 4,587 | Answering Top-k Queries with Multi-Dimensional Selections: The Ranking Cube Approach | 2006 | VLDB |
| 3 | 3,241 | Optimal and Approximate Computation of Summary Statistics for Range Aggregates | 2001 | PODS |
| 4 | 3,575 | Optimal Histograms for Hierarchical Range Queries (Extended Abstract) | 2000 | PODS |
| 5 | 3,753 | High-Dimensional OLAP: A Minimal Cubing Approach | 2004 | VLDB |
| 6 | 207 | On the Computation of Multidimensional Aggregates | 1996 | VLDB |
| 7 | 4,889 | Fast Algorithms For Hierarchical Range Histogram Construction | 2002 | PODS |
| 8 | 10,015 | Dynamic Update Cube for Range-Sum Queries | 2001 | VLDB |
| 9 | 3,954 | Hierarchical Cubes for Range-Sum Queries | 1999 | VLDB |
| 10 | 12,883 | Hierarchical Compact Cube for Range-Max Queries | 2000 | VLDB |