考虑可达性的Top-k空间关键字查询
Top-k Spatial Keyword Query based on Reachability
投稿时间:2022-06-07  修订日期:2022-06-07
DOI:
中文关键词: 可达性  空间关键字查询  路网  轨迹数据
英文关键词: reachability  spatial keyword query  road network  trajectory data
基金项目:
作者单位邮编
任佳宇 中南民族大学计算机科学学院 
李艳红 中南民族大学计算机科学学院 430000
摘要点击次数: 71
全文下载次数: 0
中文摘要:
      空间关键字查询(SKQ)是时空数据库领域的研究热点,查询同时考虑查询点与空间-文本对象之间的空间邻近度和文本相似性,这一技术在现实生活中的应用非常广泛.为了更好地满足用户的个性化需求,提高空间关键字查询的精确性和实时性,本文提出了考虑可达性的Top-k空间关键字查询(RSKQ).该查询返回满足可达性和查询关键字约束、考虑查询和对象之间的空间邻近度、文本相似性和可达性的综合得分最优的k个对象.本文首先基于真实的路网信息和历史轨迹数据建立综合索引结构SRTR-Tree,设计有效的算法计算由查询点到空间-文本对象的可达概率并进行RSKQ查询处理;其次设计了三种剪枝技术加快查询处理的速度,返回k个满足要求的最优结果;最后通过实验验证算法的有效性.
英文摘要:
      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 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 spatial keyword query results, we propose the Top-k spatial keyword query based on reachability (RSKQ).The query returns k objects whose reachability is higher than the user""s specified value, meets the query keyword requirements, and integrates the best scores of text similarity, spatial proximity and reachability. Firstly, based on the real historical trajectory data and road network information, we establish an index and designs effective algorithms to calculate the accessibility Probability from the query to spatio-textual objects. Moreover, three pruning techniques are designed to speed up query processing and return k optimal results that meet query requirements. Finally, the effectiveness of the algorithm is verified by experiments.
View Fulltext   查看/发表评论  下载PDF阅读器
关闭