ACM SIGMOD Anthology ACM SIGMOD dblp.uni-trier.de

Timestamp Based Certification Schemes for Transactions in Distributed Database Systems.

Mukul K. Sinha, P. D. Nanadikar, S. L. Mehndiratta: Timestamp Based Certification Schemes for Transactions in Distributed Database Systems. SIGMOD Conference 1985: 402-411
@inproceedings{DBLP:conf/sigmod/SinhaNM85,
  author    = {Mukul K. Sinha and
               P. D. Nanadikar and
               S. L. Mehndiratta},
  editor    = {Shamkant B. Navathe},
  title     = {Timestamp Based Certification Schemes for Transactions in Distributed
               Database Systems},
  booktitle = {Proceedings of the 1985 ACM SIGMOD International Conference on
               Management of Data, Austin, Texas, May 28-31, 1985},
  publisher = {ACM Press},
  year      = {1985},
  pages     = {402-411},
  ee        = {http://doi.acm.org/10.1145/318898.318990, db/conf/sigmod/SinhaNM85.html},
  crossref  = {DBLP:conf/sigmod/85},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

Abstract

Two certification schemes for transactions in distributed database systems are proposed. The schemes do not construct any conflict graph but use system-wide unique timestamps to serialize certification requests of concurrent transactions. In the first scheme, the distributed certification scheme, transactions are assigned timestamp when they request for cerification. A transaction get certified if, at no site, its certification request conflict with that of a transaction with higher timestamp. In the second scheme, the negotiated certification scheme, the system negotiates with participating data items, and comes up with a timestamp, if possible, with which a transaction will not face any conflict with concurent trans actions and will get certified. The two phases commit protocol can very easily be integrated with either of the two certification schemes, and it is shown that the schemes do not need any extra message cost to guarantee failure atomicity.

Copyright © 1985 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

Online Version (ACM WWW Account required): Full Text in PDF Format

CDROM Version: Load the CDROM "Volume 1 Issue 2, SIGMOD '75-'92" and ...

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

Printed Edition

Shamkant B. Navathe (Ed.): Proceedings of the 1985 ACM SIGMOD International Conference on Management of Data, Austin, Texas, May 28-31, 1985. ACM Press 1985 BibTeX , SIGMOD Record 14(4)
Contents

Online Edition: ACM Digital Library


References

[BADA 79]
...
[BAYE 82]
Rudolf Bayer, Klaus Elhardt, Johannes Heigert, Angelika Reiser: Dynamic Timestamp Allocation for Transactions in Database Systems. DDB 1982: 9-20 BibTeX
[BERN 79]
Philip A. Bernstein, David W. Shipman, Wing S. Wong: Formal Aspects of Serializability in Database Concurrency Control. IEEE Trans. Software Eng. 5(3): 203-216(1979) BibTeX
[BERN 81]
Philip A. Bernstein, Nathan Goodman: Concurrency Control in Distributed Database Systems. ACM Comput. Surv. 13(2): 185-221(1981) BibTeX
[BHAR 82]
...
[DIJK 68]
...
[GRAY 78]
Jim Gray: Notes on Data Base Operating Systems. Advanced Course: Operating Systems 1978: 393-481 BibTeX
[KUNG 81]
H. T. Kung, John T. Robinson: On Optimistic Methods for Concurrency Control. ACM Trans. Database Syst. 6(2): 213-226(1981) BibTeX
[LAMP 78]
Leslie Lamport: Time, Clocks, and the Ordering of Events in a Distributed System. Commun. ACM 21(7): 558-565(1978) BibTeX
[LAMP 76]
...
[REED 78]
...
[SCHL 81]
Gunter Schlageter: Optimistic Methods for Concurrency Control in Distributed Database Systems. VLDB 1981: 125-130 BibTeX
[SINH 83]
...
[SINH 85]
...
[THOM 79]
Robert H. Thomas: A Majority Consensus Approach to Concurrency Control for Multiple Copy Databases. ACM Trans. Database Syst. 4(2): 180-209(1979) BibTeX

Referenced by

  1. Michael J. Carey, Miron Livny: Conflict Detection Tradeoffs for Replicated Data. ACM Trans. Database Syst. 16(4): 703-746(1991)
  2. Philip S. Yu, Hans-Ulrich Heiss, Daniel M. Dias: Modeling and Analysis of a Time-Stamp History Based Certification Protocol for Concurrency Control. IEEE Trans. Knowl. Data Eng. 3(4): 525-537(1991)
  3. Maurice Herlihy: Apologizing Versus Asking Permission: Optimistic Concurrency Control for Abstract Data Types. ACM Trans. Database Syst. 15(1): 96-124(1990)
  4. Bruno Ciciani, Daniel M. Dias, Philip S. Yu: Analysis of Replication in Distributed Database Systems. IEEE Trans. Knowl. Data Eng. 2(2): 247-261(1990)
  5. Michael J. Carey, Miron Livny: Parallelism and Concurrency Control Performance in Distributed Database Machines. SIGMOD Conference 1989: 122-133
  6. Jean-François Pons, Jean-François Vilarem: Mixed concurrency control: Dealing with heterogeneity in distributed database systems. VLDB 1988: 445-456
  7. Michael J. Carey, Miron Livny: Distributed Concurrency Control Performance: A Study of Algorithms, Distribution, and Replication. VLDB 1988: 13-25
  8. Philip A. Bernstein, Vassos Hadzilacos, Nathan Goodman: Concurrency Control and Recovery in Database Systems. Addison-Wesley 1987, ISBN 0-201-10715-5
    Contents
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:39:43 2009