Generating Efficient Plans for Queries Using Views

Summary: Closed-world, materialized-view rewriting: infinite rewritings exist, but a guaranteed-optimal search space. Proposes subgoal-count and intermediate-relations cost models, plus a variable-renaming drop-attributes technique; scalable results beating the supplementary-relations approach. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: h71978a8b311f3a9e
Venue: SIGMOD
Year: 2001
Pagerank: 5.6945953e-05
Overall Rank: 6,681 | 55.22%
DOI: 10.1145/375663.375705

Incoming Non-self Citations Over Time

Authors

1. Foto N. Afrati (National Technical University of Athens)
2. Chen Li (Stanford University)
3. Jeffrey D. Ullman (Stanford University)

BibTeX Citation

@inproceedings{afrati_sigmod01,
        title = {{Generating Efficient Plans for Queries Using Views}},
        author = {Afrati, Foto N. and Li, Chen and Ullman, Jeffrey D.},
        series = {{SIGMOD} '01},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/375663.375705},
        url = {https://dl.acm.org/doi/10.1145/375663.375705},
        year = {2001}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
3,767	Toward Large Scale Integration: Building a MetaQuerier over Databases on the Web	2005	CIDR	7.0171417e-05
7,288	Query Evaluation using Overlapping Views: Completeness and Efficiency	2006	SIGMOD	5.5489538e-05
12,596	Fine-Grained Disclosure Control for App Ecosystems	2013	SIGMOD	4.9605343e-05

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
1	Access Path Selection in a Relational Database Management System	1979	SIGMOD	0.0023948467
72	Answering Queries Using Views (Extended Abstract)	1995	PODS	0.00037421163
117	Querying Heterogeneous Information Sources Using Source Descriptions	1996	VLDB	0.00031526277
174	Optimizing Queries across Diverse Data Sources	1997	VLDB	0.00026736308
239	Complexity of Answering Queries Using Materialized Views	1998	PODS	0.00023510465
336	An Adaptive Query Execution System for Data Integration*	1999	SIGMOD	0.00020619345
353	On the Power of Magic	1987	PODS	0.0002014941
534	Answering Recursive Queries Using Views	1997	PODS	0.0001677412
940	A Scalable Algorithm for Answering Queries Using Views	2000	VLDB	0.00012941424
1,059	Answering Complex SQL Queries Using Automatic Summary Tables	2000	SIGMOD	0.00012224962
1,550	Data Warehouse Configuration	1997	VLDB	0.00010257652
4,402	Optimization of Run-time Management of Data Intensive Web Sites	1999	VLDB	6.6036118e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	10,585	Succinct Structure Representations for Efficient Query Optimization	2026	SIGMOD
2	3,393	A Formal Perspective on the View Selection Problem	2001	VLDB
3	882	Rewriting Aggregate Queries Using Views	1999	PODS
4	567	Answering Queries with Aggregation Using Views	1996	VLDB
5	6,239	Scalable Query Rewriting: A Graph-Based Approach	2011	SIGMOD
6	12,373	Bounded Query Rewriting Using Views	2016	PODS
7	9,620	Materializing Views with Minimal Size To Answer Queries	2003	PODS
8	2,579	Rewriting Queries Using Views in Description Logics	1997	PODS
9	72	Answering Queries Using Views (Extended Abstract)	1995	PODS
10	7,288	Query Evaluation using Overlapping Views: Completeness and Efficiency	2006	SIGMOD