Efficient reverse spatial and textual k nearest neighbor queries on road networks

被引:17
|
作者
Luo, Changyin [1 ]
Li Junlin [2 ]
Li, Guohui [1 ]
Wei, Wei [1 ]
Li, Yanhong [3 ]
Li, Jianjun [1 ]
机构
[1] Huazhong Univ Sci & Technol, Sch Comp Sci & Technol, Wuhan 430074, Peoples R China
[2] Wuhan Digital Engn Inst, Wuhan, Peoples R China
[3] South Cent Univ Nationalities, Dept Comp Sci, Wuhan, Peoples R China
基金
中国国家自然科学基金;
关键词
Spatial keyword query; Reverse k nearest neighbor; Road network; Network voronoi diagram; KEYWORD SEARCH;
D O I
10.1016/j.knosys.2015.11.009
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The proliferation of geo-positioning technologies boosts the prevalence of GPS-enabled devices, and thus many spatial-textual objects that possess both text descriptions and geo-locations are extensively available in reality. Hence, how to efficiently exploit both spatial and textual description of objects to a spatial keyword query (SKQ) has increasingly become a challenging problem. Previous studies on SKQ problem usually focus on Euclidean space. In the real world, however, most of the spatial-textual objects lie on road networks. This paper takes the first step to investigate a novel problem, namely, reverse spatial and textual k nearest neighbor (RSTkNN) queries on road networks. We formalize the RSTkNN queries and present several spatial keyword pruning methods to accelerate the query processing. Then two effective verifying techniques are proposed, which can be seamlessly integrated into our RSTkNN query procedure. Finally, comprehensive experiments on real-world and synthetic data sets are conducted to demonstrate the performance of our approaches. (c) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:121 / 134
页数:14
相关论文
共 50 条
  • [21] Efficient Reverse Top-k Boolean Spatial Keyword Queries on Road Networks
    Gao, Yunjun
    Qin, Xu
    Zheng, Baihua
    Chen, Gang
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2015, 27 (05) : 1205 - 1218
  • [22] Nearest neighbor and reverse nearest neighbor queries for moving objects
    Benetis, R
    Jensen, CS
    Karciauskas, G
    Saltenis, S
    [J]. IDEAS 2002: INTERNATIONAL DATABASE ENGINEERING AND APPLICATIONS SYMPOSIUM, PROCEEDINGS, 2002, : 44 - 53
  • [23] Reverse k nearest neighbors queries and spatial reverse top-k queries
    Yang, Shiyu
    Cheema, Muhammad Aamir
    Lin, Xuemin
    Zhang, Ying
    Zhang, Wenjie
    [J]. VLDB JOURNAL, 2017, 26 (02): : 151 - 176
  • [24] Approximate Continuous K-Nearest Neighbor Queries for Uncertain Objects in Road Networks
    Li, Guohui
    Fan, Ping
    Yuan, Ling
    [J]. WEB-AGE INFORMATION MANAGEMENT, 2011, 6897 : 627 - 638
  • [25] Reverse k nearest neighbors queries and spatial reverse top-k queries
    Shiyu Yang
    Muhammad Aamir Cheema
    Xuemin Lin
    Ying Zhang
    Wenjie Zhang
    [J]. The VLDB Journal, 2017, 26 : 151 - 176
  • [26] Selectivity Estimation of Reverse k-Nearest Neighbor Queries
    Steinke, Michael
    Niedermayer, Johannes
    Kroeger, Peer
    [J]. DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, DASFAA 2014, PT II, 2014, 8422 : 108 - 123
  • [27] Privacy Preserving Reverse k-Nearest Neighbor Queries
    Pournajaf, Layla
    Tahmasebian, Farnaz
    Xiong, Li
    Sunderam, Vaidy
    Shahabi, Cyrus
    [J]. 2018 19TH IEEE INTERNATIONAL CONFERENCE ON MOBILE DATA MANAGEMENT (MDM 2018), 2018, : 177 - 186
  • [28] Continuous reverse k nearest neighbor monitoring on moving objects in road networks
    Li Guohui
    Li Yanhong
    Li Jianjun
    Shu, LihChyun
    Yang Fumin
    [J]. INFORMATION SYSTEMS, 2010, 35 (08) : 860 - 883
  • [29] Reverse Approximate Nearest Neighbor Queries
    Hidayat, Arif
    Yang, Shiyu
    Cheema, Muhammad Aamir
    Taniar, David
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2018, 30 (02) : 339 - 352
  • [30] Efficient k Nearest Neighbor queries on remote spatial databases using range estimation
    Liu, DZ
    Lim, EP
    Ng, WK
    [J]. 14TH INTERNATIONAL CONFERENCE ON SCIENTIFIC AND STATISTICAL DATABASE MANAGEMENT, PROCEEDINGS, 2002, : 121 - 130