| 摘要 |
<P>PROBLEM TO BE SOLVED: To perform high speed collation with realistic storage capacity by using a plurality of symbol strings as a collation key. <P>SOLUTION: A sparse state transition table is created by eliminating data indicating a transition operation from the current state to the initial state from a state transition table at a finite state machine in which a collating operation of the key is defined and the state transition table is stored in a compressed array form. When the symbol strings in a file are collated with the key, when an operation to an inputted symbol is not stored in the state transition table, collation is continued by performing a transiting operation to the initial state. <P>COPYRIGHT: (C)2004,JPO |
