Concurrent Operations on B-Trees with Overtaking

Yehoshua Sagiv

doi:10.1145/325405.325409

Concurrent Operations on B-Trees with Overtaking

Yehoshua Sagiv^*

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

49 Scopus citations

Abstract

Algorithms for concurrent searches and insertions on B-trees are presented. These algorithms improve those given in [LY], since an updater has to lock only one node simultaneously (as opposed to two or three in [LY]). In addition, an algorithm for compressing the tree, which runs concurrently with searches and insertions, is described. This compression process can be initiated after each deletion that leaves a node less than half full, and several compression processes may run concurrently. Each compression process has to lock simultaneously three nodes.

Original language	English
Title of host publication	PODS 1985
Subtitle of host publication	Proceedings of the 4th ACM SIGACT-SIGMOD Symposium on Principles of Database Systems
Publisher	Association for Computing Machinery
Pages	28-37
Number of pages	10
ISBN (Electronic)	9780897911535
DOIs	https://doi.org/10.1145/325405.325409
State	Published - 25 Mar 1985
Event	4th ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, PODS 1985 - Portland, United States Duration: 25 Mar 1985 → 27 Mar 1985

Publication series

Name	Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
ISSN (Print)	1055-6338

Conference

Conference	4th ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, PODS 1985
Country/Territory	United States
City	Portland
Period	25/03/85 → 27/03/85

Bibliographical note

Publisher Copyright:
© 1985 Association for Computing Machinery. All rights reserved.

Access to Document

10.1145/325405.325409

Cite this

@inproceedings{6e8331fd89f14e39a8ff90252b97fb74,

title = "Concurrent Operations on B-Trees with Overtaking",

abstract = "Algorithms for concurrent searches and insertions on B-trees are presented. These algorithms improve those given in [LY], since an updater has to lock only one node simultaneously (as opposed to two or three in [LY]). In addition, an algorithm for compressing the tree, which runs concurrently with searches and insertions, is described. This compression process can be initiated after each deletion that leaves a node less than half full, and several compression processes may run concurrently. Each compression process has to lock simultaneously three nodes.",

author = "Yehoshua Sagiv",

note = "Publisher Copyright: {\textcopyright} 1985 Association for Computing Machinery. All rights reserved.; 4th ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, PODS 1985 ; Conference date: 25-03-1985 Through 27-03-1985",

year = "1985",

month = mar,

day = "25",

doi = "10.1145/325405.325409",

language = "אנגלית",

series = "Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems",

publisher = "Association for Computing Machinery",

pages = "28--37",

booktitle = "PODS 1985",

}

Sagiv, Y 1985, Concurrent Operations on B-Trees with Overtaking. in PODS 1985: Proceedings of the 4th ACM SIGACT-SIGMOD Symposium on Principles of Database Systems. Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Association for Computing Machinery, pp. 28-37, 4th ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, PODS 1985, Portland, United States, 25/03/85. https://doi.org/10.1145/325405.325409

Concurrent Operations on B-Trees with Overtaking. / Sagiv, Yehoshua.
PODS 1985: Proceedings of the 4th ACM SIGACT-SIGMOD Symposium on Principles of Database Systems. Association for Computing Machinery, 1985. p. 28-37 (Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Concurrent Operations on B-Trees with Overtaking

AU - Sagiv, Yehoshua

PY - 1985/3/25

Y1 - 1985/3/25

N2 - Algorithms for concurrent searches and insertions on B-trees are presented. These algorithms improve those given in [LY], since an updater has to lock only one node simultaneously (as opposed to two or three in [LY]). In addition, an algorithm for compressing the tree, which runs concurrently with searches and insertions, is described. This compression process can be initiated after each deletion that leaves a node less than half full, and several compression processes may run concurrently. Each compression process has to lock simultaneously three nodes.

AB - Algorithms for concurrent searches and insertions on B-trees are presented. These algorithms improve those given in [LY], since an updater has to lock only one node simultaneously (as opposed to two or three in [LY]). In addition, an algorithm for compressing the tree, which runs concurrently with searches and insertions, is described. This compression process can be initiated after each deletion that leaves a node less than half full, and several compression processes may run concurrently. Each compression process has to lock simultaneously three nodes.

UR - https://www.scopus.com/pages/publications/105020010883

U2 - 10.1145/325405.325409

DO - 10.1145/325405.325409

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:105020010883

T3 - Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

SP - 28

EP - 37

BT - PODS 1985

PB - Association for Computing Machinery

T2 - 4th ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, PODS 1985

Y2 - 25 March 1985 through 27 March 1985

ER -

Concurrent Operations on B-Trees with Overtaking

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this