Concurrency Control Mechanisms and the Serializability of Concurrent Tree Algorithms.
Ray Ford, Jim Calhoun:
Concurrency Control Mechanisms and the Serializability of Concurrent Tree Algorithms.
PODS 1984: 51-60@inproceedings{DBLP:conf/pods/FordC84,
author = {Ray Ford and
Jim Calhoun},
title = {Concurrency Control Mechanisms and the Serializability of Concurrent
Tree Algorithms},
booktitle = {Proceedings of the Third ACM SIGACT-SIGMOD Symposium on Principles
of Database Systems, April 2-4, 1984, Waterloo, Ontario, Canada},
publisher = {ACM},
year = {1984},
isbn = {0-89791-128-8},
pages = {51-60},
ee = {http://doi.acm.org/10.1145/588011.588020, db/conf/pods/FordC84.html},
crossref = {DBLP:conf/pods/84},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
Load The ACM SIGMOD Anthology, CDROM Edition, Volume 1-3, PODS '82-'98.
and ...
Load The ACM SIGMOD Anthology, Silver Edition, DVD 1, Proceedings.
and ...
BibTeX
Printed Edition
Proceedings of the Third ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, April 2-4, 1984, Waterloo, Ontario, Canada.
ACM 1984, ISBN 0-89791-128-8
Contents BibTeX
References
- [1]
- Philip A. Bernstein, Nathan Goodman, Ming-Yee Lai:
Analyzing Concurrency Control Algorithms When User and System Operations Differ.
IEEE Trans. Software Eng. 9(3): 233-239(1983) BibTeX
- [2]
- Michael J. Carey:
An Abstract Model of Database Concurrency Control Algorithms.
SIGMOD Conference 1983: 97-107 BibTeX
- [3]
- Carla Schlatter Ellis:
Concurrent Search and Insertion in 2-3 Trees.
Acta Inf. 14: 63-86,(1980) BibTeX
- [4]
- ...
- [5]
- 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) BibTeX
- [6]
- H. T. Kung, Christos H. Papadimitriou:
An Optimality Theory of Concurrency Control for Databases.
SIGMOD Conference 1979: 116-126 BibTeX
- [7]
- H. T. Kung, Philip L. Lehman:
Concurrent Manipulation of Binary Search Trees.
ACM Trans. Database Syst. 5(3): 354-382(1980) BibTeX
- [8]
- Yat-Sang Kwong, Derick Wood:
A New Method for Concurrency in B-Trees.
IEEE Trans. Software Eng. 8(3): 211-222(1982) BibTeX
- [9]
- Philip L. Lehman, S. Bing Yao:
Efficient Locking for Concurrent Operations on B-Trees.
ACM Trans. Database Syst. 6(4): 650-670(1981) BibTeX
- [10]
- Christos H. Papadimitriou:
The serializability of concurrent database updates.
J. ACM 26(4): 631-653(1979) BibTeX
- [11]
- ...
- [12]
- ...
- [13]
- ...
- [14]
- William E. Weihl:
Data-dependent Concurrency Control and Recovery (Extended Abstract).
PODC 1983: 63-75 BibTeX
Referenced by
- Ragaa Ishak:
Semantically Consistent Schedules for Efficient and Concurrent B-Tree Restructuring.
ICDE 1992: 184-191
- Dennis Shasha, Nathan Goodman:
Concurrent Search Structure Algorithms.
ACM Trans. Database Syst. 13(1): 53-90(1988)
- Vladimir Lanin, Dennis Shasha:
Concurrent Set Manipulation without Locking.
PODS 1988: 211-220
- Alexandros Biliris:
Operation Specific Locking in B-Trees.
PODS 1987: 159-169
- Philip A. Bernstein, Vassos Hadzilacos, Nathan Goodman:
Concurrency Control and Recovery in Database Systems.
Addison-Wesley 1987, ISBN 0-201-10715-5
Contents - Nathan Goodman, Dennis Shasha:
Semantically-based Concurrency Control for Search Structures.
PODS 1985: 8-19
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:33:44 2009