Items related to A Symmetric Concurrent B-Tree Algorithm (Classic Reprint)
Synopsis
Excerpt from A Symmetric Concurrent B-Tree Algorithm
Etree usually runs in three stages: a descent through the tree to a leaf node, an Operation on the leaf node that either checks for the existence of a key, adds a key, or removes a key (for search, insert, and delete, respectively), and an optional ascent during which the tree is restructured in order to rebalance it. It is also possible to restructure the tree during the descent, as described in [guse78]. Restructuring is done by splitting a single node into two neighboring ones and by merging neighboring nodes into one. The execution of an entire action takes time logarithmic in the number of keys stored in the structure.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"synopsis" may belong to another edition of this title.
- PublisherForgotten Books
- Publication date2024
- ISBN 10 1333461143
- ISBN 13 9781333461140
- BindingPaperback
- LanguageEnglish
- Number of pages37
Buy New
View this item
US$ 17.25
Shipping:
FREE
From United Kingdom to U.S.A.
Other Popular Editions of the Same Title
Search results for A Symmetric Concurrent B-Tree Algorithm (Classic Reprint)
Seller Image
A Symmetric Concurrent B-Tree Algorithm (Classic Reprint)
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Print on Demand. This book presents a highly efficient, mostly deadlock-free method for multiple users to concurrently search, insert, and delete data from a B-tree database structure. While some concurrent methods for manipulating B-trees already existed, such as the Lehman-Yao algorithm, they suffered severe drawbacks. The approach presented here, based on an elegant mathematical proof method, allows nearly all locking to be localized to a single level of the B-tree. Additionally, the method introduces a novel way of merging nodes, which also helps avoid the tree becoming imbalanced after many deletions. The result is a significant improvement in concurrency, allowing multiple users to access and manipulate the database much more quickly and efficiently than with previous methods. This book is a valuable resource for database system designers, researchers, and students seeking efficient and reliable concurrent database access techniques. Its approach has practical significance for the design of highly scalable database systems. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Seller Inventory # 9781333461140_0
Quantity: Over 20 available
Stock Image
A Symmetric Concurrent BTree Algorithm Classic Reprint
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9781333461140
Quantity: 15 available
Stock Image
A Symmetric Concurrent BTree Algorithm Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9781333461140
Quantity: 15 available