ACM Computing Surveys (CSUR) - Annals of discrete mathematics, 24
ACM Computing Surveys (CSUR)
Hardware for Searching Very Large Text Datahases
CAW '80 The Papers of the Fifth 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
Associative/parallel processors for searching very large textual data bases
CAW '77 Proceedings of the 3rd workshop on Computer architecture : Non-numeric processing
IEEE Transactions on Computers
Cascading Content-Addressable Memories
IEEE Micro
An Efficient Algorithm for Matching Multiple Patterns
IEEE Transactions on Knowledge and Data Engineering
Hi-index | 0.00 |
This paper presents a new architecture for practical string search hardware design. This architecture is based on the finite state automaton design concept using a character control charge transfer model. The resultant hardware is a set of programmable sequential logic (PSL) circuits, each of which consists of a sequential logic and memory parts. The logic part is an array of logical gates, each of which is controlled by the read-out signal from the memory part, to connect the flip-flops. The memory part stores each variable-length pattern string character on a bit line by bit line basis. Then, several pattern strings in the memory part can be compared with the serial input data string in parallel, even at a non-anchor mode and an approximate matching mode. This new hardware can be easily implemented in an LSI chip, which allows 8192 pattern string storage using 1 Mb RAM cells.