설명
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 페이지
언어
영어
출판됨
Aug 24, 2018
출판사
Forgotten Books
판본
판본 2개
ISBN-10
1332263364
ISBN-13
9781332263363