Articoli correlati a A Symmetric Concurrent B-Tree Algorithm (Classic Reprint)
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 18,94
EUR 1,93 per la spedizione da U.S.A. a Italia
Destinazione, tempi e costiAltre edizioni note dello stesso titolo
Risultati della ricerca per A Symmetric Concurrent B-Tree Algorithm (Classic Reprint)
Foto dell'editore
A Symmetric Concurrent BTree Algorithm Classic Reprint
Da: PBShop.store US, Wood Dale, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781333461140
Quantità: 15 disponibili
Foto dell'editore
A Symmetric Concurrent BTree Algorithm Classic Reprint
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781333461140
Quantità: 15 disponibili
Immagini fornite dal venditore
A Symmetric Concurrent B-Tree Algorithm (Classic Reprint)
Print on DemandDa: Forgotten Books, London, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. Codice articolo 9781333461140_0
Quantità: Più di 20 disponibili