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 particularly addressed this query type. We 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 us to optimize the query processing in the time dimension. In this study, we achieve this optimization through introducing the new concept of time-constrained (TC) processing. Further, TC processing enables a set of effective improvement techniques on traditional intersection join algorithms. With a thorough experimental study, we show that both TC processing and the improvement techniques enhances the performance significantly. Overall, our algorithm outperforms the best available solution by s...

• Type: Conference
• Year: 2008
• Where: ICDE
• Authors: Rui Zhang 0003, Dan Lin, Kotagiri Ramamohanarao, Elisa Bertino
• Keywords: Database, ICDE 2008, Intersection Join Query, Query Processing, TC Processing