ACM Home Page
Please provide us with feedback. Feedback
Transaction support for indexed summary views
Full text PdfPdf (169 KB)
Source International Conference on Management of Data archive
Proceedings of the 2004 ACM SIGMOD international conference on Management of data table of contents
Paris, France
SESSION: Research sessions: indexing and tuning table of contents
Pages: 323 - 334  
Year of Publication: 2004
ISBN:1-58113-859-8
Authors
Goetz Graefe  Microsoft
Michael Zwilling  Microsoft
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 43,   Citation Count: 1
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/1007568.1007606
What is a DOI?

ABSTRACT

Materialized views have become a standard technique for performance improvement in decision support databases and for a variety of monitoring purposes. In order to avoid inconsistencies and thus unpredictable query results, materialized views and their indexes should be maintained immediately within user transaction just like indexes on ordinary tables. Unfortunately, the smaller a materialized view is, the higher the concurrency contention between queries and updates as well as among concurrent updates. Therefore, we have investigated methods that reduce contention without forcing users to sacrifice serializability and thus predictable application semantics. These methods extend escrow locking with multi-granularity (hierarchical) locking, snapshot transactions, multi-version concurrency control, key range locking, and system transactions, i.e., multiple proven database implementation techniques. The complete design eliminates all contention between pure read transactions and pure update transactions as well as contention among pure update transactions as well as contention among pure update transactions; it enables maximal concurrency of mixed read-write transactions with other transactions; it supports bulk operations such as data import and online index creation; and it provides recovery for transaction, media, and system failures.


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
{B 03} Michael Blasgen: Personal communication.
2
 
3
 
4
 
5
{G 03} Dieter Gawlick: Personal communication.
 
6
{GK 85} Dieter Gawlick, David Kinkade: Varieties of Concurrency Control in IMS/VS Fast Path. IEEE Data Eng. Bulletin 8(2):3--10 (1985).
 
7
{GM 99} Ashish Gupta, Inderpal Singh Mumick (eds): Materialized Views: Techniques, Implementations, and Applications. The MIT Press, Cambridge, MA, 1999.
8
9
10
 
11
12
 
13
14
 
15
{LNE 03} Gang Luo, Jeffrey F. Naughton, Curt Ellmann, Michael Watzke: Locking Protocols for Materialized Aggregate Join Views. VLDB Conf. 2003: 596--607.
 
16
17
18
19
 
20
{PSC 02} Themistoklis Palpanas, Richard Sidle, Roberta Cochrane, Hamid Pirahesh: Incremental Maintenance for Non-Distributive Aggregate Functions. VLDB Conf. 2003.
 
21
{Q 96} Dallan Quass: Maintenance Expressions for Views with Aggregation. Workshop on Materialized Views: Techniques and Applications (VIEW 1996). Montreal, Canada, June 7, 1996: 110--118.
 
22
{S 85} Dennis Shasha: What Good are Concurrent Search Structure Algorithms for Database Anyway? IEEE Database Eng. Bull 8(2): 84--90 (1985).
 
23
{TPC} Transaction Processing Performance Council, http://www.tpc.org/tpch.
 
24
25

Collaborative Colleagues:
Goetz Graefe: colleagues
Michael Zwilling: colleagues