The Hybrid Solution for Concurrent Operations on B-Trees
| dc.contributor.author | Ellis, Carla Schlatter | |
| dc.date.accessioned | 2023-06-20T18:38:59Z | |
| dc.date.available | 2023-06-20T18:38:59Z | |
| dc.date.issued | 1980-03 | |
| dc.description | 24 pages | en_US |
| dc.description.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. | en_US |
| dc.identifier.uri | https://hdl.handle.net/1794/28427 | |
| dc.language.iso | en | en_US |
| dc.publisher | University of Oregon | en_US |
| dc.rights | Creative Commons BY-NC-ND 4.0-US | en_US |
| dc.subject | data structures | en_US |
| dc.subject | large ordered indexes | en_US |
| dc.subject | degree k | en_US |
| dc.title | The Hybrid Solution for Concurrent Operations on B-Trees | en_US |
| dc.type | Article | en_US |