The Polynomial Complexity of Fully Materialized Coalesced Cubes

Summary: Shows analytically that fully materialized, exact coalesced cubes scale polynomially (often near-linearly in tuple count), avoiding the curse of dimensionality. A metadata-only size estimator is validated on uniform, Zipfian, and real data. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: 9354
Venue: VLDB
Year: 2004
Pagerank: 5.7426524e-05
Overall Rank: 6,902 | 52.65%
DOI: 10.1016/B978-012088469-8.50049-8

Incoming Non-self Citations Over Time

Authors

1. Yannis Sismanis (University of Maryland)
2. Nick Roussopoulos (University of Maryland)

BibTeX Citation

@article{sismanis_vldb04,
        title = {{The Polynomial Complexity of Fully Materialized Coalesced Cubes}},
        author = {Sismanis, Yannis and Roussopoulos, Nick},
        journal = {PVLDB},
        series = {{VLDB} '04},
        doi = {10.1016/B978-012088469-8.50049-8},
        url = {https://doi.org/10.1016/B978-012088469-8.50049-8},
        year = {2004}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
2,269	GORDIAN: Efficient and Scalable Discovery of Composite Keys	2006	VLDB	8.8328424e-05
5,651	Sampling Cube: A Framework for Statistical OLAP Over Sampling Data	2008	SIGMOD	6.1336568e-05
6,658	CURE for Cubes: Cubing Using a ROLAP Engine	2006	VLDB	5.8104851e-05
12,603	Dwarfs in the Rearview Mirror: How Big are they Really?	2008	VLDB	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 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
207	On the Computation of Multidimensional Aggregates	1996	VLDB	0.00025088003
324	An Array-Based Algorithm for Simultaneous Multidimensional Aggregates	1997	SIGMOD	0.00021200835
393	Bottom-Up Computation of Sparse and Iceberg CUBEs	1999	SIGMOD	0.0001934104
553	Congressional Samples for Approximate Answering of Group-By Queries	2000	SIGMOD	0.00016590619
654	Storage Estimation for Multidimensional Aggregates in the Presence of Hierarchies	1996	VLDB	0.0001527187
1,083	Fast Computation of Sparse Datacubes	1997	VLDB	0.00012256953
1,543	Data Warehouse Configuration	1997	VLDB	0.00010413384
2,318	Dwarf: Shrinking the PetaCube	2002	SIGMOD	8.7588859e-05
3,188	On the Complexity of the View-Selection Problem	1999	PODS	7.6547735e-05
3,379	Cubetree: Organization of and Bulk Incremental Updates on the Data Cube	1997	SIGMOD	7.4582502e-05
3,774	QC-Trees: An Efficient Summary Structure for Semantic OLAP	2003	SIGMOD	7.1381444e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	2,496	Star-Cubing: Computing Iceberg Cubes by Top-Down and Bottom-Up Integration	2003	VLDB
2	8,728	Computing A Well-Representative Summary of Conjunctive Query Results	2024	PODS
3	11,124	The Moments Method for Approximate Data Cube Queries	2024	PODS
4	393	Bottom-Up Computation of Sparse and Iceberg CUBEs	1999	SIGMOD
5	12,921	Dynamic Assembly of Views in Data Cubes	1998	PODS
6	3,753	High-Dimensional OLAP: A Minimal Cubing Approach	2004	VLDB
7	1,825	Efficient Computation of Iceberg Cubes with Complex Measures	2001	SIGMOD
8	11,609	High-dimensional Data Cubes	2022	VLDB
9	1,083	Fast Computation of Sparse Datacubes	1997	VLDB
10	207	On the Computation of Multidimensional Aggregates	1996	VLDB