Symmetric concurrent B-tree algorithm

Vladimir Lanin, Dennis Shasha

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The authors present a method for concurrent B-tree manipulation in which insertions are performed as in an earlier paper by P. Lehman and S. B. Yao (1981) and deletions are done in a symmetrical, novel fashion. The result is an algorithm in which each process holds locks on at most one node at a time, except in rare cases. To allow this low level of synchronization, the integrity constraints on the data structure are reexamined. This information is useful in verifying the algorithm by a general semantic serializability proof method. Simulation shows that the algorithm is capable of achieving significantly better concurrency than algorithms that perform insertions and deletions symmetrically.

Original languageEnglish (US)
Title of host publicationFall joint computer conference, November 1986
EditorsHarold S. Stone
PublisherIEEE
Pages380-389
Number of pages10
ISBN (Print)0818607432
StatePublished - 1986

Fingerprint

Data structures
Synchronization
Semantics

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Lanin, V., & Shasha, D. (1986). Symmetric concurrent B-tree algorithm. In H. S. Stone (Ed.), Fall joint computer conference, November 1986 (pp. 380-389). IEEE.

Symmetric concurrent B-tree algorithm. / Lanin, Vladimir; Shasha, Dennis.

Fall joint computer conference, November 1986. ed. / Harold S. Stone. IEEE, 1986. p. 380-389.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lanin, V & Shasha, D 1986, Symmetric concurrent B-tree algorithm. in HS Stone (ed.), Fall joint computer conference, November 1986. IEEE, pp. 380-389.
Lanin V, Shasha D. Symmetric concurrent B-tree algorithm. In Stone HS, editor, Fall joint computer conference, November 1986. IEEE. 1986. p. 380-389
Lanin, Vladimir ; Shasha, Dennis. / Symmetric concurrent B-tree algorithm. Fall joint computer conference, November 1986. editor / Harold S. Stone. IEEE, 1986. pp. 380-389
@inproceedings{ab493a2e4a2a4f8481915259cf00af84,
title = "Symmetric concurrent B-tree algorithm",
abstract = "The authors present a method for concurrent B-tree manipulation in which insertions are performed as in an earlier paper by P. Lehman and S. B. Yao (1981) and deletions are done in a symmetrical, novel fashion. The result is an algorithm in which each process holds locks on at most one node at a time, except in rare cases. To allow this low level of synchronization, the integrity constraints on the data structure are reexamined. This information is useful in verifying the algorithm by a general semantic serializability proof method. Simulation shows that the algorithm is capable of achieving significantly better concurrency than algorithms that perform insertions and deletions symmetrically.",
author = "Vladimir Lanin and Dennis Shasha",
year = "1986",
language = "English (US)",
isbn = "0818607432",
pages = "380--389",
editor = "Stone, {Harold S.}",
booktitle = "Fall joint computer conference, November 1986",
publisher = "IEEE",

}

TY - GEN

T1 - Symmetric concurrent B-tree algorithm

AU - Lanin, Vladimir

AU - Shasha, Dennis

PY - 1986

Y1 - 1986

N2 - The authors present a method for concurrent B-tree manipulation in which insertions are performed as in an earlier paper by P. Lehman and S. B. Yao (1981) and deletions are done in a symmetrical, novel fashion. The result is an algorithm in which each process holds locks on at most one node at a time, except in rare cases. To allow this low level of synchronization, the integrity constraints on the data structure are reexamined. This information is useful in verifying the algorithm by a general semantic serializability proof method. Simulation shows that the algorithm is capable of achieving significantly better concurrency than algorithms that perform insertions and deletions symmetrically.

AB - The authors present a method for concurrent B-tree manipulation in which insertions are performed as in an earlier paper by P. Lehman and S. B. Yao (1981) and deletions are done in a symmetrical, novel fashion. The result is an algorithm in which each process holds locks on at most one node at a time, except in rare cases. To allow this low level of synchronization, the integrity constraints on the data structure are reexamined. This information is useful in verifying the algorithm by a general semantic serializability proof method. Simulation shows that the algorithm is capable of achieving significantly better concurrency than algorithms that perform insertions and deletions symmetrically.

UR - http://www.scopus.com/inward/record.url?scp=0022914903&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022914903&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0818607432

SP - 380

EP - 389

BT - Fall joint computer conference, November 1986

A2 - Stone, Harold S.

PB - IEEE

ER -