Materializing Views with Minimal Size To Answer Queries
Summary: Find minimal-byte materialized viewset for a given DB and conjunctive-query workload; show self-joins may require disjunctive views (which can strictly outperform conjunctive ones) and establish decidability with complexity bounds. For self-join-free workloads disjunction unnecessary (problem in NP) and they give a compact search space plus a dynamic-programming algorithm and heuristics to obtain optimal viewsets. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Rada Chirkova (North Carolina State University)
- 2. Chen Li (University of California Irvine)
BibTeX Citation
@inproceedings{chirkova_pods03,
address = {New York, NY, USA},
series = {{PODS} '03},
title = {{Materializing Views with Minimal Size To Answer Queries}},
url = {https://dl.acm.org/doi/10.1145/773153.773158},
doi = {10.1145/773153.773158},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Chirkova, Rada and Li, Chen},
year = {2003}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 12,797 | Answering XPath Queries over Networks by Sending Minimal Views | 2004 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 15 of 15 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
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,031 | Answering Queries Using Limited External Query Processors | 1996 | PODS |
| 2 | 6,540 | Generating Efficient Plans for Queries Using Views | 2001 | SIGMOD |
| 3 | 7,121 | Query Evaluation using Overlapping Views: Completeness and Efficiency | 2006 | SIGMOD |
| 4 | 4,155 | On the Content of Materialized Aggregate Views | 2000 | PODS |
| 5 | 554 | Answering Queries with Aggregation Using Views | 1996 | VLDB |
| 6 | 13,955 | The View-Selection Problem Has an Exponential-Time Lower Bound for Conjunctive Queries and Views | 2002 | PODS |
| 7 | 913 | A Scalable Algorithm for Answering Queries Using Views | 2000 | VLDB |
| 8 | 3,330 | A Formal Perspective on the View Selection Problem | 2001 | VLDB |
| 9 | 225 | Complexity of Answering Queries Using Materialized Views | 1998 | PODS |
| 10 | 69 | Answering Queries Using Views (Extended Abstract) | 1995 | PODS |