ACM Home Page
Please provide us with feedback. Feedback
Stacked indexed views in microsoft SQL server
Full text PdfPdf (690 KB)
Source International Conference on Management of Data archive
Proceedings of the 2005 ACM SIGMOD international conference on Management of data table of contents
Baltimore, Maryland
SESSION: Research papers: query processing techniques table of contents
Pages: 179 - 190  
Year of Publication: 2005
ISBN:1-59593-060-4
Authors
David DeHaan  University of Waterloo
Per-Ake Larson  Microsoft Research
Jingren Zhou  Microsoft Research
Sponsors
ACM: Association for Computing Machinery
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 56,   Citation Count: 5
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1066157.1066179
What is a DOI?

ABSTRACT

Appropriately selected materialized views (also called indexed views) can speed up query execution by orders of magnitude. Most database systems limit support for materialized views to select-project-join expressions, possibly with a group-by, over base tables because this class of views can be efficiently maintained incrementally and thus kept up to date with the underlying source tables. However, limiting views to reference only base tables restricts the class of queries that can be supported by materialized views. View stacking (also called views on views) relaxes one restriction by allowing a materialized view to reference both base tables and other materialized views. This extends materialized view support to additional types of queries. This paper describes a prototype implementation of stacked views within Microsoft SQL Server and explains which classes of queries can be supported. To support view matching for stacked views, a signature mechanism was added to the optimizer. This mechanism turned out to be beneficial also for regular views by significantly speeding up view matching.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
F. Afrati and R. Chirkova. Selecting and using views to compute aggregate queries. In Proc. ICDT, number 3363 in LNCS, pages 383--397, 2005.
 
2
 
3
4
 
5
 
6
7
8
 
9
G. Graefe. The Cascades framework for query optimization. IEEE Data Eng. Bull., 18(3):19--29, 1995.
 
10
11
12
 
13
 
14
P.-A. Larson and H. Z. Yang. Computing queries from derived relations. In Proc. VLDB, pages 259--269, 1985.
15
 
16
17
 
18
 
19
 
20
21

Collaborative Colleagues:
David DeHaan: colleagues
Per-Ake Larson: colleagues
Jingren Zhou: colleagues