ISBN: 9781333461140 - a symmetric concurrent b-tree algorithm (classic reprint) (3 risultati)

Perfeziona la tua ricerca

  • Libri (3)

  • Nuovo (3)

a

Fascia di prezzo personalizzata (EUR)

a

  • Lingua: Inglese

    Editore: Forgotten Books, 2018

    1333461143 / 9781333461140

    • Brossura

    Da: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 25,74

     Spedizione gratuita 
    Spedito in U.S.A.

    Quantità: 15 disponibili

    PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

  • Lingua: Inglese

    Editore: Forgotten Books, 2018

    1333461143 / 9781333461140

    • Brossura

    Da: PBShop.store UK, Fairford, GLOS, Regno UnitoPBShop.store UK

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 24,86

    EUR 3,93 spedizione 
    Spedito da Regno Unito a U.S.A.

    Quantità: 15 disponibili

    PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

  • Altre immagini

    Lingua: Inglese

    Editore: Forgotten Books, London, 2018

    1333461143 / 9781333461140

    • Brossura
    • Print on Demand

    Da: Forgotten Books, London, Regno UnitoForgotten Books

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 16,20

     Spedizione gratuita 
    Spedito da Regno Unito a U.S.A.

    Quantità: Più di 20 disponibili

    Paperback. Condizione: New. No Jacket. Print on Demand. A clear, practical look at how concurrent B-tree algorithms work and how to balance correctness with performance. This book explains the ideas behind lock-coupling, subtree-locking, and the B-link structure, and shows how merges can keep a tree efficient during insertions and deletions.You'll find both the theory and the meat of the implementation. The text covers different approaches to concurrency, including locking strategies and optimistic descents, and it explains how a symmetric deletion method can use right links and outlinks to stay efficient as the structure changes. It also presents a concrete algorithm and discusses how to measure performance with simulations.- Learn the key concepts behind concurrent B-trees, including lock coupling and subtree locking.- See how the B-link structure enables safe, efficient updates and what merging and splitting look like in practice.- Understand how optimistic and pessimistic approaches trade off accuracy and throughput.- Explore a concrete algorithm with definitions, lemmas, and a formal view of correctness and serializability.- Review performance results from simulations that compare different strategies for handling concurrency.Ideal for readers of advanced data structures, concurrent algorithms, and systems that rely on scalable, lock-based trees. 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.…