| http://www.w3.org/ns/prov#value | - A B-tree is a balanced tree; it stores data in its leaf nodes and bookkeeping data in its interior nodes (If you do not know what tree data structures look like in general, Google for some references, because he is getting far too elementary for the purposes of this discussion).
|
