Hierarchical Timestamping Algorithm (Classic Reprint) - Tapa blanda

Hsu, Meichun

 
9781332263363: Hierarchical Timestamping Algorithm (Classic Reprint)

Sinopsis

Understand how to manage data access with precision and speed in distributed databases. This work explains a novel approach called the Hierarchical Timestamping Algorithm, which uses a hierarchy of data partitions to coordinate transactions without slowing down everyone.

This book introduces a partitioned view of data that helps transactions run more concurrently. It blends ideas from timestamping and locking, showing how a transaction might use different timestamps depending on which data partition it touches. It also compares this method with traditional locking protocols and other timestamping schemes, highlighting tradeoffs in performance and complexity.




  • How data is decomposed into partitions and organized into a hierarchy for better concurrency control.

  • Rules for classifying transactions based on the partitions they access and how those decisions affect execution order.

  • Three protocols that govern reads, writes, and conflicts, and when each is used to optimize throughput.

  • The theoretical basis for correctness, including how serializability is maintained in a hierarchical setup.



Ideal for readers of database theory and practitioners seeking deeper insight into advanced concurrency control techniques.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

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.

Reseña del editor

Excerpt from Hierarchical Timestamping Algorithm

The Hierarchical Timestamping Algorithm is proposed for handling database concurrency control. By analyzing transaction conflicts and partitioning the database into hierarchical partitions to which transactions will access discriminantly using different synchronization protocols, the algorithm can offer significant performance gain It also reduces the need for transactions to leave traces (e.g., locks, timestamps) when accessing a data element.

It is shown that the algorithm is correct in terms of transaction serializability. This is done by showing that the algorithm enforces a topological order among transactions. This research advocates the potential benefit of application analysis in enhancing performance of concurrency control algorithms where the level of concurrency is vital to system performance.

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Otras ediciones populares con el mismo título