Optimizing queries using materialized views
Authors:
Open Access
- 1 May 2001
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 30 (2) , 331-342
Abstract
Materialized views can provide massive improvements in query processing time, especially for aggregation queries over large tables. To realize this potential, the query optimizer must know how and when to exploit materialized views. This paper presents a fast and scalable algorithm for determining whether part or all of a query can be computed from materialized views and describes how it can be incorporated in transformation-based optimizers. The current version handles views composed of selections, joins and a final group-by. Optimization remains fully cost based, that is, a single “best” rewrite is not selected by heuristic rules but multiple rewrites are generated and the optimizer chooses the best alternative in the normal way. Experimental results based on an implementation in Microsoft SQL Server show outstanding performance and scalability. Optimization time increases slowly with the number of views but remains low even up to a thousand.Keywords
This publication has 6 references indexed in Scilit:
- Answering complex SQL queries using automatic summary tables2000
- Rewriting aggregate queries using views1999
- Querying aggregate data1999
- Query reformulation using materialized views in data warehouse environment1998
- Deciding equivalences among aggregate queries1998
- Answering queries using views (extended abstract)1995