Partitioned-Tree Nested Loop Join: An Efficient Join for Spatio-Temporal Interval Join

Jinsoo Lee, Wook-Shin Han, Jaehwa Kim, Jeong-Hoon Lee

Abstract: A predictive spatio-temporal interval join finds all pairs of moving objects satisfying a join condition on future time interval and space. In this paper, we propose a method called PTJoin. PTJoin partitions the inner index into small sub-trees and performs the join process for each sub-tree to reduce the number of disk page accesses for each window search. Furthermore, to reduce the number of pages accessed by consecutive window searches, we partition the index so that overlapping index pages do not belong to the same partition. Our experiments show that PTJoin reduces the number of page accesses by up to an order of magnitude compared to Interval_STJoin[9], which is the state-of-the-art solution, when the buffer size is small.