... relations R and S, and a predicate θ R θ S is, as usual, the relational θ join of R and S For now, assume that θ is a conjunction of the form R.a1 op1 S.a1 AND R.a2 op2 S.a2 AND, …, AND R.ap-1 ... Without loss of generality, let θ be of the form R.a1 = S.a1 AND R.a2 = S.a2 AND, …, AND R.ak = S.ak AND R.ak+1 < S.ak+1 Now within each group G, all R and S tuples match each other on the k equality ... R Agrawal and H.V Jagadish “Materialization and Incremental Update of Path Information”, Proceedings of ICDE 1989, p.374-383 [2] R Agrawal and E Wimmers “A Framework for Expressing and Combining...