The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
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
ACM Computing Surveys (CSUR) - Annals of discrete mathematics, 24
Survey on special purpose computer architectures for AI
ACM SIGART Bulletin
ACM SIGARCH Computer Architecture News - Special Issue: Architectural Support for Operating Systems
Partitioned signature files: design issues and performance evaluation
ACM Transactions on Information Systems (TOIS)
Performance and Architectural Issues for String Matching
IEEE Transactions on Computers
HYTREM-A Hybrid Text-Retrieval Machine for Large Databases
IEEE Transactions on Computers
Dynamic partitioning of signature files
ACM Transactions on Information Systems (TOIS)
Frame-sliced partitioned parallel signature files
SIGIR '92 Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval
Declustering of key-based partitioned signature files
ACM Transactions on Database Systems (TODS)
Multiprocessor hardware: An architectural overview
ACM '80 Proceedings of the ACM 1980 annual conference
A preliminary survey of artificial intelligence machines
ACM SIGART Bulletin
| Hi-index | 0.01 |
This paper presents the design and implementation of special hardware for effective use of the method of superimposed codes. It is shown that the method of superimposed codes is particularly well suited to easy design and implementation of fast and modular hardware. The implementation has shown that a performance gain of two orders of magnitude over conventional software implementations is obtained by using the special hardware. This makes the method of superimposed codes extremely attractive for data base system requiring partial match retrieval. We also demonstrate that the associative memory design is easily adaptable to large scale integration which would make such an approach very cost effective and lead to even further gains in performance.