Efficient spatio-interval join
MetadataShow full item record
This thesis studies existing techniques for both spatial join and interval join. Us-ing existing methods and algorithms for join operations two new algorithms forspatio-interval join is developed. Parallelization techniques from work on spa-tial join and interval join are applied to the two spatio-interval join algorithmsand a parallel algorithm is presented for each of them. The results from imple-menting these algorithms show that it is possible to solve the spatio-interval bymodifying the existing algorithms and that the parallelization techniques canbe successfully applied to the spatio-interval join algorithms.