Spatial Keyword Query based on Nearest Neighbor Constraint in Road Networks
ZHANG Zhiwei1, BAO Jinling2, CUI Meiqi2
1. School of Information and Control Engineering , Jilin Institute of Chemical Technology, Jilin132022, China
2. School of Computer Science,Baicheng Normal University ,Baicheng Jilin 137000 , China
Abstract: With the rapid development of wireless communication technologies and the increasing prevalence of smart mobile devices, location-based services have been widely applied. In recent years, keyword related location queries have become one of the hot research topics. For example, given a query point q and a set of keywords T, the query returns the data object point that contains all keywords and is closest to the query point q. For spatial keyword queries with nearest neighbor constraints in such road network, the road network is first partitioned, and then an STG-Tree index structure is constructed based on G-tree. Then, invalid data object points are pruned with the shortest distance between subgraphs as the lower bound, and an effective query algorithm is proposed. Finally, the query performance of the algorithm is verified through a large number of experimental experiments.
张志威, 鲍金玲, 崔美琪. 路网环境下基于最近邻约束的空间关键字查询[J]. 吉林化工学院学报, 2025, 42(3): 44-49.
ZHANG Zhiwei, BAO Jinling, CUI Meiqi. Spatial Keyword Query based on Nearest Neighbor Constraint in Road Networks. Journal of Jilin Institute of Chemical Technology, 2025, 42(3): 44-49.
