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
Data Structures for Range Searching
ACM Computing Surveys (CSUR)
Design of a backend processor for a data base machine
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
A machine for information retrieval
CAW '78 Proceedings of the fourth workshop on Computer architecture for non-numeric processing
Performance Analysis of a Database Filter Search Hardware
IEEE Transactions on Computers
Survey on special purpose computer architectures for AI
ACM SIGART Bulletin
A parallel multiprocessor machine dedicated to relational and deductive data bases
SIGIR '88 Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval
Flexible selection among objects: a framework based on fuzzy sets
SIGIR '88 Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval
VLSI Accelerators for Large Database Systems
IEEE Micro
An Efficient Algorithm for Matching Multiple Patterns
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
This paper describes the basic principles, the architecture and the applications of a processor called the SCHUSS filter*. The SCHUSS filter can be seen as a device with two inputs and one output; the first input is the filtering criterion (a program); the second input is the data to be filtered (in a sequential way). The output is the data which fulfills the filter criterion. Under the architectural point of view the SCHUSS filter can be seen as a specialized processor (in filtering) but also as a general purpose processor. Working as a specialized processor, it can process “on the fly” data coming from a disk where “on the fly” means at the normal disk transfer rate. Even if now disk transfers rates are up to 3 Mbyte/sec SCHUSS can execute searches of reasonable complexity in one pass. The idea is to off-load the host processor of search tasks and other kinds of processing.