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.
(No Available Copies)
Search Books: Create a WantCan't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!
Create a Want
