| http://www.w3.org/ns/prov#value | - FIG. 4 illustrates an exemplary hierarchical data structure 400 including nodes A-E. As illustrated in FIG. 4, Node A is a root node of the hierarchical data structure 400 and is classified as a ???Class 1??? node, wherein ???Class 1??? refers to a data classification type.Further, as illustrated in FIG. 4, node B and node C are sub-nodes of node A. Node D is a sub-node of node C and node E is a s
|
