A Database Machine for Very Large Relational Databases
IEEE Transactions on Computers
Response Time Analysis of Multiprocessor Computers for Database Support
ACM Transactions on Database Systems (TODS)
Implementing a relational database by means of specialzed hardware
ACM Transactions on Database Systems (TODS)
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
| Hi-index | 0.00 |
In this paper we classify and analyze approximately twenty database machines (DBMs). We show that (i) research has generally been focused on brute force parallel search methods, (ii) little original work has been done on storage structures, (iii) almost no work has been done on database operating systems, and (iv) most designs are geared towards minimizing the response time of an individual operation, few designs attempt to minimize the response time of an individual query, and almost none are throughput oriented. We also show that the machine architecture of most DBMs can be described using a small number of building blocks.