1. Spatial Join Yan Huang huangyan@unt.edu

2. Spatial Join Given two sets of spatial data Find the pair of objects satisfying certain spatial predicate – e.g. INSIDE, WITHIN

3. Two Methods On-the-fly Indexing-based

4. On-the-fly Nested-loop Block-nested-loop for large dataset

5. Indexing: Z-order Grid the space Create a z-order of the cells An object is represented by MBR and have a set of z-values Index z-values using on-dimensional indexing such as B+ tree INSIDE? WITHIN?

6. Filter-and-refine Each object is represented by it MBR Join in MBR level first Only those past MBR level filtering will be check for actually relationship INSIDE? WITHIN?

7. R-tree indexing from wikipedia

8. Quadtree From wikipedia

9. Tree-matching Simultaneously traverse two tree nodes TreeM(R1,R2) If the two nodes are non-disjoint – If R1 is leaf R2 is not leaf, recursively call TreeM(R1,R2.child) for each child of R2. Otherwise, find pairs from R1 and R2 – Otherwise If R2 is leaf, recursively call TreeM(R1.child,R2) for each child of R1. Otherwise, recursively call TreeM(R1.child,R2.child) for each child of R1 and each child of R2.

10. Partition-based Merge Join Jignesh M. Patel, David J. DeWitt, Partition Based Spatial-Merge Join, SIGMOD 1996.