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
Database abstractions: aggregation and generalization
ACM Transactions on Database Systems (TODS)
A back-end computer for data base management
Communications of the ACM
A data base management system design philosophy
SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
Full protection specifications in the semantic model for database protection languages
ACM '76 Proceedings of the 1976 annual conference
A comparison of sequential and associate computing of priority queues
CAW '77 Proceedings of the 3rd workshop on Computer architecture : Non-numeric processing
An application of dynamic address computation in data management.
An application of dynamic address computation in data management.
| Hi-index | 0.01 |
A dynamic address computation mechanism for use in database management is presented. The address computation technique allows information structured according to a given pre-defined tree to be stored without any address pointers, yet the populated tree is assumed to have an arbitrary number of branches below non-terminating tree nodes, and have arbitrary length information stored at the tree leaves. The address computation is accomplished using a compact (yet complete) address-free description of the populated tree structure. Utilization of this description allows information at any level of the tree to be directly accessed. The address computation provides the basis for an "intermediate" database architecture which embodies many of the advantages of both associative architectures and classical Von Neumann architectures.