A Formal Perspective on the View Selection Problem
Summary: Formalizes view selection for selection–projection–join workloads under storage, query, and update costs. Shows an estimator-dependent gap: optimal configurations may be exponentially large with accurate cardinalities, but polynomially bounded under standard heuristics. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Rada Chirkova (Stanford University)
- 2. Alon Y. Halevy (University of Washington)
- 3. Dan Suciu (University of Washington)
BibTeX Citation
@article{chirkova_vldb01,
title = {{A Formal Perspective on the View Selection Problem}},
author = {Chirkova, Rada and Halevy, Alon Y. and Suciu, Dan},
journal = {PVLDB},
series = {{VLDB} '01},
year = {2001}
}
Incoming Citations (Sorted by Pagerank)
Showing 11 of 11 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,540 | Generating Efficient Plans for Queries Using Views | 2001 | SIGMOD |
| 2 | 8,416 | Materialized View Selection for XQuery Workloads | 2012 | SIGMOD |
| 3 | 559 | Optimizing Queries Using Materialized Views: A Practical, Scalable Solution | 2001 | SIGMOD |
| 4 | 554 | Answering Queries with Aggregation Using Views | 1996 | VLDB |
| 5 | 225 | Complexity of Answering Queries Using Materialized Views | 1998 | PODS |
| 6 | 1,743 | Algorithms for Materialized View Design in Data Warehousing Environment | 1997 | VLDB |
| 7 | 929 | Materialized View Selection and Maintenance Using Multi-Query Optimization | 2001 | SIGMOD |
| 8 | 9,403 | Materializing Views with Minimal Size To Answer Queries | 2003 | PODS |
| 9 | 3,188 | On the Complexity of the View-Selection Problem | 1999 | PODS |
| 10 | 13,955 | The View-Selection Problem Has an Exponential-Time Lower Bound for Conjunctive Queries and Views | 2002 | PODS |