RAP: an associative processor for data base management

ABSTRACT

Recent concepts in data base management systems (DBMS) necessitate making the logical view and the physical representation of data distinct from each other. Currently, this requirement has to be realized in the environment of conventional Von Neumann architecture. This creates the need for several levels of indirection for mapping one structure into the other. Also, efficient search mechanisms are needed to handle large data bases within concurrent processing and on-line response limits. The implementation of these requirements results in software complexities and inefficiencies in the following way. Pointer mechanisms for mapping structures and providing fast access paths have to be implemented by software and data. These pointers are extra data requiring extensive overhead in storage, access time, and maintenance.

REFERENCES

• 1: James A. Dugan , Robert S. Green , Jack Minker , Warren E. Shindle, A study of the utility of associative memory processors, Proceedings of the 1966 21st national conference, p.347-360, January 1966 [doi>10.1145/800256.810714]
• 2: Slotnick, D. L., "Logic Per Track Devices," Advances in Computers, Academic press, 1970.
• 3: Leonard D. Healy , Gerald J. Lipovski , Keith L. Doty, The architecture of a context addressed segment-sequential storage, Proceedings of the December 5-7, 1972, fall joint computer conference, part II, December 05-07, 1972, Anaheim, California [doi>10.1145/1480083.1480091]
• 4: Behrooz Parhami, A highly parallel computing system for information retrieval, Proceedings of the December 5-7, 1972, fall joint computer conference, part II, December 05-07, 1972, Anaheim, California [doi>10.1145/1480083.1480090]
• 5: N. Minsky, Rotating storage devices as partially associative memories, Proceedings of the December 5-7, 1972, fall joint computer conference, part I, December 05-07, 1972, Anaheim, California [doi>10.1145/1479992.1480075]
• 6: Parker, J. L., "A Logic Per Track Retrieval System," IFIP Congress, 1971.
• 7: Stanley Y. W. Su , George P. Copeland , G. Jack Lipovski, Retrieval operations and data representations in a context-addressed disc system, Proceedings of the 1973 meeting on Programming languages and information retrieval, p.144-160, November 04-06, 1973, Gaithersburg, Maryland
• 8: George P. Copeland, Jr. , G. J. Lipovski , Stanley Y.W. Su, The architecture of CASSM: A cellular system for non-numeric processing, Proceedings of the 1st annual symposium on Computer architecture, p.121-128, December 09-11, 1973
• 9: George P. Copeland , Stanley Y. W. Su, A high level data sublanguage for a context-addressed segment-sequential memory, Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control, p.265-276, May 01-03, 1974, Ann Arbor, Michigan [doi>10.1145/800296.811516]
• 10: Ozkarahan, E. A., S. A. Schuster, K. C. Smith, A Data Base Processor, Computer Systems Research Group TR-43, University of Toronto, September 1974.
• 11: E. F. Codd, A relational model of data for large shared data banks, Communications of the ACM, v.13 n.6, p.377-387, June 1970 [doi>10.1145/362384.362685]
• 12: Boyce, R. F., D. D. Chamberlin, W. F. King III, M. M. Hammer, Specifying Queries as Relational Expressions: SQUARE, IBM Technical Report RJ 1291, IBM Research Laboratory, San Jose, California, October 1973.
• 13: Donald D. Chamberlin , Raymond F. Boyce, SEQUEL: A structured English query language, Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control, p.249-264, May 01-03, 1974, Ann Arbor, Michigan [doi>10.1145/800296.811515]
• 14: Codd, E. F., "A Data Base Sublanguage Founded on the Relational Calculus," Proceedings of ACM SIGFIDET Workshop on Data Description, Access, and Control, 1971.