Stanford InfoLab Publication Server

Concurrency Control Theory for Deferred Materialized Views

Kawaguchi, A. and Lieuwen, D. and Mumick, I. and Quass, D. and Ross, K. (1996) Concurrency Control Theory for Deferred Materialized Views. Technical Report. Stanford InfoLab. (Publication Note: Database Theory - ICDT '97, 6th International Conference, Delphi, Greece, January 8-10, 1997)

BibTeXDublinCoreEndNoteHTML

[img]
Preview
PDF
201Kb

Abstract

We consider concurrency control problems that arise in the presence of materialized views. Consider a database system supporting materialized views to speed up queries. For a range of important applications (e.g. banking, billing, network managementransactions that access materialized views would like to get some consistency guarantees--if a transaction reads a base relation after an update, and then reads a materialized view derived from the base relation, it expects to see the effect of the base update on the materialized view. If a transaction reads two views, it expects that the two views reflect a single consistent database state. Such guarantees are not easy to obtain, as materialized views become inconsistent upon updates to base relations. Immediate maintenance reestablishes consistency within the transaction that updates the base relation, but this consistency comes at the cost of delaying update transactions. Deferred maintenance has been proposed to avoid penalizing update transactions by shifting maintenance into a different transaction (for example, into the transaction that reads the However, doing so causes a materialized view to become temporarily inconsistent with its definition. Consequently, transactions that read multiple materialized views, or that read a materialized view and also read and/or write base relations may execute in a non-serializable manner even when they are running under a strict two phase locking (2PL) protocol. We formalize the concurrency control problem in systems supporting materialized views. We develop a serializability theory based upon conflicts and serialization graphs in the presence of materialized views. Concurrency control algorithms based on this theory are being developed in the SWORD/Ode database system.z The work of Akira Kawaguchi and Kenneth A. Ross was performed while visiting AT&T Bell Laboratories, and was also partially supported by a grant from the AT&T Foundation, by a David and Lucile Packard Foundatio

Item Type:Techreport (Technical Report)
Subjects:Computer Science > Data Integration and Mediation
Projects:Lore
Related URLs:Project Homepagehttp://infolab.stanford.edu/lore/
ID Code:149
Deposited By:Import Account
Deposited On:25 Feb 2000 16:00
Last Modified:09 Dec 2008 08:32

Download statistics

Repository Staff Only: item control page