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: 1119
Venue: PODS
Year: 1997
Pagerank: 5.093636e-05
Overall Rank: 12,954 | 11.13%
DOI: 10.1145/263661.263686

Incoming Non-self Citations Over Time

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

Authors

1. Ching-Tien Ho (IBM)
2. Jehoshua Bruck (California Institute of Technology)
3. Rakesh Agrawal (IBM)

BibTeX Citation

@inproceedings{ho_pods97,
        address = {New York, NY, USA},
        series = {{PODS} '97},
        title = {{Partial-Sum Queries in OLAP Data Cubes Using Covering Codes}},
        url = {https://dl.acm.org/doi/10.1145/263661.263686},
        doi = {10.1145/263661.263686},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Ho, Ching-Tien and Bruck, Jehoshua and Agrawal, Rakesh},
        year = {1997}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,100	Range Queries in OLAP Data Cubes	1997	SIGMOD	0.00012169143

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.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,100	Range Queries in OLAP Data Cubes	1997	SIGMOD	0.00012169143

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	12,883	Hierarchical Compact Cube for Range-Max Queries	2000	VLDB
2	207	On the Computation of Multidimensional Aggregates	1996	VLDB
3	324	An Array-Based Algorithm for Simultaneous Multidimensional Aggregates	1997	SIGMOD
4	213	Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets	1999	SIGMOD
5	8,629	Efficacious Data Cube Exploration by Semantic Summarization and Compression	2003	VLDB
6	3,753	High-Dimensional OLAP: A Minimal Cubing Approach	2004	VLDB
7	3,774	QC-Trees: An Efficient Summary Structure for Semantic OLAP	2003	SIGMOD
8	1,100	Range Queries in OLAP Data Cubes	1997	SIGMOD
9	3,954	Hierarchical Cubes for Range-Sum Queries	1999	VLDB
10	10,015	Dynamic Update Cube for Range-Sum Queries	2001	VLDB