What do you think?
Rate this book
Hierarchical Timestamping Algorithm
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.
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.
34 pages, Paperback
First published August 5, 2015
Ratings & Reviews
Friends & Following
Create a free account to discover what your friends think of this book!
Community Reviews
No one has reviewed this book yet.