By Topic

NON-VON's performance on certain database benchmarks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Bruce K. Hillyer ; Department of Computer Science, Columbia University, New York, NY 10027 ; David Elliot Shaw ; Anil Nigam

In a paper by P.B. Hawthorn and D.J. DeWitt (1982) the projected performance of several proposed database machines was examined for three relational database queries. The present authors investigate 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.

Published in:

IEEE Transactions on Software Engineering  (Volume:SE-12 ,  Issue: 4 )