US 6,279,007 B1 · Architecture for managing query friendly hierarchical values

Abstract

An architecture for managing query friendly hierarchical values contains a data structure having node value entries for node values that make up the hierarchical values, hierarchical value entries for the hierarchical values expressed in terms of node value identifiers found in the node value entries, and hierarchy parent entries for parent-child pairs of hierarchy values. A node value entry contains a node value, a node hash value generated from the node value by a first hashing algorithm, and the node value identifier. The node hash value defines the node value entry in which the corresponding node value is stored. The hierarchical value entry contains a hierarchical value represented by the node value identifiers that correspond to the node values that make up the hierarchical value. The hierarchical value entry also contains a hierarchical value hash value derived from the node value identifier representation of the hierarchical value using a second hashing algorithm and a hierarchical value identifier. The hierarchical value hash defines the hierarchical value entry in which the corresponding hierarchical value is stored. A hierarchy parent entry contains the hierarchical value identifier for the parent hierarchical value and the hierarchical value identifier for the child hierarchical value. The hierarchy parent entry also contains a depth value representing the distance in nodes between the parent hierarchical value and the node in the child hierarchical value that is furthest from the parent.

Claims21

Dependent claims

A computer-readable medium having stored thereon a data structure for managing hierarchical values having multiple nodes, the data structure comprising:

a plurality of node value entries, each node value entry comprising
a node value data field containing data representing a unique node value,
a node hash value data field functioning to identify the node value entry and derived from the node value data field using a first hashing algorithm, and
a node value identifier data field functioning to identify the node value in the node value data field;
and
a plurality of hierarchy value entries, each hierarchy value entry comprising
a hierarchical value data field derived from each node value identifier that identifies the node value entry corresponding to each node value in a unique hierarchical value,
a hierarchical value hash value data field functioning to identify the hierarchy value entry and derived from the hierarchical value data field using a second hashing algorithm, and
a hierarchical value identifier data field functioning to identify the hierarchical value in the hierarchical value data field.

6 more elements

A computer-readable medium having computer-executable instructions to cause a computer to perform acts comprising:

locating an entry in a node value data structure to store a unique node value by processing the node value through a first hashing algorithm;
storing the node value, a node hash value generated by the first hashing algorithm, and a unique node identifier in the entry located by the first hashing algorithm;
locating an entry in a hierarchy value data structure to store a unique hierarchical value by converting the hierarchical value from a first format to the node identifiers corresponding to the node values of the hierarchical value and processing the node identifiers through a second hashing algorithm;
and
storing the node identifiers corresponding to the node value of the hierarchical value, a hierarchical value hash value generated by the second hashing algorithm, and a unique hierarchical value identifier in the entry located by the second hashing algorithm.

2 more elements

Dependencies are inferred from the claim text.

Architecture for managing query friendly hierarchical values

Life of this patent

Architecture for managing query friendly hierarchical values

Life of this patent

Abstract

Claims21