An Evaluation of Relational Join Algorithms in a Pipelined Query Processing Environment
IEEE Transactions on Software Engineering
A relational database machine architecture
CAW '80 Proceedings of the fifth workshop on Computer architecture for non-numeric processing
An associative array architecture intended for semantic network processing
ACM '84 Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge
Research in knowledge base management systems
ACM SIGMOD Record
An eclectic 5th generation architecture for ultra high speed computing
ACM SIGART Bulletin
NON-VON: a parallel machine architecture for knowledge-based information processing
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 2
Hi-index | 0.00 |
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. This architecture permits an O(log n) decrease in time complexity over the best known evaluation methods on a conventional computer system, without the use of redundant storage, and using currently available and potentially competitive technology. In many eases of practical import, the proposed architecture may also permit a significant improvement (by a factor roughly proportional to the capacity of the primary associative storage device) over the performance of previously implemented or proposed database machine architectures based on associative secondary storage devices.