System Defined Prewrites for Increasing Concurrency in Databases.

Sanjay Kumar Madria, Bharat K. Bhargava: System Defined Prewrites for Increasing Concurrency in Databases. ADBIS 1997: 18-22

@inproceedings{DBLP:conf/adbis/MadriaB97,
  author    = {Sanjay Kumar Madria and
               Bharat K. Bhargava},
  title     = {System Defined Prewrites for Increasing Concurrency in Databases},
  booktitle = {Proceedings of the First East-European Symposium on Advances
               in Databases and Information Systems (ADBIS'97), St.-Petersburg,
               September 2-5, 1997. Volume 1: Regular Papers},
  publisher = {Nevsky Dialect},
  year      = {1997},
  pages     = {18-22},
  ee        = {db/conf/adbis/MadriaB97.html},
  crossref  = {DBLP:conf/adbis/97},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

We introduce a prewrite operation before an actual write operation is performed on database files. A prewrite operation announces the value a transaction intends to write in future. A prewrite operation does not change the state of the data object. Once all the prewrites of a transaction are announced, the transaction executes a pre-commit operation. After the pre-commit, a read transaction is permitted to read the announced prewrite values even before the other transaction has finally updated the data objects and committed. Therefore, our algorithm allows non-strict executions and increases the potential concurrency as compared to the algorithms that permit only read and write operations on the database files. In our algorithm, a user does not explicitly mention a prewrite operation but the system introduces a prewrite operation before every write. Two phase locking is used to control concurrent operations. A proof of correctness of the concurrent algorithm has also been given.

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.

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 2 Issue 5, SSDBM, DBPL, KRDB, ADBIS, COOPIS, SIGBDP" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the CD and click on the path of your mount point:
/Anthology/An2-5 or /cdrom

DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the DVD and click on the path of your mount point:
/Anthology/aDVD1 or /dvd

References

[1]: Philip A. Bernstein, Vassos Hadzilacos, Nathan Goodman: Concurrency Control and Recovery in Database Systems. Addison-Wesley 1987, ISBN 0-201-10715-5
Contents
[2]: ...
[3]: William E. Weihl: Commutativity-Based Concurrency Control for Abstract Data Types. IEEE Trans. Computers 37(12): 1488-1505(1988)
[4]: H. T. Kung, John T. Robinson: On Optimistic Methods for Concurrency Control. ACM Trans. Database Syst. 6(2): 213-226(1981)
[5]: Mihalis Yannakakis: Serializability by Locking. J. ACM 31(2): 227-244(1984)
[6]: Kapali P. Eswaran, Jim Gray, Raymond A. Lorie, Irving L. Traiger: The Notions of Consistency and Predicate Locks in a Database System. Commun. ACM 19(11): 624-633(1976)
[7]: Henry F. Korth: Locking Primitives in a Database System. J. ACM 30(1): 55-79(1983)
[8]: François Bancilhon, Won Kim, Henry F. Korth: A Model of CAD Transactions. VLDB 1985: 25-33
[9]: Umeshwar Dayal, Meichun Hsu, Rivka Ladin: Organizing Long-Running Activities with Triggers and Transactions. SIGMOD Conference 1990: 204-214
[10]: Henry F. Korth, Gregory D. Speegle: Long-Duration Transactions in Software Design Projects. ICDE 1990: 568-574
[11]: ...
[12]: Catriel Beeri, Philip A. Bernstein, Nathan Goodman: A model for concurrency in nested transactions systems. J. ACM 36(2): 230-269(1989)
[13]: Gerhard Weikum: Principles and Realization Strategies of Multilevel Transaction Management. ACM Trans. Database Syst. 16(1): 132-180(1991)
[14]: Henry F. Korth, Gregory D. Speegle: Formal Model of Correctness Without Serializability. SIGMOD Conference 1988: 379-386
[15]: 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)
[16]: ...
[17]: Won Kim, Raymond A. Lorie, Dan McNabb, Wil Plouffe: A Transaction Mechanism for Engineering Design Databases. VLDB 1984: 355-362
[18]: Christos H. Papadimitriou: The serializability of concurrent database updates. J. ACM 26(4): 631-653(1979)
[19]: Sanjay Kumar Madria, S. N. Maheshwari, B. Chandra, Bharat K. Bhargava: Crash Recovery in an Open and Safe Nested Transaction Model. DEXA 1997: 440-451
[20]: Pei-Jyun Leu, Bharat K. Bhargava: Clarification of Two Phase Locking in Concurrent Transaction Processing. IEEE Trans. Software Eng. 14(1): 122-125(1988)