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
textabstractLarge memories have become an affordable storage medium for databases involving hundreds...
An associative memory for a relational database management system, with content addressing capabilit...
http://deepblue.lib.umich.edu/bitstream/2027.42/7187/5/bad1123.0001.001.pdfhttp://deepblue.lib.umich...
Algorithms are described and analyzed for the efficient evaluation of the primitive operators of a r...
In this paper, we propose a new multi-comparand associative machine (MCA-machine) and its applicatio...
The central focus of this chapter is the highly efficient execution of relational database queries u...
[[abstract]]Database management has become increasingly important in recent years. How to design an ...
This paper introduces relational algebra as an elegant formalism to describe hardware behaviour. Har...
This paper introduces relational algebra s an elegant formalism to describe hardware behaviour. Hard...
We present storage organization schemes and a tuple density model of a relation, for the efficient p...
Herein, an enhanced square array processor which is the mapping of the binary relational algebra com...
This paper will examine two data base management systems; IMS, an example of a hierarchical data bas...
Generalized Data Base Management Systems are a product of current requirements to give users easy an...
It has long been recognized that computer systems containing large data bases expend an inordinate a...
Parallelism is key to high performance relational database systems. Since there are several parallel...
textabstractLarge memories have become an affordable storage medium for databases involving hundreds...
An associative memory for a relational database management system, with content addressing capabilit...
http://deepblue.lib.umich.edu/bitstream/2027.42/7187/5/bad1123.0001.001.pdfhttp://deepblue.lib.umich...
Algorithms are described and analyzed for the efficient evaluation of the primitive operators of a r...
In this paper, we propose a new multi-comparand associative machine (MCA-machine) and its applicatio...
The central focus of this chapter is the highly efficient execution of relational database queries u...
[[abstract]]Database management has become increasingly important in recent years. How to design an ...
This paper introduces relational algebra as an elegant formalism to describe hardware behaviour. Har...
This paper introduces relational algebra s an elegant formalism to describe hardware behaviour. Hard...
We present storage organization schemes and a tuple density model of a relation, for the efficient p...
Herein, an enhanced square array processor which is the mapping of the binary relational algebra com...
This paper will examine two data base management systems; IMS, an example of a hierarchical data bas...
Generalized Data Base Management Systems are a product of current requirements to give users easy an...
It has long been recognized that computer systems containing large data bases expend an inordinate a...
Parallelism is key to high performance relational database systems. Since there are several parallel...
textabstractLarge memories have become an affordable storage medium for databases involving hundreds...
An associative memory for a relational database management system, with content addressing capabilit...
http://deepblue.lib.umich.edu/bitstream/2027.42/7187/5/bad1123.0001.001.pdfhttp://deepblue.lib.umich...