Continuous Intersection Joins Over Moving Objects
The continuous intersection join query is computationally expensive yet important for various applications on moving objects. No previous study has specifically addressed this query type. The authors can adopt a naive algorithm or extend an existing technique (TP-Join) to process the query. However, they compute the answer for either too long or too short a time interval, which results in either a very large computation cost per object update or too frequent answer updates, respectively. This motivates one to optimize the query processing in the time dimension. In this paper, the authors achieve this optimization by introducing the new concept of Time-Constrained (TC) processing.