| 摘要 |
PROBLEM TO BE SOLVED: To perform a high speed collation with a realistic storage capacity by using multiple symbol strings as a collation key. SOLUTION: A sparse state transition table is prepared by reducing data indicating a shifting operation for returning a collating position in a file to the direction opposite to the collating direction from a state transition table of a finite state machine in which an collating operation of the key is defined and the state transition table is stored in a compressed array form. When the symbol strings in the 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 the shifting operation. COPYRIGHT: (C)2004,JPO
|
