Applying Formal Methods to Semantic-Based Decomposition of Transactions.
Paul Ammann, Sushil Jajodia, Indrakshi Ray:
Applying Formal Methods to Semantic-Based Decomposition of Transactions.
ACM Trans. Database Syst. 22(2): 215-254(1997)@article{DBLP:journals/tods/AmmannJR97,
author = {Paul Ammann and
Sushil Jajodia and
Indrakshi Ray},
title = {Applying Formal Methods to Semantic-Based Decomposition of Transactions},
journal = {ACM Trans. Database Syst.},
volume = {22},
number = {2},
year = {1997},
pages = {215-254},
ee = {http://doi.acm.org/10.1145/249978.249981, db/journals/tods/AmmannJR97.html},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
Abstract
In some database applications the traditional approach of seerializability, in which transactions appear to execute atomically and
in isolation on a consistent database state, fails to satisfy performance requirements. Although many researchers have
investigated the process of decomposing transactions into steps to increase concurrency, such research typically focuses on
providing algorithms necessary to implement a decomposition supplied by the database application developer and pays relatively
little attention to what constitutess a desirable decomposition or how the developer should obtain one. We focus onthe
decomposition itself. A decomposition generates proof obligations whose descharge ensures desirable properties with respect to
the original collection of transactions. We introduce the notion of semantic histories to formulate and prove the necessary
properties, and the notion of successor sets to describe efficiently the correct interleavings of steps. The successor set constraints
use information about conflicts between steps so as to take full advantage of conflict serializability at the level of steps. We
propose a mechanism based on two-phase locking to generate correct stepwise serializable histories.
Copyright © 1997 by the ACM,
Inc., used by permission. Permission to make
digital or hard copies is granted provided that
copies are not made or distributed for profit or
direct commercial advantage, and that copies show
this notice on the first page or initial screen of
a display along with the full citation.
CDROM Version: Load the CDROM "Volume 4 Issue 1, Books, VLDB-j, TODS, ..." and ...
DVD Version: Load ACM SIGMOD Anthology DVD 2" and ...
BibTeX
[Abstract, Index Terms and Review]
[Full Text in PDF Format, 556 KB]
References
- [Agrawal 1993]
- Divyakant Agrawal, Amr El Abbadi, Ambuj K. Singh:
Consistency and Orderability: Semantics-Based Correctness Criteria for Databases.
ACM Trans. Database Syst. 18(3): 460-486(1993) BibTeX
- [Abrial 1993]
- ...
- [Ammann et al. 1995]
- Paul Ammann, Sushil Jajodia, Indrakshi Ray:
Using Formal Methods to Reason about Semantics-Based Decompositions of Transactions.
VLDB 1995: 218-227 BibTeX
- [Arora and Kulkarni 1995]
- ...
- [Bernstein et al. 1987]
- Philip A. Bernstein, Vassos Hadzilacos, Nathan Goodman:
Concurrency Control and Recovery in Database Systems.
Addison-Wesley 1987, ISBN 0-201-10715-5
Contents BibTeX
- [Badrinath and Ramamritham 1992]
- B. R. Badrinath, Krithi Ramamritham:
Semantics-Based Concurrency Control: Beyond Commutativity.
ACM Trans. Database Syst. 17(1): 163-199(1992) BibTeX
- [Chrysanthis and Ramamritham 1994]
- Panos K. Chrysanthis, Krithi Ramamritham:
Synthesis of Extended Transaction Models Using ACTA.
ACM Trans. Database Syst. 19(3): 450-491(1994) BibTeX
- [Du and Elmagarmid 1989]
- Weimin Du, Ahmed K. Elmagarmid:
Quasi Serializability: a Correctness Criterion for Global Concurrency Control in InterBase.
VLDB 1989: 347-355 BibTeX
- [Elmasri and Navathe 1989]
- Ramez Elmasri, Shamkant B. Navathe:
Fundamentals of Database Systems.
Benjamin/Cummings 1989
BibTeX
- [Farrag and Özsu 1989]
- Abdel Aziz Farrag, M. Tamer Özsu:
Using Semantic Knowledge of Transactions to Increase Concurrency.
ACM Trans. Database Syst. 14(4): 503-525(1989) BibTeX
- [Garcia-Molina 1983]
- Hector Garcia-Molina:
Using Semantic Knowledge for Transaction Processing in Distributed Database.
ACM Trans. Database Syst. 8(2): 186-213(1983) BibTeX
- [Garcia-Molina and Salem 1987]
- Hector Garcia-Molina, Kenneth Salem:
Sagas.
SIGMOD Conference 1987: 249-259 BibTeX
- [Herlihy 1987]
- Maurice Herlihy:
Extending Multiversion Time-Stamping Protocols to Exploit Type Information.
IEEE Trans. Computers 36(4): 443-448(1987) BibTeX
- [Herlihy and Weihl 1991]
- Maurice Herlihy, William E. Weihl:
Hybrid Concurrency Control for Abstract Data Types.
J. Comput. Syst. Sci. 43(1): 25-61(1991) BibTeX
- [Jajodia and Meadows 1987]
- Sushil Jajodia, Catherine Meadows:
Mutual Consistency in Decentralized Distributed Systems.
ICDE 1987: 396-404 BibTeX
- [Korth et al. 1990]
- Henry F. Korth, Eliezer Levy, Abraham Silberschatz:
A Formal Approach to Recovery by Compensating Transactions.
VLDB 1990: 95-106 BibTeX
- [Korth and Speegle 1988]
- Henry F. Korth, Gregory D. Speegle:
Formal Model of Correctness Without Serializability.
SIGMOD Conference 1988: 379-386 BibTeX
- [Korth and Speegle 1994]
- Henry F. Korth, Gregory D. Speegle:
Formal Aspects of Concurrency Control in Long-Duration Transaction Systems Using the NT/PV Model.
ACM Trans. Database Syst. 19(3): 492-535(1994) BibTeX
- [Levy et al. 1991a]
- Eliezer Levy, Henry F. Korth, Abraham Silberschatz:
An Optimistic Commit Protocol for Distributed Transaction Management.
SIGMOD Conference 1991: 88-97 BibTeX
- [Levy et al. 1991b]
- Eliezer Levy, Henry F. Korth, Abraham Silberschatz:
A Theory of Relaxed Atomicity (Extended Abstract).
PODC 1991: 95-109 BibTeX
- [Lynch et al. 1994]
- ...
- [Lynch 1983]
- Nancy A. Lynch:
Multilevel Atomicity - A New Correctness Criterion for Database Concurrency Control.
ACM Trans. Database Syst. 8(4): 484-502(1983) BibTeX
- [Owicki and Gries 1976]
- Susan S. Owicki, David Gries:
Verifying Properties of Parallel Programs: An Axiomatic Approach.
Commun. ACM 19(5): 279-285(1976) BibTeX
- [Potter et al. 1991]
- ...
- [Rastogi et al. 1995]
- Rajeev Rastogi, Henry F. Korth, Abraham Silberschatz:
Exploiting Transaction Semantics in Multidatabase Systems.
ICDCS 1995: 101-109 BibTeX
- [Sha et al. 1988]
- Lui Sha, John P. Lehoczky, E. Douglas Jensen:
Modular Concurrency Control and Failure Recovery.
IEEE Trans. Computers 37(2): 146-159(1988) BibTeX
- [Spivey 1992]
- ...
- [Shasha et al. 1992]
- Dennis Shasha, Eric Simon, Patrick Valduriez:
Simple Rational Guidance for Chopping Up Transactions.
SIGMOD Conference 1992: 298-307 BibTeX
- [Weihl 1984]
- ...
- [Weihl 1988]
- William E. Weihl:
Commutativity-Based Concurrency Control for Abstract Data Types.
IEEE Trans. Computers 37(12): 1488-1505(1988) BibTeX
- [Wächter and Reuter 1992]
- Helmut Wächter, Andreas Reuter:
The ConTract Model.
Database Transaction Models for Advanced Applications 1992: 219-263 BibTeX
Referenced by
- Sushil Jajodia, Catherine D. McCollum, Paul Ammann:
Trusted Recovery.
Commun. ACM 42(7): 71-75(1999)
- Alexander Thomasian:
Concurrency Control: Methods, Performance, and Analysis.
ACM Comput. Surv. 30(1): 70-119(1998)
- Arthur J. Bernstein, David Scott Gerstl, Wai-Hong Leung, Philip M. Lewis:
Design and Performance of an Assertional Concurrency Control System.
ICDE 1998: 436-445
BibTeX
ACM SIGMOD Anthology - DBLP:
[Home | Search: Author, Title | Conferences | Journals]
TODS, ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Tue Jun 24 18:39:21 2008