Concurrent Set Manipulation without Locking.
Vladimir Lanin, Dennis Shasha:
Concurrent Set Manipulation without Locking.
PODS 1988: 211-220@inproceedings{DBLP:conf/pods/LaninS88,
author = {Vladimir Lanin and
Dennis Shasha},
title = {Concurrent Set Manipulation without Locking},
booktitle = {Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium
on Principles of Database Systems, March 21-23, 1988, Austin,
Texas},
publisher = {ACM},
year = {1988},
isbn = {0-89791-263-2},
pages = {211-220},
ee = {http://doi.acm.org/10.1145/308386.308442, db/conf/pods/LaninS88.html},
crossref = {DBLP:conf/pods/88},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Abstract
Set manipulation consists of the actions insert, delete, and member on keys. We propose a concurrent set mampulation algorithm that uses no locking at all and requires no aborts, relying instead on atomic read-modify-write operations on single (data) locations. The algorithm satifies order-preserving serializability through conditions that are strictly looser than existing algorithms.
Copyright © 1988 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.
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 ...
Printed Edition
Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, March 21-23, 1988, Austin, Texas.
ACM 1988, ISBN 0-89791-263-2
Contents
References
- [BG81]
- Philip A. Bernstein, Nathan Goodman:
Concurrency Control in Distributed Database Systems.
ACM Comput. Surv. 13(2): 185-221(1981)

- [BS77]
- Rudolf Bayer, Mario Schkolnick:
Concurrency of Operations on B-Trees.
Acta Inf. 9: 1-21(1977)

- [El80]
- Carla Schlatter Ellis:
Concurrent Search and Insertion in 2-3 Trees.
Acta Inf. 14: 63-86,(1980)

- [El82]
- Carla Schlatter Ellis:
Extendible Hashing for Concurrent Operations and Distributed Data.
PODS 1983: 106-116

- [El85]
- Carla Schlatter Ellis:
Concurrency and Linear Hashing.
PODS 1985: 1-7

- [FC84]
- Ray Ford, Jim Calhoun:
Concurrency Control Mechanisms and the Serializability of Concurrent Tree Algorithms.
PODS 1984: 51-60

- [GGKMRS83]
- ...
- [GS85]
- Nathan Goodman, Dennis Shasha:
Semantically-based Concurrency Control for Search Structures.
PODS 1985: 8-19

- [HY86]
- Meichun Hsu, Wei-Pang Yang:
Concurrent Operations in Extendible Hashing.
VLDB 1986: 241-247

- [KL80]
- H. T. Kung, Philip L. Lehman:
Concurrent Manipulation of Binary Search Trees.
ACM Trans. Database Syst. 5(3): 354-382(1980)

- [KP83]
- H. T. Kung, Christos H. Papadimitriou:
An Optimality Theory of Concurrency Control for Databases.
Acta Inf. 19: 1-11(1983)

- [KS83]
- Zvi M. Kedem, Abraham Silberschatz:
Locking Protocols: From Exclusive to Shared Locks.
J. ACM 30(4): 787-804(1983)

- [KW82]
- Yat-Sang Kwong, Derick Wood:
A New Method for Concurrency in B-Trees.
IEEE Trans. Software Eng. 8(3): 211-222(1982)

- [LS86]
- Vladimir Lanin, Dennis Shasha:
A Symmetric Concurrent B-Tree Algorithm.
FJCC 1986: 380-389

- [LY81]
- Philip L. Lehman, S. Bing Yao:
Efficient Locking for Concurrent Operations on B-Trees.
ACM Trans. Database Syst. 6(4): 650-670(1981)

- [ML82]
- Udi Manber, Richard E. Ladner:
Concurrency Control in a Dynamic Search Structure.
PODS 1982: 268-282

- [MR85]
- Yehudit Mond, Yoav Raz:
Concurrency Control in B+-Trees Databases Using Preparatory Operations.
VLDB 1985: 331-334

- [Pa79]
- Christos H. Papadimitriou:
The serializability of concurrent database updates.
J. ACM 26(4): 631-653(1979)

- [Sag85]
- Yehoshua Sagiv:
Concurrent Operations on B-Trees with Overtaking.
PODS 1985: 28-37

- [Sam76]
- Behrokh Samadi:
B-Trees in a System with Multiple Users.
Inf. Process. Lett. 5(4): 107-112(1976)

- [Sch78]
- Gunter Schlageter:
Process Synchronization in Database Systems.
ACM Trans. Database Syst. 3(3): 248-271(1978)

- [Sh84]
- ...
- [SLS87]
- ...
Copyright © Fri Dec 18 18:40:56 2009
by Michael Ley (ley@uni-trier.de)