Elements of Data Management Systems
ACM Computing Surveys (CSUR)
RECOL—a retrieval command language
Communications of the ACM
Information structures for processing and retrieving
Communications of the ACM
Associative and Parallel Processors
ACM Computing Surveys (CSUR)
An associative file store using fragments for run-time indexing and compression
SIGIR '80 Proceedings of the 3rd annual ACM conference on Research and development in information retrieval
The application of associative processing in discrete simulation
WSC '71 Proceedings of the 5th conference on Winter simulation
SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control
ACM SIGIR Forum
A Quantitative Analysis of the Utilization of Associative Memories in Data Management
IEEE Transactions on Computers
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
Associative processor applications to real-time data management
AFIPS '73 Proceedings of the June 4-8, 1973, national computer conference and exposition
Some problems in associative processor applications to data base management
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
| Hi-index | 0.01 |
This paper is concerned with the development of data management systems from an associative point of view. The design utilizes relational set theory applied to information systems. The basic notion involves the mathematical transformation of hierarchical structures of n-ary relations into associative normal form (ANF). This transformation preserves the information content while at the same time allowing the information to be manipulated by an associative memory in a more efficient manner than is possible on a random access memory. Among the advantages that can be realized from this system are the capability of handling many and varied data structures; substantially fewer pointers and directories; a reduction in storage space requirements; and a substantial decrease in query and update time.