The design of a rotating associative memory for relational database applications
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
Asynchronous Sequential Switching Circuit
Asynchronous Sequential Switching Circuit
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
Text file inversion: An evaluation
CAW '78 Proceedings of the fourth workshop on Computer architecture for non-numeric processing
Structure memory designs for a database computer
ACM '77 Proceedings of the 1977 annual conference
Associative/parallel processors for searching very large textual data bases
CAW '77 Proceedings of the 3rd workshop on Computer architecture : Non-numeric processing
A specialized computer for information retrieval.
A specialized computer for information retrieval.
An analysis of rotational storage access scheduling in a multiprogrammed information retrieval system.
Algorithms for string searching
ACM SIGIR Forum
Operational characteristics of a harware-based pattern matcher
ACM Transactions on Database Systems (TODS)
VLSI architectures for high speed recognition of context-free languages and finite-state languages
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
A Hardware Hashing Scheme in the Design of a Multiterm String Comparator
IEEE Transactions on Computers
Exploiting parallelism for the performance enhancement of non-numeric applications
AFIPS '82 Proceedings of the June 7-10, 1982, national computer conference
| Hi-index | 0.00 |
This paper discusses the problem of searching very large text databases. It is shown that conventional techniques for searching current databases cannot be scaled up to larger ones, and that it is necessary to build hardware to search the database in parallel if reasonable search times are expected. The part of the search process requiring the highest bandwidth is scanning the database to detect instances of search terms. Methods of doing this in hardware that have been mentioned in the literature are examined, and design criteria for term matchers are discussed. A new design that uses a nondeterministic finite state automaton to control matching, is introduced, its operation is explained, and the practicality of using it in a real system is discussed.