Code. Automation. Software Solution
It impose partial ordering on the set D ={d1, d2, d3, …, dn} of all data items. If di -> dj , then any transaction accessing both di and dj must access di before accessing dj it implies that the set D may now be viewed as directed acyclic graph.
Author (required)
Email (will not be published)(required)
Website
Save my name, email, and website in this browser for the next time I comment.
7 + =