Department of Computer and Information Science

Permanent URI for this community

https://hdl.handle.net/1794/122

For information about the department, please see the department's web site.

Browse

Browsing Department of Computer and Information Science by Subject "degree k"

Now showing 1 - 1 of 1
  • Thumbnail Image
    ItemOpen Access
    The Hybrid Solution for Concurrent Operations on B-Trees
    (University of Oregon, 1980-03) Ellis, Carla Schlatter
    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.