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
A relational model of data for large shared data banks
Communications of the ACM
An associative processor for relational data bases--rap. (volumes 1 and 2)
An associative processor for relational data bases--rap. (volumes 1 and 2)
CASSM: a cellular system for very large data bases
VLDB '75 Proceedings of the 1st International Conference on Very Large Data Bases
An implementation of a data management system on an associative processor
AFIPS '73 Proceedings of the June 4-8, 1973, national computer conference and exposition
A data management system utilizing an associative memory
AFIPS '73 Proceedings of the June 4-8, 1973, national computer conference and exposition
RAP: an associative processor for data base management
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
Sorting with associative secondary storage devices
AFIPS '77 Proceedings of the June 13-16, 1977, national computer conference
Optimization of the file access method in content-addressable database access machine (CADAM)
AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference
Database machines and some issues on DBMS standards
AFIPS '80 Proceedings of the May 19-22, 1980, national computer conference
A reconfigurable VLSI architecture for a database processor
AFIPS '83 Proceedings of the May 16-19, 1983, national computer conference
An overview of recent data base research
ACM SIGMIS Database
| Hi-index | 0.00 |
The Relational Associative Processor (RAP) is an experimental "backend" cellular processor for implementing data base management systems. RAP is particularly well suited to supporting Codd's relational model of data. The capacity of a RAP device implemented with current IC and memory technology can be estimated to contain 108 to 109 bits of associatively processable data. Because many data bases are larger, a virtual memory environment for RAP has been proposed and its performance simulated. The environment incorporates conventional memories for bulk storage and a single RAP processor---both controlled by a general purpose front-end computer. The system requires that the entire relational data base be divided into pages of size equal to one RAP cell memory. A buffer memory is added to RAP to permit the overlap of paging with processing. It has been found that user environments containing small relations or queries exhibiting either long processing times relative to paging requirements or some "locality" (defined as the degree to which sequences of queries reference some relations more than others) can efficiently page data between large data bases and data base machines without significant losses in performance.