Parallel join algorithms for nested relations on shared-memory multiprocessors

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.<<ETX>>

[1]  Dirk Van Gucht,et al.  An Implementation for Nested Relational Databases , 1988, VLDB.

[2]  Peter A. Buhr,et al.  The μsystem: Providing light‐weight concurrency on shared‐memory multiprocessor computers running UNIX , 1990, Softw. Pract. Exp..

[3]  Per-Åke Larson,et al.  Letter from the TC Chair , 1988, IEEE Data Eng. Bull..

[4]  Per-Åke Larson,et al.  An algebra for nested relations , 1987 .

[5]  Patrick Valduriez,et al.  Parallel query processing for complex objects , 1988, Proceedings. Fourth International Conference on Data Engineering.