Database Paper Browser

Back to papers

Snakes and Sandwiches: Optimal Clustering Strategies for a Data Warehouse

Summary: Lattice-path clustering for fact tables under a workload; dynamic programming computes the optimal lattice-path clustering in time linear in lattice size. Snaking yields near-optimal snaked clustering; for star schemas, a snaked lattice path is globally optimal with guarantees and TPC-D validation. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3086
Venue
SIGMOD
Year
1999
Pagerank
4.7314388e-05
Overall Rank
7,433 | 48.30%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
1,814 Mesa: Geo-Replicated, Near Real-Time, Scalable Data Warehousing 2014 VLDB 0.00010458107
6,597 Oracle8i Index-Organized Table and its Application to New Domains 2000 VLDB 4.9982502e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 13 of 13 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers