| 摘要 |
<p>To provide a method that lessens the reduction in efficiency of processing using a coupled node tree even if the scale of the coupled node tree grows large. To store a termination node, whose discrimination bit position has a value smaller than 0, in a search path stack (310) that holds the search history while successively storing therein branch nodes (210a, 210b, 211c) that have been traversed in the search path. At that time, the coupled node indicator is converted to a value wherein a 1 is added if the link target is node [1].</p> |
