Database construction apparatus and method
AssigneeCanon Kabushiki Kaisha
InventorsHideo Kuboyama, Masayuki Yamada
Life of this patent
Estimating the term…
Abstract
A database construction apparatus and method which construct a tree structure database are provided. First of all, consecutive node numbers are assigned to nodes for each layer, from an upper layer to a lower layer in a tree structure, in the order of the node numbers of parent nodes. Thereafter, the respective nodes are assigned child node relative numbers representing relative values between the node numbers and the node numbers of corresponding child nodes.
Claims8
A database construction apparatus which constructs a tree structure database, comprising:
- node number assigning means for assigning consecutive node numbers to nodes for each layer, from an upper layer to a lower layer in a tree structure, in the order of node numbers of parent nodes;
- and
- child node relative number assigning means for assigning the respective nodes child node relative numbers representing relative values between the node numbers and the node numbers of corresponding child nodes.
A database construction method for construction of a tree structure database, comprising the steps of:
- assigning consecutive node numbers to nodes for each layer, from an upper layer to a lower layer in a tree structure, in the order of node numbers of parent nodes;
- and
- assigning the respective nodes child node relative numbers representing relative values between the node numbers and the node numbers of corresponding child nodes.
A computer-executable program for constructing a tree structure database, comprising the code for the steps of:
- generating consecutive node numbers for nodes for each layer, from an upper layer to a lower layer in a tree structure, in the order of node numbers of parent nodes, and storing the node numbers in a memory;
- and
- generating, for the respective nodes, child node relative numbers representing relative values between the node numbers and the node numbers of corresponding child nodes, and storing the child node relative numbers in the memory.
Dependencies are inferred from the claim text.