中南民族大学学报（自然科学版）2022，Vol.41Issue(6)：740-748,9.DOI:10.20056/j.cnki.ZNMDZK.20220615
考虑可达性的Top-k空间关键词查询
Top-k spatial keyword query based on reachability
摘要
Abstract
Spatial keyword query（SKQ）is a research hotspot in the field of spatio-temporal databases and takes into account the spatial proximity and text similarity between the query and spatio-textual objects.This technology is widely used in real life. In order to better meet the personalized needs of users and improve the accuracy and real-time of the spatial keyword query，the Top-k spatial keyword query based on reachability（RSKQ）is proposed. Such query returns the k best objects that satisfy the reachability and query keyword constraints according to a comprehensive score，which considers the spatial proximity，text similarity，and reachability between the query and the object. Firstly，a comprehensive index named SRTR-Tree based on the real road network information and historical trajectory data is established and effective algorithms for calculating the reachable probability from the query to objects and processing RSKQ query are designed. Secondly， three pruning techniques are designed to speed up query processing and k optimal results that meet query requirements are returned. Finally，the effectiveness of the algorithm is verified by experiments.关键词
可达性/空间关键词查询/路网/轨迹数据Key words
reachability/spatial keyword query/road network/trajectory data分类
信息技术与安全科学引用本文复制引用
任佳宇,李艳红,冯雨..考虑可达性的Top-k空间关键词查询 [J].中南民族大学学报（自然科学版）,2022,41(6):740-748,9.基金项目
湖北省自然科学基金资助项目（2017CFB135）；中央高校基本科研业务费专项资金资助项目（CCNU18QN017， CZZ17003）；中南民族大学研究生学术创新基金资助项目 （）
