Efficiently Evaluating Range-Constrained Spatial Keyword Query on Road Networks

Author(s):  
Wengen Li ◽  
Jihong Guan ◽  
Shuigeng Zhou
Author(s):  
Hailin Fang ◽  
Pengpeng Zhao ◽  
Victor S. Sheng ◽  
Jian Wu ◽  
Jiajie Xu ◽  
...  

Author(s):  
Xiaopeng Kuang ◽  
Pengpeng Zhao ◽  
Victor S. Sheng ◽  
Jian Wu ◽  
Zhixu Li ◽  
...  

2016 ◽  
Vol 17 (2) ◽  
pp. 469-480 ◽  
Author(s):  
Yunjun Gao ◽  
Jingwen Zhao ◽  
Baihua Zheng ◽  
Gang Chen

Sensors ◽  
2020 ◽  
Vol 20 (3) ◽  
pp. 798
Author(s):  
Muhammad Attique ◽  
Muhammad Afzal ◽  
Farman Ali ◽  
Irfan Mehmood ◽  
Muhammad Fazal Ijaz ◽  
...  

The rapid growth of GPS-enabled mobile devices has popularized many location-based applications. Spatial keyword search which finds objects of interest by considering both spatial locations and textual descriptions has become very useful in these applications. The recent integration of social data with spatial keyword search opens a new service horizon for users. Few previous studies have proposed methods to combine spatial keyword queries with social data in Euclidean space. However, most real-world applications constrain the distance between query location and data objects by a road network, where distance between two points is defined by the shortest connecting path. This paper proposes geo-social top-k keyword queries and geo-social skyline keyword queries on road networks. Both queries enrich traditional spatial keyword query semantics by incorporating social relevance component. We formalize the proposed query types and appropriate indexing frameworks and algorithms to efficiently process them. The effectiveness and efficiency of the proposed approaches are evaluated using real datasets.


Author(s):  
Hermann B. Ekomie ◽  
Kai Yao ◽  
Jianjun Li ◽  
Guohui Li ◽  
Yanhong Li

2018 ◽  
Vol 430-431 ◽  
pp. 17-38 ◽  
Author(s):  
Yanhong Li ◽  
Guohui Li ◽  
Jianjun Li ◽  
Kai Yao

Dwelling in the information age permits nearly everybody needs to recover countless information and choices to gather from to fulfill their necessities. In distinctive cases, the quantity of information accessible and the speed of change may cover the ideal and required explanation. Spatial-textual queries provide the most acclaimed nearest points concerning a conveyed site and a keyword set. Current practice regularly thought on the most capable technique to expertly get the top-k resultset reestablished a spatial-scholarly query. A capable Spatial Range Skyline Query (SRSQ) algorithm is proposed which initially performsa spatial keyword query (SKQ) that relies upon an IRtree that documents the information. Skyline centers picked are not simply established on their partitions to a lot of inquiries and more subject to their significance to a social occasion of query keywords. Additionally, besides proposed range skyline (RS) methods based on R-tree multi-dimensional space including secondary- memory pruning tools for operating field skyline queries is accomplished. The advanced scheme is dynamic and I/O optimum. Ultimately, methodology presents a modern assessment that demonstrates the proficiency.


Sign in / Sign up

Export Citation Format

Share Document