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.
"synopsis" may belong to another edition of this title.
About the Editor:
Stuart E. Madnick is Associate Professor of Management Science at the Sloan School of Management, M.I.T., and the principal investigator of a major research effort, funded by DOD and Citibank, to identify the key strategic, organizational, and technology issues in large-scale information systems.
"About this title" may belong to another edition of this title.
Shipping:
US$ 50.22
From Germany to U.S.A.
Shipping:
FREE
From United Kingdom to U.S.A.
Seller: Forgotten Books, London, United Kingdom
Paperback. Condition: 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. Forgotten Books publishes hundreds of thousands of rare and classic books. 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. The digital edition of all books may be viewed on our website before purchase. print-on-demand item. Seller Inventory # 9781332263363_0
Quantity: Over 20 available
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9781332263363
Quantity: 15 available
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9781332263363
Quantity: 15 available
Seller: Buchpark, Trebbin, Germany
Condition: Sehr gut. Zustand: Sehr gut - Gepflegter, sauberer Zustand. | Seiten: 36 | Sprache: Englisch | Produktart: Bücher. Seller Inventory # 26070966/2
Quantity: 1 available