Database filters
Several hardware database-searchers for a large number of patterns or keys are presented. These searchers can be implemented by a random access memory and are suitable for VLSI implementation. Application of these searchers as database filters is described; a filter detects all the matched records in the database, as well as a few others. The percentage of unmatched records can be reduced to any arbitrary minimum value by using several filters together, or passing the output records repeatedly through the same filters. The performance of the filters using the iterative approach depends very much on the regrouping algorithms of the patterns/keys. Several such algorithms are presented and their performances compared. A single pass is required if they are pipelined. Hardware organisation for different pipelined approaches are also studied. Experiments are performed for all the different hardware organisations mentioned above on an employee-name database. 25 references.
- OSTI ID:
- 6231987
- Resource Relation:
- Conference: Sponsored by IEEE, Austin, TX, USA, 26 Apr 1982
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel computer architectures for relational databases
Multiprocessor implementation of two-dimensional digital filters for real time processing