Journal of Computer Science and Technology

, Volume 25, Issue 5, pp 982–998 | Cite as

Uncertain Distance-Based Range Queries over Uncertain Moving Objects

Regular Paper

Abstract

Distance-based range search is crucial in many real applications. In particular, given a database and a query issuer, a distance-based range search retrieves all the objects in the database whose distances from the query issuer are less than or equal to a given threshold. Often, due to the accuracy of positioning devices, updating protocols or characteristics of applications (for example, location privacy protection), data obtained from real world are imprecise or uncertain. Therefore, existing approaches over exact databases cannot be directly applied to the uncertain scenario. In this paper, we redefine the distance-based range query in the context of uncertain databases, namely the probabilistic uncertain distance-based range (PUDR) queries, which obtain objects with confidence guarantees. We categorize the topological relationships between uncertain objects and uncertain search ranges into six cases and present the probability evaluation in each case. It is verified by experiments that our approach outperform Monte-Carlo method utilized in most existing work in precision and time cost for uniform uncertainty distribution. This approach approximates the probabilities of objects following other practical uncertainty distribution, such as Gaussian distribution with acceptable errors. Since the retrieval of a PUDR query requires accessing all the objects in the databases, which is quite costly, we propose spatial pruning and probabilistic pruning techniques to reduce the search space. Two metrics, false positive rate and false negative rate are introduced to measure the qualities of query results. An extensive empirical study has been conducted to demonstrate the efficiency and effectiveness of our proposed algorithms under various experimental settings.

Keywords

moving objects uncertainty distance-based range query 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Yang X, Xiao G, Wang B, Chen M. The management of uncertain moving objects. Communications of the CFF, 2009, 4(5): 21–31.Google Scholar
  2. [2]
    Pfoser D, Jensen C S. Capturing the uncertainty of moving object representations. In Proc. SSD 1999, Hong Kong, China, Jul. 20-23, 1999, pp.111–131.Google Scholar
  3. [3]
    Cvilis A, Jensen C S, Pakainis S. Techniques for efficient road network-based tracking of moving objects. IEEE Transactions on Knowledge and Data Engineering, 2005, 17(5): 698–713.CrossRefGoogle Scholar
  4. [4]
    Almeida V T D, Güting R H. Indexing the trajectories of moving objects in networks. GeoInformatica, 2005, 9(1): 1–47.Google Scholar
  5. [5]
    Wolfson O, Sistla A P, Chamberlain S, Yesha Y. Updating and querying databases that track mobile units. Distributed and Parallel Databases, 1999, 7(3): 257–387.CrossRefGoogle Scholar
  6. [6]
    Trajcevski G, Wolfson O, Chamberlain S, Zhang F. The geometry of uncertainty in moving objects databases. In Proc. the 8th Int. Conf. Extending Database Technology, Prague, Czech, Mar. 25-27, 2002, pp.233–250.Google Scholar
  7. [7]
    Trajcevski G. Probabilistic range queries in moving objects databases with uncertainty. In Proc. MobiDE 2003, San Diego, USA, Sept. 19, 2003, pp.39–45.Google Scholar
  8. [8]
    Cheng R, Kalashnikov D V, Prabhakar S. Querying imprecise data in moving object environments. IEEE Transactions on Knowledge and Data Engineering, 2004, 16(9): 1112–1127.CrossRefGoogle Scholar
  9. [9]
    Chung B, Lee W C, Chen A L P. Processing probabilistic spatio-temporal range queries over moving objects with uncertainty. In Proc. the 12th Int. Conf. Extending Database Technology, Saint Petersburg, Russia, Mar. 24-26, 2009, pp.60–71.Google Scholar
  10. [10]
    Chen J C, Cheng R. Efficient evaluation of imprecise location- dependent queries. In Proc. the 23rd Int. Conf. Data Engineering, Istanbul, Turkey, Apr. 15-20, 2007, pp.586–589.Google Scholar
  11. [11]
    Ishikawa Y, Iijima Y, Yu X J. Spatial range querying for Gaussian-based imprecise query objects. In Proc. the 2009 IEEE Int. Conf. Data Engineering, Shanghai, China, Mar. 29-Apr. 2, 2009, pp.676–687.Google Scholar
  12. [12]
    Tao Y, Xiao X, Cheng R. Range search on multidimensional uncertain data. ACM TODS, 2007, 32(3): 1–54.CrossRefGoogle Scholar
  13. [13]
    Ku W S, Zimmermann R, Peng W C et al. Privacy protected query processing on spatial networks. In Proc. the 23rd Int. Conf. Data Engineering, Istanbul, Turkey, Apr. 15-20, 2007, pp.215–220.Google Scholar
  14. [14]
    Bordogna G, Pagani G, Pasi G, Psaila G. Evaluating uncertain location-based spatial queries. In Proc. the 2008 ACM Symp. Applied Computing, Fortaleza, Brazil, Mar. 16-20, 2008, pp.1095–1100.Google Scholar
  15. [15]
    Berg M D, Kreveld M V et al. Algorithms and Application of Computational Geometry, 2nd Edition, Beijing: Tsinghua University Press, 2005.Google Scholar
  16. [16]
    Tao Y, Cheng R, Xiao X, Ngai W K, Kao B, Prabhakar S. Indexing multi-dimensional uncertain data with arbitrary probability density functions. In Proc. the 31st Int. Conf. Very Large Data Bases, Trondheim, Norway, 2005, pp.922–933.Google Scholar
  17. [17]
    Saltenis S, Jensen C S, Leutenegger S T, Lopez M A. Indexing the positions of continuously moving objects. ACM SIGMOD Record, 2000, 29(2): 331–342.CrossRefGoogle Scholar
  18. [18]
    Lian X, Chen L. Probabilistic group nearest neighbor queries in uncertain databases. TKDE, 2008, 20(6): 809–824.Google Scholar
  19. [19]
    Brinkhoff T. A framework for generating network-based moving objects. GeoInformatica, 2002, 6(2): 153–180.MATHCrossRefGoogle Scholar
  20. [20]
    Ding Z, Güting R H. Uncertainty management for network constrained moving objects. In Proc. the 15th Int. Conf. Database and Expert Systems Applications, Zaragoza, Spain, 2004, pp.411–421.Google Scholar
  21. [21]
    Chen J, Meng X. Indexing future trajectories of moving objects in a constrained network. Journal of Computer Science and Technology, 2007, 22(2): 245–251.CrossRefGoogle Scholar

Copyright information

© Springer 2010

Authors and Affiliations

  1. 1.College of Information Science and TechnologyNanjing University of Aeronautics and AstronauticsNanjingChina
  2. 2.College of Information and ControlNanjing University of Information Science and TechnologyNanjingChina

Personalised recommendations