Implementing a relational database by means of specialzed hardware
ACM Transactions on Database Systems (TODS)
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
Rotating memory processors for the matching of complex textual patterns
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
The architecture of CASSM: A cellular system for non-numeric processing
ISCA '73 Proceedings of the 1st 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
Graph Theory With Applications
Graph Theory With Applications
Computer
An associative parallel processor with application to picture processing
AFIPS '65 (Fall, part I) Proceedings of the November 30--December 1, 1965, fall joint computer conference, part I
RAP: an associative processor for data base management
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
| Hi-index | 14.98 |
This paper discusses the hardware design of a term detection unit which may be used in the scanning of text emanating from a serial source such as disk or bubble memory. The main objective of this design is the implementation of a high performance unit which can detect any one of many terms (e.g., 1024 terms) while accepting source text at disk transfer rates. The unit incorporates "off-the-shelf" currently available chips. The design involves a hardware-based hashing scheme that allows incoming text to be compared to selected terms in a RAM which contains all of the strings to be detected. The organization of data in the RAM of the term detector is dependent on a graph-theoretic algorithm which computes maximal matchings on bipartite graphs. The capability of the unit depends on various parameters in the design, and this dependence is demonstrated by means of various tables that report on the results of various simulation studies.