DocumentCode :
3271122
Title :
Parallel join algorithms for nested relations on shared-memory multiprocessors
Author :
Deshpande, V. ; Larson, P.-A. ; Martin, T.P.
Author_Institution :
Dept. of Comput. Sci., Waterloo Univ., Ont., Canada
fYear :
1990
fDate :
9-13 Dec 1990
Firstpage :
344
Lastpage :
347
Abstract :
The authors examine the problem of performing a join involving nested relations in a parallel shared-everything environment. They show the difference between joining flat relations and joining nested relations, and then develop hash-based parallel join algorithms. Both IO and CPU parallelism are addressed. Preliminary experimental results are presented
Keywords :
database theory; file organisation; parallel algorithms; relational databases; CPU parallelism; IO parallelism; hash algorithms; nested relations; parallel join algorithms; parallel shared-everything environment; relational databases; shared-memory multiprocessors; Algebra; Computer science; Concurrent computing; Disk drives; Information science; Parallel architectures; Parallel processing; Prototypes; Query processing; Relational databases;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel and Distributed Processing, 1990. Proceedings of the Second IEEE Symposium on
Conference_Location :
Dallas, TX
Print_ISBN :
0-8186-2087-0
Type :
conf
DOI :
10.1109/SPDP.1990.143562
Filename :
143562
Link To Document :
بازگشت