A Performance Evaluation of Pointer-Based Joins.
Eugene J. Shekita
Michael J. Carey
ACM SIGMOD Conference
1990
19
2
300
311
In this paper we describe three pointer-based join algorithms that are simple variants of the nested-loops, sort-merge, and hybrid-hash join algorithms used in relational data-base systems. Each join algorithm is described and an analysis is carried out