Order Total (1 Item Items):
Shipping Destination:
Symmetric Concurrent B Tree Algorithm by Lanin Vladimir (12 results)
Feedback
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (12)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (12)
- As New, Fine or Near Fine (No further results match this refinement)
- Very Good or Good (No further results match this refinement)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (3)
- Not Print on Demand (5)
Language (1)
Free Shipping
Seller Location
Seller Rating
-
Condition: New. SUPER FAST SHIPPING.
-
A Symmetric Concurrent B-tree Algorithm
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 17.34
Convert currencyUS$ 16.18 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
A Symmetric Concurrent B-tree Algorithm
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 31.95
Convert currencyUS$ 16.18 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
US$ 17.25
Convert currencyFree shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketPaperback. 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.
-
PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
-
A Symmetric Concurrent B-tree Algorithm
Published by Creative Media Partners, LLC Jul 2023, 2023
ISBN 10: 1021187267 ISBN 13: 9781021187260
Language: English
US$ 31.13
Convert currencyUS$ 70.50 shipping from Germany to U.S.A.Quantity: 2 available
Add to basketTaschenbuch. Condition: Neu. Neuware.
-
A Symmetric Concurrent B-tree Algorithm
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
US$ 20.36
Convert currencyUS$ 4.44 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketPAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
-
A Symmetric Concurrent B-tree Algorithm
Published by Creative Media Partners, LLC Jul 2023, 2023
ISBN 10: 1019399643 ISBN 13: 9781019399644
Language: English
US$ 51.35
Convert currencyUS$ 71.48 shipping from Germany to U.S.A.Quantity: 2 available
Add to basketBuch. Condition: 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.
-
A Symmetric Concurrent B-tree Algorithm
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
US$ 21.15
Convert currencyUS$ 9.91 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketPaperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 59.
-
HRD. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
-
A Symmetric Concurrent B-tree Algorithm
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
US$ 35.62
Convert currencyUS$ 4.44 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketHRD. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
-
A Symmetric Concurrent B-tree Algorithm
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
US$ 39.00
Convert currencyUS$ 12.18 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketHardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 227.
