Longest-match/shortest-match search apparatus, search method, and program

摘要

A coupled node tree comprises a root node and a node pair, the node pair being a branch node and leaf node, or a pair of branch nodes, or a pair of leaf nodes located in adjacent storage areas. The branch node includes a discrimination bit position of the search key and a position information of a primary node, which is one node of a node pair of a link target. The leaf node includes an index key that is a bit string that is the target of a search. A coupled node tree is searched using a longest-match/shortest-match search key and the longest-match/shortest-match node is determined through a comparison of the difference bit position between the index key resulting from the search and the longest-match/shortest-match search key and the discrimination bit position of a branch node on the search path memorized when the search is performed.