This Article 
 Bibliographic References 
 Add to: 
Querying Imprecise Data in Moving Object Environments
September 2004 (vol. 16 no. 9)
pp. 1112-1127
In moving object environments, it is infeasible for the database tracking the movement of objects to store the exact locations of objects at all times. Typically, the location of an object is known with certainty only at the time of the update. The uncertainty in its location increases until the next update. In this environment, it is possible for queries to produce incorrect results based upon old data. However, if the degree of uncertainty is controlled, then the error of the answers to queries can be reduced. More generally, query answers can be augmented with probabilistic estimates of the validity of the answer. In this paper, we study the execution of probabilistic range and nearest-neighbor queries. The imprecision in answers to queries is an inherent property of these applications due to uncertainty in data, unlike the techniques for approximate nearest-neighbor processing that trade accuracy for performance. Algorithms for computing these queries are presented for a generic object movement model and detailed solutions are discussed for two common models of uncertainty in moving object databases. We study the performance of these queries through extensive simulations.

[1] T. Abdessalem, J. Moreira, and C. Ribeiro, Movement Query Operations for Spatio-Temporal Databases Proc. 17 mes Journées Bases de Données Avancées, Oct. 2001.
[2] P. Agarwal, L. Arge, and J. Erickson, Indexing Moving Points Proc. 19th Conf. Principles of Database Systems (PODS), 2000.
[3] S. Buckingham, What Is General Packet Radio Service? , 2000.
[4] R. Cheng, S. Prabhakar, and D.V. Kalashnikov, Querying Imprecise Data in Moving Object Environments Proc. Int'l Conf. Data Eng. (ICDE '03), 2003.
[5] P.H. Dana, Global Positioning System Overview technical report, Univ. of Texas at Austin, 2000, also available at notes/gpsgps_f.html.
[6] M. Hadjieleftheriou, G. Kollios, V.J. Tsotras, and D. Gunopulos, Efficient Indexing of Spatiotemporal Objects Proc. Eighth Int'l Conf. Extending Database Technology, 2002.
[7] D.V. Kalashnikov, S. Prabhakar, S. Hambrusch, and W. Aref, Efficient Evaluation of Continuous Range Queries on Moving Objects Proc. 13th Int'l Conf. and Workshop Database and Expert Systems Applications, 2002.
[8] G. Kollios, D. Gunopulos, and V.J. Tsotras, Nearest Neighbour Queries in a Mobile Environment Proc. Spatio-Temporal Database Management, 1999.
[9] G. Kollios, D. Gunopulos, and V.J. Tsotras, On Indexing Mobile Objects Proc. 19th Conf. Principles of Database Systems (PODS), 1999.
[10] I. Lazaridis, K. Porkaew, and S. Mehrotra, Dynamic Queries over Mobile Objects Proc. Eighth Int'l Conf. Extending Database Technology, pp. 269-286, 2002.
[11] Navman, iCN630 Vehicle Navigation GPS,http://www.navma, 2003.
[12] A. Papadopoulos and Y. Manolopoulos, Performance of Nearest Neighbor Queries in R-Trees Proc. Int'l Conf. Database Theory, pp. 394-408, 1997.
[13] D. Pfoser and C.S. Jensen, Capturing the Uncertainty of Moving-Objects Representations Proc. Int'l Conf. Scientific and Statistical Database Manage,emt (SSDBM), pp. 123-132, 1999.
[14] D. Pfoser and C.S. Jensen, Querying the Trajectories of On-Line Mobile Objects Proc. MobiDE 2001, pp. 66-73, 2001.
[15] D. Pfoser, C.S. Jensen, and Y. Theodoridis, Novel Approaches in Query Processing for Moving Object Trajectories Proc. 26th Int'l Conf. Very Large Data Bases, 2000.
[16] S. Prabhakar, Y. Xia, D. Kalashnikov, W. Aref, and S. Hambrusch, Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects IEEE Trans. Computers, vol. 51, no. 10, pp. 1124-1140, Oct. 2002.
[17] N. Roussopoulos, S. Kelley, and F. Vincent, Nearest Neighbor Queries Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 71-79, 1995.
[18] P.A. Sistla, O. Wolfson, S. Chamberlain, and S. Dao, Modeling and Querying Moving Objects Proc. Int'l Conf. Data Eng., pp. 422-432, 1997.
[19] P.A. Sistla, O. Wolfson, S. Chamberlain, and S. Dao, Querying the Uncertain Position of Moving Objects Temporal Databases: Research and Practice, no. 1399, 1998.
[20] Z. Song and N. Roussopoulos, $k$-Nearest Neighbor Search for Moving Query Point Proc. Symp. Spatial and Temporal Databases, pp. 79-96, 2001.
[21] J. Tayeb, O. Ulusoy, and O. Wolfson, A Quadtree-Based Dynamic Attribute Indexing Method The Computer J., vol. 41, no. 3, pp. 185-200, 1998.
[22] Y. Theodoridis, T. Sellis, A.N. Papadopoulos, and Y. Manolopoulos, Specifications for Efficient Indexing in Spatiotemporal Databases Proc. 11th Int'l Conf. Scientific and Statistical Database Management, 1999.
[23] G. Trajcevski, O. Wolfson, F. Zhang, and S. Chamberlain, The Geometry of Uncertainty in Moving Object Databases Proc. Eighth Int'l Conf. Extending Database Technology, Mar. 2002.
[24] O. Wolfson, P.A. Sistla, S. Chamberlain, and Y. Yesha, Updating and Querying Databases that Track Mobile Units Distributed and Parallel Databases, vol. 7, no. 3, pp. 257-387, 1999.

Index Terms:
Data uncertainty, probabilistic queries, range queries, nearest-neighbor queries.
Reynold Cheng, Dmitri V. Kalashnikov, Sunil Prabhakar, "Querying Imprecise Data in Moving Object Environments," IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 9, pp. 1112-1127, Sept. 2004, doi:10.1109/TKDE.2004.46
Usage of this product signifies your acceptance of the Terms of Use.