Excerpt from Tree Locking on Changing Trees
We must now decide on a set Of Operations powerful enough to introduce arbitrary changes to the tree graph, yet restricted enough to ensure that the graph remain a tree in all intermediate states. B-tree splits and merges, for example, are clearly too restrictive in that they can only produce balanced trees and can not even change the height of any given node. Addition or removal of a single edge, on the other hand.
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
I tuoi diritti di garanzia legale: Ogni consumatore nell'UE beneficia di almeno 2 anni di garanzia legale per qualsiasi bene di consumo venduto nell'UE. Scopri di più
Da: Forgotten Books, London, Regno Unito
Paperback. Condizione: New. No Jacket. Print on Demand. Dynamic tree locking and correctness for changing trees Explore how new editing operations and locking rules keep tree structures safe while they change shape, ensuring serializability and deadlock freedom for concurrent computations.This book presents a clear framework for modifying tree graphs while preserving the tree property. It introduces operations that can restructure a tree, along with natural lock requirements that make these changes safe in parallel environments. The discussion connects these ideas to classic tree protocols and to practical implications for algorithms that manipulate trees in databases and filesystems. Definitions of tree editing operations like switch, add leaf, and remove leaf, and how locks control their execution How lock and unlock rules interact with operations to maintain correctness Proofs that dynamic tree computations are serializable and deadlock-free under appropriate conditions Conditions under which action order is preserved, including switch-restricted scenariosIdeal for readers of concurrent data structures, database theory, and advanced algorithmic methods for dynamic 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. Codice articolo 9781332206568_0
Quantità: Più di 20 disponibili
Da: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332206568
Quantità: 15 disponibili
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332206568
Quantità: 15 disponibili