The Polynomial Complexity of Fully Materialized Coalesced Cubes

Summary: Analytical framework for estimating coalesced cubes' size and complexity; demonstrates polynomial scaling with dimensionality and data volume, making 100%-precision full cubes tractable. Metadata-based estimator predicts coalesced cube size before computation; validated on uniform, Zipfian, and real datasets. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 9164
Venue: VLDB
Year: 2004
Pagerank: 4.8367109e-05
Overall Rank: 7,077 | 50.82%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Yannis Sismanis
2. Nick Roussopoulos

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
2,551	GORDIAN: Efficient and Scalable Discovery of Composite Keys	2006	VLDB	8.5553153e-05
5,991	Sampling Cube: A Framework for Statistical OLAP Over Sampling Data	2008	SIGMOD	5.2385592e-05
6,739	CURE for Cubes: Cubing Using a ROLAP Engine	2006	VLDB	4.9413138e-05
12,418	Dwarfs in the Rearview Mirror: How Big are they Really?	2008	VLDB	4.1905499e-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.0011695087
247	On the Computation of Multidimensional Aggregates	1996	VLDB	0.00030923842
368	An Array-Based Algorithm for Simultaneous Multidimensional Aggregates	1997	SIGMOD	0.00025508459
475	Bottom-Up Computation of Sparse and Iceberg CUBEs	1999	SIGMOD	0.00022238407
600	Storage Estimation for Multidimensional Aggregates in the Presence of Hierarchies	1996	VLDB	0.00019400653
736	Congressional Samples for Approximate Answering of Group-By Queries	2000	SIGMOD	0.00017414831
1,193	Fast Computation of Sparse Datacubes	1997	VLDB	0.00013412915
1,360	Data Warehouse Configuration	1997	VLDB	0.0001239983
2,665	Dwarf: Shrinking the PetaCube	2002	SIGMOD	8.3505169e-05
3,079	On the Complexity of the View-Selection Problem	1999	PODS	7.6036669e-05
3,497	Cubetree: Organization of and Bulk Incremental Updates on the Data Cube	1997	SIGMOD	7.0372261e-05
4,004	QC-Trees: An Efficient Summary Structure for Semantic OLAP	2003	SIGMOD	6.5401186e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
2,195	Star-Cubing: Computing Iceberg Cubes by Top-Down and Bottom-Up Integration	2003	VLDB	9.3239483e-05
8,521	Computing A Well-Representative Summary of Conjunctive Query Results	2024	PODS	4.4893996e-05
10,906	The Moments Method for Approximate Data Cube Queries	2024	PODS	4.1905499e-05
475	Bottom-Up Computation of Sparse and Iceberg CUBEs	1999	SIGMOD	0.00022238407
12,737	Dynamic Assembly of Views in Data Cubes	1998	PODS	4.1905499e-05
3,162	High-Dimensional OLAP: A Minimal Cubing Approach	2004	VLDB	7.4622284e-05
1,967	Efficient Computation of Iceberg Cubes with Complex Measures	2001	SIGMOD	9.9108189e-05
11,414	High-dimensional Data Cubes	2022	VLDB	4.1905499e-05
1,193	Fast Computation of Sparse Datacubes	1997	VLDB	0.00013412915
247	On the Computation of Multidimensional Aggregates	1996	VLDB	0.00030923842