Implementing a relational database by means of specialzed hardware
ACM Transactions on Database Systems (TODS)
An Introduction to Database Systems
An Introduction to Database Systems
Systolic (VLSI) arrays for relational database operations
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
A Relational Database Machine Architecture
CAW '80 The Papers of the Fifth Workshop on Computer Architecture for Non-Numeric Processing
CASSM: a cellular system for very large data bases
VLDB '75 Proceedings of the 1st International Conference on Very Large Data Bases
Design and analysis of a relational join operation for VLSI
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
A performance evaluation of data base machine architectures (invited paper)
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Direct A Multiprocessor Organization for Supporting Relational Database Management Systems
IEEE Transactions on Computers
DBC A Database Computer for Very Large Databases
IEEE Transactions on Computers
RAP: an associative processor for data base management
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
| Hi-index | 0.01 |
Hardware organizations for processing set-theoretic database query functions are presented. These organizations implement the functions by processing index trees. One advantage of this approach is that the index trees can be merged in a highly parallel fashion. Hardware organizations proposed here use the database machine approach, thus processing the index-trees on the fly. Experimental results giving the performances of these organizations are presented. Finally, a slight variation of the index tree representation, requiring much less storage for the index, is given.