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
Optimizing the performance of a relational algebra database interface
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
A preliminary architecture for a basic data-flow processor
ISCA '75 Proceedings of the 2nd annual symposium on Computer architecture
Spl: a structured programming language.
Spl: a structured programming language.
ACM Computing Surveys (CSUR)
Exploiting parallelism in a Relational Associative Processor
CAW '78 Proceedings of the fourth workshop on Computer architecture for non-numeric processing
Exploiting parallelism in a Relational Associative Processor
ACM SIGARCH Computer Architecture News
An overview of recent data base research
ACM SIGMIS Database
| Hi-index | 0.00 |
A simple query to a large data base may take a prohibitively long time to process. To decrease this time in applications requiring fast response, parallel processing is necessary. Within the scope of a Relational Algebra query system, the potential parallelism in query execution is investigated. Three levels of parallelism are identified: independent parallelism, pipelining and node splitting. It is shown that, under certain conditions, the exploitation of these levels makes highly parallel processing and short response time possible. A data driven computation scheme which can implement the three levels of parallelism in a unified way is described.