×

Apparatus and method of multi-string matching based on sparse state transition list

  • US 5,995,963 A
  • Filed: 03/04/1997
  • Issued: 11/30/1999
  • Est. Priority Date: 06/27/1996
  • Status: Expired due to Term
First Claim
Patent Images

1. A collating apparatus, using a finite state machine for determining whether a key referring to a given symbol string exists in a file, said apparatus comprising:

  • state transition storage means for storing in a compressed array format a sparse state transition table containing definitions of collating operations for at least one key, wherein an amount of data indicating a predetermined operation is reduced in the sparse state transition table; and

    collating means for performing an operation corresponding to each symbol contained in the file while referring to the sparse state transition table, performing the predetermined operation when no operation is defined in the sparse state transition table, and collating a symbol string in the file with at least one key.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×