SPQI: An Efficient Index for Continuous Range Queries in Mobile Environments

This paper explores the problem of efficient processing of continuous range queries (CRQs) over a large number of moving objects, each of which continually retrieves the moving objects that are currently within a geographic query region of interest. In order to keep the result of CRQs up-to-date, the moving objects should continually communi- cate with the server to report their current locations. However, this increases the server workload and entails a huge amount of communication cost when the number of the moving objects and CRQs becomes enormous. In this paper, we adopt the approach of leveraging available memory and computational resources of the moving objects to remedy such problems. To this end, we propose a novel query indexing structure, re- ferred to as the space partitioning query index (SPQI), which enables the server to effi- ciently cooperate with the moving objects for processing CRQs. SPQI greatly improves the overall system performance in terms of server workload and communication cost. Through a set of comprehensive simulations, we verify the superiority of SPQI.

[1]  Philip S. Yu,et al.  Efficient Processing of Continual Range Queries for Location-Aware Mobile Services , 2005, Inf. Syst. Frontiers.

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

[3]  Kien A. Hua,et al.  A hybrid communication solution to distributed moving query monitoring systems , 2011, Electron. Commer. Res. Appl..

[4]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[5]  Jimeng Sun,et al.  The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries , 2003, VLDB.

[6]  Christian S. Jensen,et al.  Indexing the positions of continuously moving objects , 2000, SIGMOD '00.

[7]  Philip S. Yu,et al.  On incremental processing of continual range queries for location-aware services and applications , 2005, The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services.

[8]  Ling Liu,et al.  MobiEyes: A Distributed Location Monitoring Service Using Moving Location Queries , 2006, IEEE Transactions on Mobile Computing.

[9]  Christos Faloutsos,et al.  The R+-Tree: A Dynamic Index for Multi-Dimensional Objects , 1987, VLDB.

[10]  Walid G. Aref,et al.  Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects , 2002, IEEE Trans. Computers.

[11]  Susanne E. Hambrusch,et al.  Main Memory Evaluation of Monitoring Queries Over Moving Objects , 2004, Distributed and Parallel Databases.

[12]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[13]  Kyriakos Mouratidis,et al.  Continuous Monitoring of Spatial Queries in Wireless Broadcast Environments , 2009, IEEE Transactions on Mobile Computing.

[14]  Jianliang Xu,et al.  A generic framework for monitoring continuous spatial queries over moving objects , 2005, SIGMOD '05.

[15]  Jignesh M. Patel,et al.  STRIPES: an efficient index for predicted trajectories , 2004, SIGMOD '04.

[16]  Beng Chin Ooi,et al.  Query and Update Efficient B+-Tree Based Indexing of Moving Objects , 2004, VLDB.

[17]  Eduardo Mena,et al.  Location-dependent query processing: Where we are and where we are heading , 2010, CSUR.

[18]  Kien A. Hua,et al.  Real-time processing of range-monitoring queries in heterogeneous mobile databases , 2006, IEEE Transactions on Mobile Computing.

[19]  Walid G. Aref,et al.  SINA: scalable incremental processing of continuous queries in spatio-temporal databases , 2004, SIGMOD '04.