Excerpt from Hierarchical Timestamping Algorithm
Analysis of a set of update transactions T. Against a database consisting of a set of data partitions results in a data partition graph, where the nodes are the data partitions, and the arcs are assigned in such a way that there is an arc from a data partition D, to another data partition DJ if and only if one can hnd a potential transaction in the database system that updates data elements in D.' and accesses reads or writes) data elements in Di. That is, Di - edj, 1°;éj.
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.
EUR 9,90 per la spedizione da Germania a Italia
Destinazione, tempi e costiEUR 1,91 per la spedizione da U.S.A. a Italia
Destinazione, tempi e costiDa: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781332263363
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-9781332263363
Quantità: 15 disponibili
Da: Buchpark, Trebbin, Germania
Condizione: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher. Codice articolo 26070966/2
Quantità: 1 disponibili
Da: Forgotten Books, London, Regno Unito
Paperback. Condizione: New. Print on Demand. This book offers an algorithm called Hierarchical Timestamping for database concurrency control. Concurrency control is a fundamental computer science challenge involving balancing the need for secure data management with efficient data processing. The author places the algorithm within the historical evolution of concurrency control, emphasizing the limitations of established approaches. The author positions the Hierarchical Timestamping algorithm as an improvement over the conventional multi-version timestamping algorithm, particularly when a database can be structured hierarchically. The book delves into the details of how the algorithm operates, including mathematical proofs for its effectiveness and applications in real-world scenarios. The book concludes by highlighting how the Hierarchical Timestamping algorithm can enhance the performance of database systems, particularly in situations where data access patterns exhibit hierarchical characteristics. 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 9781332263363_0
Quantità: Più di 20 disponibili