Semantically consistent schedules for efficient and concurrent B-tree restructuring

Author

Ishak, Ragaa

Author_Institution

Hewlett Packard Co., Cupertino, CA, USA

fYear

1992

fDate

2-3 Feb 1992

Firstpage

184

Lastpage

191

Abstract

A concurrent B-tree algorithm can achieve more parallelism than a standard concurrency control method. The author presents a semantically based method for B-tree restructuring which allows efficient and concurrent traversals and fetches. The concurrent operations compare favorably with earlier solutions because they avoid wasted input/output (I/O). In addition, the concurrent B-tree algorithms considerably reduce the need to repeatedly traverse the tree in order to recover from the effect of in-progress restructuring. The method increases the performance of a high-volume database management system

Keywords

concurrency control; data structures; database management systems; database theory; parallel algorithms; trees (mathematics); concurrent B-tree algorithm; concurrent B-tree restructuring; concurrent fetches; concurrent traversals; database management system; in-progress restructuring; parallelism; semantically consistent schedules; Concurrency control; Concurrent computing; Costs; Database systems; Legged locomotion; Paper technology; Protocols; System testing; Transaction databases;

fLanguage

English

Publisher

ieee

Conference_Titel

Data Engineering, 1992. Proceedings. Eighth International Conference on

Conference_Location

Tempe, AZ

Print_ISBN

0-8186-2545-7

Type

conf

DOI

10.1109/ICDE.1992.213193

Filename

213193