The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (1982 vol.31)
pp: 825-834
F.J. Burkowski , Department of Computer Science, University of Waterloo
ABSTRACT
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.
INDEX TERMS
text scanning, Document retrieval, hardware hashing, term detection, text retrieval systems
CITATION
F.J. Burkowski, "A Hardware Hashing Scheme in the Design of a Multiterm String Comparator", IEEE Transactions on Computers, vol.31, no. 9, pp. 825-834, September 1982, doi:10.1109/TC.1982.1676098
33 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool