| 摘要 |
<p>A simple high-speed scheme which is a variously applied search scheme for searching a bit sequence from a set of bit sequences to be searched by using a coupled node tree. The coupled node tree is composed of a pair of nodes which are a root node and a branch node disposed in an adjacent storage area or which are branch nodes or leaf nodes. Each branch node contains information representing discrimination bit position of a search key and the position of one of the linked paired nodes. Each leaf node has a coupled node tree including an index key composed of a bit sequence to be searched. The coupled node tree is stored in a sequence, and position information is the sequence number of a sequence element where the node corresponding to the position information is stored. By using an arbitrary node of the coupled node tree as a search start node, only the one of the paired nodes having the smaller sequence number is linked to reach the leaf node. Thus, the minimum value of the index key of an arbitrary partial tree where the search start node is used as the root node is determined.</p> |
