Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects

Moving object environments are characterized by large numbers of moving objects and numerous concurrent continuous queries over these objects. Efficient evaluation of these queries in response to the movement of the objects is critical for supporting acceptable response times. In such environments, the traditional approach of building an index on the objects (data) suffers from the need for frequent updates and thereby results in poor performance. In fact, a brute force, no-index strategy yields better performance in many cases. Neither the traditional approach nor the brute force strategy achieve reasonable query processing times. This paper develops novel techniques for the efficient and scalable evaluation of multiple continuous queries on moving objects. Our solution leverages two complimentary techniques: Query Indexing and Velocity Constrained Indexing (VCI). Query Indexing relies on 1) incremental evaluation, 2) reversing the role of queries and data, and 3) exploiting the relative locations of objects and queries. VCI takes advantage of the maximum possible speed of objects in order to delay the expensive operation of updating an index to reflect the movement of objects. In contrast to an earlier technique that requires exact knowledge about the movement of the objects, VCI does not rely on such information. While Query Indexing outperforms VCI, it does not efficiently handle the arrival of new queries. Velocity constrained indexing, on the other hand, is unaffected by changes in queries. We demonstrate that a combination of Query Indexing and Velocity Constrained Indexing enables the scalable execution of insertion and deletion of queries in addition to processing ongoing queries. We also develop several optimizations and present a detailed experimental evaluation of our techniques. The experimental results show that the proposed schemes outperform the traditional approaches by almost two orders of magnitude.

[1]  Dieter Pfoser,et al.  Novel Approaches in Query Processing for Moving Object Trajectories , 2000, VLDB 2000.

[2]  H. Koshima,et al.  Personal locator services emerge , 2000 .

[3]  S JensenChristian,et al.  Indexing the positions of continuously moving objects , 2000 .

[4]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[5]  Rafael Alonso,et al.  Are “Disks in the Air” Just Pie in the Sky? , 1994, 1994 First Workshop on Mobile Computing Systems and Applications.

[6]  Bernhard Seeger,et al.  An asymptotically optimal multiversion B-tree , 1996, The VLDB Journal.

[7]  Markus Schneider,et al.  A foundation for representing and querying moving objects , 2000, TODS.

[8]  Pankaj K. Agarwal,et al.  Indexing moving points (extended abstract) , 2000, PODS '00.

[9]  A. Prasad Sistla,et al.  Modeling and querying moving objects , 1997, Proceedings 13th International Conference on Data Engineering.

[10]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[11]  Walid G. Aref,et al.  Information Management in a Ubiquitous Global Postioning Environment , 2000 .

[12]  Susanne E. Hambrusch,et al.  Minimizing broadcast costs under edge reductions in tree networks , 1997, Proceedings 1997 International Conference on Parallel and Distributed Systems.

[13]  Ouri Wolfson,et al.  Cost and imprecision in modeling the position of moving objects , 1998, Proceedings 14th International Conference on Data Engineering.

[14]  Walid G. Aref,et al.  Query Processing in Broadcasted Spatial Index Trees , 2001, SSTD.

[15]  Steen A. Parl,et al.  Providing universal location services using a wireless E911 location network , 1998 .

[16]  Wang-Chien Lee,et al.  A Hybrid Index Technique for Power Efficient Data Broadcast , 2004, Distributed and Parallel Databases.

[17]  Nina Amenta,et al.  Bounded boxes, Hausdorff distance, and a new proof of an interesting Helly-type theorem , 1994, SCG '94.

[18]  Nick Roussopoulos,et al.  Nearest neighbor queries , 1995, SIGMOD '95.

[19]  Tomasz Imielinski,et al.  Energy efficient indexing on air , 1994, SIGMOD '94.

[20]  Christos Faloutsos,et al.  Designing Access Methods for Bitemporal Databases , 1998, IEEE Trans. Knowl. Data Eng..

[21]  Leonidas J. Guibas,et al.  Parallel computational geometry , 1988, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[22]  Rafael Alonso,et al.  Broadcast disks: data management for asymmetric communication environments , 1995, SIGMOD '95.

[23]  J. Werb,et al.  Designing a positioning system for finding things and people indoors , 1998 .

[24]  Ralf Hartmut Güting,et al.  A data model and data structures for moving objects databases , 2000, SIGMOD '00.

[25]  Bo Xu,et al.  Moving objects databases: issues and solutions , 1998, Proceedings. Tenth International Conference on Scientific and Statistical Database Management (Cat. No.98TB100243).

[26]  Timos K. Sellis,et al.  Review - The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles , 2000, ACM SIGMOD Digital Review.

[27]  Wang-Chien Lee,et al.  Power conservative multi-attribute queries on data broadcast , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

[28]  Stanley B. Zdonik,et al.  Disseminating Updates on Broadcast Disks , 1996, VLDB.

[29]  Dimitrios Gunopulos,et al.  On indexing mobile objects , 1999, PODS '99.

[30]  A. Prasad Sistla,et al.  Updating and Querying Databases that Track Mobile Units , 1999, Distributed and Parallel Databases.

[31]  Özgür Ulusoy,et al.  A Quadtree-Based Dynamic Attribute Indexing Method , 1998, Comput. J..

[32]  Alok Aggarwal,et al.  Fast algorithms for computing the largest empty rectangle , 1987, SCG '87.

[33]  Dieter Pfoser,et al.  Capturing the Uncertainty of Moving-Object Representations , 1999, SSD.

[34]  Ouri Wolfson Research issues in moving objects databases (tutorial session) , 2000, SIGMOD '00.

[35]  F. Frances Yao,et al.  Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.