The Hybrid Solution for Concurrent Operations on B-Trees
Loading...
Date
1980-03
Authors
Ellis, Carla Schlatter
Journal Title
Journal ISSN
Volume Title
Publisher
University of Oregon
Abstract
B-trees are useful for supporting large ordered indexes in database systems. Several solutions have recently been proposed to deal with the problem of allowing concurrent operations in data structures related to B-trees. In this paper, the strengths and weaknesses of two of these solutions are described. A combined approach is presented that can be tuned to satisfy specific performance requirements. Informal arguments for the correctness of this new solution are given.
Description
24 pages
Keywords
data structures, large ordered indexes, degree k