Concurrency Control in Distributed Object-Oriented Database Systems.

Kjetil Nørvåg, Olav Sandstå, Kjell Bratbergsengen: Concurrency Control in Distributed Object-Oriented Database Systems. ADBIS 1997: 9-17
  author    = {Kjetil N{\o}rv{\aa}g and
               Olav Sandst{\aa} and
               Kjell Bratbergsengen},
  title     = {Concurrency Control in Distributed Object-Oriented Database Systems},
  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     = {9-17},
  ee        = {db/conf/adbis/NorvaagSB97.html},
  crossref  = {DBLP:conf/adbis/97},
  bibsource = {DBLP,}


Simulating distributed database systems is inherently difficult, as there are many factors that may influence the results. This includes architectural options as well as workload and data distribution. In this paper we present the DBsim simulator and some simulation results. The DBsim simulator architecture is extendible, and it is easy to change parameters and configuration. The simulation results in this paper is a comparison of performance and response times for two concurrency control algorithms, timestamp ordering and two-phase locking. The simulations have been run with different number of nodes, network types, data declustering and work-loads. The results show that for a mix of small and long transactions, the throughput is significantly higher for a system with a timestamp ordering scheduler than for a system with a two-phase locking scheduler. With only short transactions, the performance of the two schedulers are almost identical. Long transactions are treated more fair by a two-phase locking scheduler, because a time-stamp ordering scheduler has a very high abort rate for long transactions.

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 ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ... BibTeX


Rakesh Agrawal, Michael J. Carey, Miron Livny: Concurrency Control Performance Modeling: Alternatives and Implications. ACM Trans. Database Syst. 12(4): 609-654(1987) BibTeX
Naser S. Barghouti, Gail E. Kaiser: Concurrency Control in Advanced Database Applications. ACM Comput. Surv. 23(3): 269-317(1991) BibTeX
Philip A. Bernstein, Vassos Hadzilacos, Nathan Goodman: Concurrency Control and Recovery in Database Systems. Addison-Wesley 1987, ISBN 0-201-10715-5
Contents BibTeX
Michael J. Carey, Michael J. Franklin, Markos Zaharioudakis: Fine-Grained Sharing in a Page Server OODBMS. SIGMOD Conference 1994: 359-370 BibTeX
Michael J. Carey, Miron Livny: Parallelism and Concurrency Control Performance in Distributed Database Machines. SIGMOD Conference 1989: 122-133 BibTeX
Peter A. Franaszek, John T. Robinson, Alexander Thomasian: Concurrency Control for High Contention Environments. ACM Trans. Database Syst. 17(2): 304-345(1992) BibTeX
Michael J. Franklin: Caching and Memory Management in Client-Server Database Systems. Ph.D. thesis, Univ. of Wisconsin-Madison 1993
Jim Gray, Andreas Reuter: Transaction Processing: Concepts and Techniques. Morgan Kaufmann 1993, ISBN 1-55860-190-2
Contents BibTeX
M. Tamer Özsu, Patrick Valduriez: Principles of Distributed Database Systems. Prentice-Hall 1991, ISBN 0-13-715681-2
Alexander Thomasian: Performance Limits of Two-Phase Locking. ICDE 1991: 426-435 BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
ACM SIGMOD Anthology: Copyright © by ACM (, Corrections:
DBLP: Copyright © by Michael Ley (, last change: Sat May 16 22:56:29 2009