EUR 27,36
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Publicado por Creative Media Partners, LLC Jul 2023, 2023
ISBN 10: 1021187267 ISBN 13: 9781021187260
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 25,85
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Neuware.
Publicado por Creative Media Partners, LLC Jul 2023, 2023
ISBN 10: 1019399643 ISBN 13: 9781019399644
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 42,64
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: Neu. Neuware - Shasha and Lanin's groundbreaking research on concurrent B-tree algorithms remains the gold standard in the field. This book presents their revolutionary approach in a clear and accessible manner, making it an essential reference for computer scientists and software engineers.
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
EUR 18,27
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
EUR 17,44
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoPAP. Condición: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
EUR 17,96
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback / softback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 59.
Librería: Forgotten Books, London, Reino Unido
EUR 15,30
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback. Condición: 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.
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
EUR 32,30
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoHRD. Condición: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
EUR 30,51
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoHRD. Condición: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
EUR 33,28
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoHardback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 227.