Title

Continuous Intersection Joins Over Moving Objects

Abstract

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. 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 by 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 our algorithm outperforms the best adapted existing solution by several orders of magnitude

Keywords

query processing, visual databases

Date of this Version

4-2008

Comments

International Conference on Data Engineering, 2008. ICDE 2008. IEEE 24th Issue Date: 7-12 April 2008 page(s): 863 - 872; Cancun

Share

COinS