This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Multiprocessor Algorithms for Relational-Database Operators on Hypercube Systems
November 1990 (vol. 23 no. 11)
pp. 13-15, 18-28
ASCII Text
x 
 
Ophir Frieder, "Multiprocessor Algorithms for Relational-Database Operators on Hypercube Systems," Computer, vol. 23, no. 11, pp. 13-15, 18-28, November, 1990.
 
 
BibTex
x
 
@article{ 10.1109/2.60877,
author = {Ophir Frieder},
title = {Multiprocessor Algorithms for Relational-Database Operators on Hypercube Systems},
journal ={Computer},
volume = {23},
number = {11},
issn = {0018-9162},
year = {1990},
pages = {13-15, 18-28},
doi = {http://doi.ieeecomputersociety.org/10.1109/2.60877},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - MGZN
JO - Computer
TI - Multiprocessor Algorithms for Relational-Database Operators on Hypercube Systems
IS - 11
SN - 0018-9162
SP13
EP15, 18-28
EPD - 13-15, 18-28
A1 - Ophir Frieder,
PY - 1990
VL - 23
JA - Computer
ER -
 

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.

Citation:
Ophir Frieder, "Multiprocessor Algorithms for Relational-Database Operators on Hypercube Systems," Computer, vol. 23, no. 11, pp. 13-15, 18-28, Nov. 1990, doi:10.1109/2.60877
Usage of this product signifies your acceptance of the Terms of Use.