Database Paper Browser

Back to papers

Partial-Sum Queries in OLAP Data Cubes Using Covering Codes

Summary: Maps OLAP partial-sum queries on data cubes to the covering problem from coding theory and uses covering codes to construct indexing/aggregation schemes achieving tunable space–time trade-offs. Yields provable trade-offs and practical algorithms: +44% storage → ~12% faster queries; ~2× storage → ~34% speedup. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1120
Venue
PODS
Year
1997
Pagerank
4.1945683e-05
Overall Rank
12,760 | 11.24%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
1,359 Range Queries in OLAP Data Cubes 1997 SIGMOD 0.0001238588
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
11 Implementing Data Cubes Efficiently 1996 SIGMOD 0.0011708144
51 Including Group-By in Query Optimization 1994 VLDB 0.00067123727
218 Aggregate-Query Processing in Data Warehousing Environments 1995 VLDB 0.00033503922
247 On the Computation of Multidimensional Aggregates 1996 VLDB 0.00030927763
248 Eager Aggregation and Lazy Aggregation 1995 VLDB 0.00030785339
593 Storage Estimation for Multidimensional Aggregates in the Presence of Hierarchies 1996 VLDB 0.00019536993
1,359 Range Queries in OLAP Data Cubes 1997 SIGMOD 0.0001238588
Previous Page 1 / 1 Next

Semantically Similar Papers