Framework for the performance analysis of concurrent B-tree algorithms

Theodore Johnson, Dennis Shasha

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

Abstract

Many concurrent B-tree algorithms have been proposed, but they have not yet been satisfactorily analyzed. When transaction processing systems require high levels of concurrency, a restrictive serialization technique on the B-tree index can cause a bottleneck. In this paper, we present a framework for constructing analytical performance models of concurrent B-tree algorithms The models can predict the response time and maximum throughput. We analyze three algorithms: Naieve Lock-coupling, Optimistic Descent, and the Lehman-Yao algorithm. The analyses are validated by simulations of the algorithms on actual B-trees. Simple and instructive rules of thumb for predicting performance are also derived. We apply the analyses to determine the effect of database recovery on B-tree concurrency.

Original languageEnglish (US)
Title of host publicationProceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
Editors Anon
PublisherPubl by ACM
Pages273-287
Number of pages15
Edition2-4
StatePublished - Apr 1990
EventProceedings of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems - Nashville, TN, USA
Duration: Apr 2 1990Apr 4 1990

Other

OtherProceedings of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
CityNashville, TN, USA
Period4/2/904/4/90

Fingerprint

Trees (mathematics)
Throughput
Recovery
Processing

ASJC Scopus subject areas

  • Software

Cite this

Johnson, T., & Shasha, D. (1990). Framework for the performance analysis of concurrent B-tree algorithms. In Anon (Ed.), Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (2-4 ed., pp. 273-287). Publ by ACM.

Framework for the performance analysis of concurrent B-tree algorithms. / Johnson, Theodore; Shasha, Dennis.

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ed. / Anon. 2-4. ed. Publ by ACM, 1990. p. 273-287.

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

Johnson, T & Shasha, D 1990, Framework for the performance analysis of concurrent B-tree algorithms. in Anon (ed.), Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. 2-4 edn, Publ by ACM, pp. 273-287, Proceedings of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Nashville, TN, USA, 4/2/90.
Johnson T, Shasha D. Framework for the performance analysis of concurrent B-tree algorithms. In Anon, editor, Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. 2-4 ed. Publ by ACM. 1990. p. 273-287
Johnson, Theodore ; Shasha, Dennis. / Framework for the performance analysis of concurrent B-tree algorithms. Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. editor / Anon. 2-4. ed. Publ by ACM, 1990. pp. 273-287
@inproceedings{bcefa8150fe94f7487aacf0d42f0b64e,
title = "Framework for the performance analysis of concurrent B-tree algorithms",
abstract = "Many concurrent B-tree algorithms have been proposed, but they have not yet been satisfactorily analyzed. When transaction processing systems require high levels of concurrency, a restrictive serialization technique on the B-tree index can cause a bottleneck. In this paper, we present a framework for constructing analytical performance models of concurrent B-tree algorithms The models can predict the response time and maximum throughput. We analyze three algorithms: Naieve Lock-coupling, Optimistic Descent, and the Lehman-Yao algorithm. The analyses are validated by simulations of the algorithms on actual B-trees. Simple and instructive rules of thumb for predicting performance are also derived. We apply the analyses to determine the effect of database recovery on B-tree concurrency.",
author = "Theodore Johnson and Dennis Shasha",
year = "1990",
month = "4",
language = "English (US)",
pages = "273--287",
editor = "Anon",
booktitle = "Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems",
publisher = "Publ by ACM",
edition = "2-4",

}

TY - GEN

T1 - Framework for the performance analysis of concurrent B-tree algorithms

AU - Johnson, Theodore

AU - Shasha, Dennis

PY - 1990/4

Y1 - 1990/4

N2 - Many concurrent B-tree algorithms have been proposed, but they have not yet been satisfactorily analyzed. When transaction processing systems require high levels of concurrency, a restrictive serialization technique on the B-tree index can cause a bottleneck. In this paper, we present a framework for constructing analytical performance models of concurrent B-tree algorithms The models can predict the response time and maximum throughput. We analyze three algorithms: Naieve Lock-coupling, Optimistic Descent, and the Lehman-Yao algorithm. The analyses are validated by simulations of the algorithms on actual B-trees. Simple and instructive rules of thumb for predicting performance are also derived. We apply the analyses to determine the effect of database recovery on B-tree concurrency.

AB - Many concurrent B-tree algorithms have been proposed, but they have not yet been satisfactorily analyzed. When transaction processing systems require high levels of concurrency, a restrictive serialization technique on the B-tree index can cause a bottleneck. In this paper, we present a framework for constructing analytical performance models of concurrent B-tree algorithms The models can predict the response time and maximum throughput. We analyze three algorithms: Naieve Lock-coupling, Optimistic Descent, and the Lehman-Yao algorithm. The analyses are validated by simulations of the algorithms on actual B-trees. Simple and instructive rules of thumb for predicting performance are also derived. We apply the analyses to determine the effect of database recovery on B-tree concurrency.

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

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

M3 - Conference contribution

SP - 273

EP - 287

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

A2 - Anon, null

PB - Publ by ACM

ER -