Array Generation Method And Array Generation Program
1 Assignment
0 Petitions
Accused Products
Abstract
A tree-type data structure representation method that can effectively trace relationships among data in a tree-type data structure, such as parent-child, ancestors, descendents, siblings, and generations, is provided. In a memory, data having a tree-type data structure in which unique node identifiers are assigned to nodes and a parent-child relationship between the nodes is represented by a C-P array including pairs, each pair being formed of a node identifier assigned to each of non-root nodes, which are nodes other than a root node, and a node identifier of a parent node with which each of the non-root nodes is associated is stored. In the memory, a vertex node list storing, in order to represent at least one node group, each including a specific node and a descendent node of the specific node, node identifiers of the specific nodes, which serve as vertex nodes, is also stored. A system 10 moves each of the vertex nodes to a child node, a parent node, or a node in the same generation as the vertex node (an older sibling node or a younger sibling node) by referring to the C-P array, and generates a new vertex node list.
20 Citations
38 Claims
-
1-18. -18. (canceled)
-
19. An array generation method, in a computer including data having a tree-type data structure in which unique node identifiers are assigned to nodes and a parent-child relationship between the nodes is represented by a first array including a node identifier of a parent node with which each of non-root nodes, which are nodes other than a root node, is associated, the array generation method comprising:
-
a step of providing a second array, in order to represent at least one node group, each including a specific node and a descendent node of the specific node, the second array storing a node identifier of at least one specific node, which serves as a vertex node; and a step of generating, by referring to the first array, a third array storing a node identifier of a new vertex node, which is a moved version of each of the vertex nodes whose node identifiers are stored in the second array after moving the vertex node to a node having a certain relationship with the vertex node. - View Dependent Claims (20, 21, 22, 23, 24, 25, 26, 27, 28)
-
-
29. An array generation program readable by a computer which includes data having a tree-type data structure, in which unique node identifiers are assigned to nodes and a parent-child relationship between the nodes is represented by a first array including a node identifier of a parent node with which each of non-root nodes, which are nodes other than a root node, is associated, the array generation program allowing the computer to execute:
-
a step of providing a second array, in order to represent at least one node group, each including a specific node and a descendent node of the specific node, the second array storing a node identifier of at least one specific node, which serves as a vertex node; and a step of generating, by referring to the first array, a third array storing a node identifier of a new vertex node, which is a moved version of each of the vertex nodes whose node identifiers are stored in the second array after moving the vertex node to a node having a certain relationship with the vertex node. - View Dependent Claims (30, 31, 32, 33, 34, 35, 36, 37, 38)
-
Specification