Affiliation:
1. Microsoft Research, Redmond, WA
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Information Systems,Software
Reference18 articles.
1. J. Chang and S. Lee Query Reformulation Using Materialized Views in Data Warehousing Environment First ACM Int'l Workshop on Data Warehousing and OLAP (DOLAP) 1998 54-59. 10.1145/294260.294272 J. Chang and S. Lee Query Reformulation Using Materialized Views in Data Warehousing Environment First ACM Int'l Workshop on Data Warehousing and OLAP (DOLAP) 1998 54-59. 10.1145/294260.294272
2. Rewriting aggregate queries using views
Cited by
90 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献