DBScholar

Back to papers

The View-Selection Problem Has an Exponential-Time Lower Bound for Conjunctive Queries and Views

Summary: Shows that view-selection for conjunctive queries and views has an exponential-time lower bound under the practical sum-cost model, extending prior product-cost impossibility results. Hence no data-independent algorithm can always output polynomially many views and be optimal. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1260
Venue
PODS
Year
2002
Pagerank
-
Overall Rank
13,955 | 4.26%
DOI
10.1145/543613.543634

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{chirkova_pods02,
        address = {New York, NY, USA},
        series = {{PODS} '02},
        title = {{The View-Selection Problem Has an Exponential-Time Lower Bound for Conjunctive Queries and Views}},
        url = {https://dl.acm.org/doi/10.1145/543613.543634},
        doi = {10.1145/543613.543634},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Chirkova, Rada},
        year = {2002}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
9,403 Materializing Views with Minimal Size To Answer Queries 2003 PODS 5.2755515e-05
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