This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
NON-VON's performance on certain database benchmarks
April 1986 (vol. 12 no. 4)
pp. 577-583
Bruce K. Hillyer, Department of Computer Science, Columbia University, New York, NY 10027
David Elliot Shaw, Department of Computer Science, Columbia University, New York, NY 10027
Anil Nigam, IBM Thomas J. Watson Research Center, Yorktown Heights, NY 10598
In a paper by Hawthorn and DeWitt, the projected performance of several proposed database machines was examined for three relational database queries. The present paper investigates the performance of a massively parallel machine called NON-VON for the same queries under comparable assumptions. In the case of simple queries, a NON-VON machine of comparable size to those considered by Hawthorn and DeWitt is found to be somewhat faster than the fastest machines examined in their study; for a more complex database operation, NON-VON is shown to be five to ten times faster than the fastest of these machines.
Index Terms:
Magnetic heads,Process control,Clocks,Computer architecture,Random access memory,Loading,Disk drives,tree machine,Associative processor,computer architecture,database machine,database management,parallel processor,performance analysis,SIMD machine
Citation:
Bruce K. Hillyer, David Elliot Shaw, Anil Nigam, "NON-VON's performance on certain database benchmarks," IEEE Transactions on Software Engineering, vol. 12, no. 4, pp. 577-583, April 1986, doi:10.1109/TSE.1986.6312905
Usage of this product signifies your acceptance of the Terms of Use.