Cart (Loading....) | Create Account
Close category search window

Multiprocessor algorithms for relational-database operators on hypercube systems

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
$31 $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

1 Author(s)
Frieder, O. ; Dept. of Comput. Sci., George Mason Univ., Fairfax, VA, USA

The tutorial focuses on hypercube interconnected architectures as a computational engine for relational-database processing. Several implementations of the many currently available hypercube systems are highlighted, and comments on their potential performance in evaluating relational-database operators are presented. All algorithms assume that the relevant data are memory resident. Experimental timings obtained from a portable hypercube-based database system are presented to characterize performance potential for various uniscan and multiscan operations.<>

Published in:

Computer  (Volume:23 ,  Issue: 11 )

Date of Publication:

Nov. 1990

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.