| http://www.w3.org/ns/prov#value | - It can be shown that fewer cache accesses are made, as compared to particular conventional tree-based data index structures having certain types of nodes, when performing key lookups on a tree-based data index structure that is stored in main memory and has one or more nodes that contain a header including a selected key from each of a selected number of the partitions of one of the nodes.
|
