Database Paper Browser

Back to papers

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)

Paper ID
1278
Venue
PODS
Year
2003
Pagerank
4.3690661e-05
Overall Rank
9,259 | 35.59%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
12,604 Answering XPath Queries over Networks by Sending Minimal Views 2004 VLDB 4.1945683e-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