Michael J. Carey, Donald Kossmann
SIGMOD Record (ACM Special Interest Group on Management of Data)
A number of algorithms have been proposed to access B+-trees concurrently, but they are not well understood. In this article, we study the performance of various B+-tree concurrency control algorithms using a detailed simulation model of B+-tree operations in a centralized DBMS. Our study covers a wide range of data contention situations and resource conditions. In addition, based on the performance of the set of B+-tree concurrency control algorithms, which includes one new algorithm, we make projections regarding the performance of other algorithms in the literature. Our results indicate that algorithms with updaters that lock-couple using exclusive locks perform poorly as compared to those that permit more optimistic index descents. In particular, the B-link algorithms are seen to provide the most concurrency and the best overall performance. Finally, we demonstrate the need for a highly concurrent long-term lock holding strategy to obtain the full benefits of a highly concurrent algorithm for index operations. © 1993 VLDB.
Michael J. Carey, Donald Kossmann
SIGMOD Record (ACM Special Interest Group on Management of Data)
Michael J. Carey
SIGMOD 2000
Jerry Kiernan, Michael J. Carey
SIGPLAN Notices (ACM Special Interest Group on Programming Languages)
Paul M. Bober, Michael J. Carey
IEEE Transactions on Knowledge and Data Engineering