A relational model of data for large shared data banks
Communications of the ACM
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Hardware for searching very large text databases
CAW '80 Proceedings of the fifth workshop on Computer architecture for non-numeric processing
Hardware algorithms for nonnumeric computation
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
String storage and searching for data base applications: Implementation on the INDY backend kernel
CAW '78 Proceedings of the fourth workshop on Computer architecture for non-numeric processing
A specialized computer architecture for text retrieval
CAW '78 Proceedings of the fourth workshop on Computer architecture for non-numeric processing
Hardware for searching very large text databases
Hardware for searching very large text databases
ACM Computing Surveys (CSUR) - Annals of discrete mathematics, 24
A problem-oriented inferential database system
ACM Transactions on Database Systems (TODS)
An object-oriented approach to multimedia databases
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
A parallel VLSI architecture for unformatted data processing
DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
An optical system for full text search
SIGIR '89 Proceedings of the 12th annual international ACM SIGIR conference on Research and development in information retrieval
Performance and Architectural Issues for String Matching
IEEE Transactions on Computers
Exploiting parallelism in pattern matching: an information retrieval application
ACM Transactions on Information Systems (TOIS)
A testbed for information retrieval research: the Utah retrieval system architecture
SIGIR '85 Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval
A parallel execution model for a database machine with high performances
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
A distributed information handling system
ACM '85 Proceedings of the 1985 ACM annual conference on The range of computing : mid-80's perspective: mid-80's perspective
The design of a hardware recognizer for utilization in scanning operations
CSC '85 Proceedings of the 1985 ACM thirteenth annual conference on Computer Science
Hardware systems for text information retrieval
SIGIR '83 Proceedings of the 6th annual international ACM SIGIR conference on Research and development in information retrieval
VLSI Accelerators for Large Database Systems
IEEE Micro
The Impact of Optics on Data and Knowledge Base Systems
IEEE Transactions on Knowledge and Data Engineering
The Utah Text Retrieval Project: a status report
SIGIR '84 Proceedings of the 7th annual international ACM SIGIR conference on Research and development in information retrieval
An Efficient Algorithm for Matching Multiple Patterns
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
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.