Handling location uncertainty in probabilistic location-dependent queries

被引:4
作者
Bernad, Jorge [1 ]
Bobed, Carlos [1 ]
Ilarri, Sergio [1 ]
Mena, Eduardo [1 ]
机构
[1] Univ Zaragoza, Dept Comp Sci & Syst Engn, Zaragoza 50018, Spain
关键词
Probabilistic range queries; Location-dependent queries; Uncertainty management; NEAREST-NEIGHBOR QUERIES; EFFICIENT;
D O I
10.1016/j.ins.2017.01.029
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Location-based services have motivated intensive research in the field of mobile computing, and particularly on location-dependent queries. Existing approaches usually assume that the location data are expressed at a fine geographic precision (physical coordinates such as GPS). However, many positioning mechanisms are subject to an inherent imprecision (e.g., the cell-id mechanism used in cellular networks can only determine the cell where a certain moving object is located). Moreover, even a GPS location can be subject to an error or be obfuscated for privacy reasons. Thus, moving objects can be considered to be associated not to an exact location, but to an uncertainty area where they can be located. In this paper, we analyze the problem introduced by the imprecision of the location data available in the data sources by modeling them using uncertainty areas. To do so, we propose to use a higher-level representation of locations which includes uncertainty, formalizing the concept of uncertainty location granule. This allows us to consider probabilistic location-dependent queries, among which we will focus on probabilistic inside (range) constraints. The adopted model allows us to develop a systematic and efficient approach for processing this kind of queries. An experimental evaluation shows that these probabilistic queries can be supported efficiently. (C) 2017 Elsevier Inc. All rights reserved.
引用
收藏
页码:154 / 171
页数:18
相关论文
共 45 条
  • [1] Indexing Uncertain Data in General Metric Spaces
    Angiulli, Fabrizio
    Fassetti, Fabio
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2012, 24 (09) : 1640 - 1657
  • [2] [Anonymous], 2011, EDBT
  • [3] [Anonymous], 2004, Location-Based Services
  • [4] [Anonymous], 2003, Proc. of the ACM SIGMOD International Conference on Management of Data, DOI DOI 10.1145/872757
  • [5] The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree
    Arge, Lars
    De Berg, Mark
    Haverkort, Herman
    Yi, Ke
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2008, 4 (01)
  • [6] Efficiently managing location information with privacy requirements in Wi-Fi networks: a middleware approach
    Bellavista, P
    Corradi, A
    Giannelli, C
    [J]. 2ND INTERNATIONAL SYMPOSIUM ON WIRELESS COMMUNICATIONS SYSTEMS 2005 (ISWCS 2005), 2005, : 91 - 95
  • [7] Belussi A., 2009, P 2009 INT DATABASE, P275
  • [8] Bemad J., 2013, INT J GEOGR INF SCI, V27, P1090
  • [9] Bernecker T, 2011, PROC INT CONF DATA, P339, DOI 10.1109/ICDE.2011.5767908
  • [10] Efficient Search for the Top-k Probable Nearest Neighbors in Uncertain Databases
    Beskales, George
    Soliman, Mohamed A.
    Ilyas, Ihab F.
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2008, 1 (01): : 326 - 339