| 摘要 |
<p>An index key is a key string formed of one or more keys (290c, 290c') whose tail-end key (290c') is unique, and a search key string for a bit string search has a unique key as its tail-end key. A branch node (112, 211c) includes a search key sequence number (115a, 241c) expressing the position information of a key in the search key string to be used in the bit string comparison during the bit string search and the discrimination bit position (115, 231c) for that key. Search for index keys is performed by extracting from the search key string the key with the search key sequence number in the branch node and repeatedly linking to one of the nodes of a node pair of the link target in response to the bit value at the discrimination bit position of that key until the leaf node corresponding to that index key is reached.</p> |
