The design and operation of a new class of hardware-based pattern matchers, such as would be used in a backended database processor in a full-text or other retrieval system, is presented. This recognizer is based on a unique implementation technique for finite state automata consisting of partitioning the state table among a number of simple digital machines. It avoids the problems generally associated with implementing finite state machines, such as large state table memories, complex control mechanisms, and state encodings. Because it consists primarily of memory, with its high regularity and density, needs only limited static interconnections, and operates at a relatively low speed, it can be easily constructed using integrated circuit techniques.
After a brief discussion of other pattern-matching hardware, the structure and operation of the partitioned finite state automaton is given, along with a simplified discussion of how the state tables are partitioned. The expected performance of the resulting system and the state table partitioning programs is then discussed.
[1]
George P. Copeland,et al.
String storage and searching for data base applications: Implementation on the INDY backend kernel
,
1978
.
[2]
Amar Mukhopadhyay.
Hardware algorithms for nonnumeric computation
,
1978,
ISCA '78.
[3]
George P. Copeland,et al.
String storage and searching for data base applications: Implementation on the INDY backend kernel
,
1978,
CAW '78.
[4]
Jeffrey D. Ullman,et al.
Introduction to Automata Theory, Languages and Computation
,
1979
.
[5]
Roger L. Haskin.
Hardware for searching very large text databases
,
1980,
CAW '80.
[6]
Lee A. Hollaar,et al.
Text Retrieval Computers
,
1979,
Computer.
[7]
David C. Roberts.
A Specialized Computer Architecture for Text Retrieval
,
1978,
Computer Architecture for Non-Numeric Processing.
[8]
E. F. CODD,et al.
A relational model of data for large shared data banks
,
1970,
CACM.
[9]
H. T. Kung,et al.
The Design of Special-Purpose VLSI Chips
,
1980,
Computer.