A Hierarchical Associative Architecture for the Parallel Evaluation of Relational Algebraic Database Primitives

Algorithms are described and analyzed for the efficient evaluation of the primitive operators of a relational algebra on a proposed non-von Neumann machine based on a hierarchy of associative storage devices. In many cases of practical, import, the proposed architecture may also permit a significant improvement (by device) over the performance of previously implemented or proposed database machine architectures based on associative secondary storage devices