High Throughput Escrow Algorithms for Replicated Databases.
Narayanan Krishnakumar, Arthur J. Bernstein:
High Throughput Escrow Algorithms for Replicated Databases.
VLDB 1992: 175-186@inproceedings{DBLP:conf/vldb/KrishnakumarB92,
author = {Narayanan Krishnakumar and
Arthur J. Bernstein},
editor = {Li-Yan Yuan},
title = {High Throughput Escrow Algorithms for Replicated Databases},
booktitle = {18th International Conference on Very Large Data Bases, August
23-27, 1992, Vancouver, Canada, Proceedings},
publisher = {Morgan Kaufmann},
year = {1992},
isbn = {1-55860-151-1},
pages = {175-186},
ee = {db/conf/vldb/KrishnakumarB92.html},
crossref = {DBLP:conf/vldb/92},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Abstract
The traditional correctness criterion in replicated databases is one-copy serializability.
However, this criterion is sometimes restrictive and degrades performance.
Recent research has therefore focused on utilising application semantics to increase transaction throughput in certain high-performance applications.
One such application involves resource allocation.
To improve concurrency in such a system, the transaction escrow (TE) and site escrow (SE) algorithms have been proposed.
In this paper, we present a generalized site escrow algorithm (GSE) that provides high site autonomy and throughput.
GSE requires only a loose synchronization between sites, and employs the mechanisms of quorum locking and background gossip messages.
We perform a comparison between GSE and TE, and outline regions in which GSE performs better.
We also propose a family of hybrid algorithms that switch between GSE and TE under appropriate circumstances so that the benefits of both algorithms can be utilized.
Finally, we present a variant of GSE that does not use locking.
Copyright © 1992 by the VLDB Endowment.
Permission to copy without fee all or part of this material is granted provided that the copies are not made or
distributed for direct commercial advantage, the VLDB
copyright notice and the title of the publication and
its date appear, and notice is given that copying
is by the permission of the Very Large Data Base
Endowment. To copy otherwise, or to republish, requires
a fee and/or special permission from the Endowment.
Online Paper
CDROM Version: Load the CDROM "Volume 1 Issue 5, VLDB '89-'97" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
Printed Edition
Li-Yan Yuan (Ed.):
18th International Conference on Very Large Data Bases, August 23-27, 1992, Vancouver, Canada, Proceedings.
Morgan Kaufmann 1992, ISBN 1-55860-151-1
Contents
References
- [BG91]
- Daniel Barbará, Hector Garcia-Molina:
The Demarcation Protocol: A Technique for Maintaining Linear Arithmetic Constraints in Distributed Database Systems.
EDBT 1992: 373-388
- [BHG87]
- Philip A. Bernstein, Vassos Hadzilacos, Nathan Goodman:
Concurrency Control and Recovery in Database Systems.
Addison-Wesley 1987, ISBN 0-201-10715-5
Contents - [Har88]
- Theo Härder:
Handling hot spot in DB-sharing systems.
Inf. Syst. 13(2): 155-166(1988)
- [Her87]
- Maurice Herlihy:
Concurrency versus Availability: Atomic Mechanisms for Replicated Data.
ACM Trans. Comput. Syst. 5(3): 249-274(1987)
- [HHW89]
- ...
- [KB91]
- Narayanan Krishnakumar, Arthur J. Bernstein:
Bounded Ignorance in Replicated Systems.
PODS 1991: 63-74
- [KB92]
- ...
- [KS88]
- Akhil Kumar, Michael Stonebraker:
Semantics Based Transaction Management Techniques for Replicated Data.
SIGMOD Conference 1988: 117-125
- [ONe86]
- Patrick E. O'Neil:
The Escrow Transactional Method.
ACM Trans. Database Syst. 11(4): 405-430(1986)
- [SS90]
- Nandit Soparkar, Abraham Silberschatz:
Data-value Partitioning and Virtual Messages.
PODS 1990: 357-367
- [WB84]
- Gene T. J. Wuu, Arthur J. Bernstein:
Efficient Solutions to the Replicated Log and Dictionart Problems.
PODC 1984: 233-242
Copyright © Tue Mar 16 02:22:02 2010
by Michael Ley (ley@uni-trier.de)