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