Adaptive index management for future location-based queries

Many location-based applications have arisen in various areas including mobile communications, traffic control and military command and control (C2) systems. And one of the important research issue in these areas is tracking and managing moving objects through spatiotemporal indexing for the efficient location-based services. However, managing exact geometric location information is difficult to be achieved due to continual changes of moving objects.Traditionally spatiotemporal index structures focus on optimizing the node accesses during construction and massive updates that do not refer on-line movement updates. In this paper we propose an indexing framework for future location queries based on space partitioning and the dual transformation. Our method provides a constraint database approach for constructing indexes to improve the efficiency of spatiotemporal query answering. In addition, the performance enhancement is achieved by our cost-based dynamic management algorithm that determines the appropriate index reorganization probabilistically induced by various mobility models and query cost functions. This approach can be applied for the predictive range queries on moving object's trajectories specifically in the mobile communication environments. We evaluate our method and compare the performance with the related spatiotemporal index structures in the simulated environments.

[1]  ZhangJun,et al.  Cost models for overlapping and multiversion structures , 2002 .

[2]  Oliver Günther,et al.  Multidimensional access methods , 1998, CSUR.

[3]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[4]  Evaggelia Pitoura,et al.  Locating Objects in Mobile Computing , 2001, IEEE Trans. Knowl. Data Eng..

[5]  Yufei Tao,et al.  Spatial queries in dynamic environments , 2003, TODS.

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

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

[8]  Jianwen Su,et al.  On moving object queries: (extended abstract) , 2002, PODS '02.

[9]  Myoung-Ho Kim,et al.  An Efficient Spatiotemporal Indexing Method for Moving Objects in Mobile Communication Environments , 2003, Mobile Data Management.

[10]  Jim Freeman,et al.  Stochastic Processes (Second Edition) , 1996 .

[11]  Walid G. Aref,et al.  Window Query Processing in Linear Quadtrees , 2004, Distributed and Parallel Databases.

[12]  Yufei Tao,et al.  Cost models for overlapping and multiversion structures , 2002, TODS.

[13]  Victor C. M. Leung,et al.  Location management for next-generation personal communications networks , 2000, IEEE Netw..

[14]  Zygmunt J. Haas,et al.  Predictive distance-based mobility management for PCS networks , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

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

[16]  Leonidas J. Guibas,et al.  Data structures for mobile data , 1997, SODA '97.

[17]  Oscar H. Ibarra,et al.  On Moving Object Queries , 2002, PODS.

[18]  Volker Markl,et al.  Integrating the UB-Tree into a Database System Kernel , 2000, VLDB.

[19]  Jeffrey Scott Vitter,et al.  Efficient searching with linear constraints , 1998, J. Comput. Syst. Sci..

[20]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[21]  Rakesh M. Verma,et al.  An Efficient Multiversion Access STructure , 1997, IEEE Trans. Knowl. Data Eng..

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

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

[24]  Yufei Tao,et al.  Cost models for overlapping and multi-version B-trees , 2002, Proceedings 18th International Conference on Data Engineering.