中南民族大学学报（自然科学版）2026，Vol.45Issue(5)：683-696,14.DOI:10.20056/j.cnki.ZNMDZK.20260712
基于空间关键词的Top-k最优路径加速查询框架
An accelerated query framework for Top-k optimal paths with spatial keywords
摘要
Abstract
To address the high computational complexity in spatial keyword path queries,an efficient Top-k Optimal Path Acceleration Query(OPAQ)framework is proposed.Given a user-specified start point,end point,and a set of spatial keywords,the framework returns k optimal paths that satisfy all keyword constraints.To improve query efficiency,OPAQ introduces several key optimization strategies:constructing a point of interest(POI)subgraph to eliminate irrelevant vertices and reduce the search space;building an LG-Tree to support fast shortest distance queries between arbitrary node pairs;designing an SP-Tree to share path prefix information;and applying heuristic deviate search strategy to efficiently discover paths that cover the remaining keywords.Additionally,it defines the formal conditions for path validity and proposes an efficient path expansion method that combines the shared prefix structure and heuristic strategies to support the rapid generation of Top-k path results.Finally,experiments are conducted on multiple real-world datasets to verify the superior performance of the OPAQ framework.It outperformed existing mainstream algorithms in both query time and path quality,especially demonstrating excellent efficiency and extensibility in Top-k queries.关键词
空间关键词/最优路径查询/加速查询框架/LG-树/SP-树Key words
spatial keywords/optimal path query/OPAQ framework/LG-Tree/SP-Tree分类
信息技术与安全科学引用本文复制引用
张天钰,李艳红,肖梦,王佳佳..基于空间关键词的Top-k最优路径加速查询框架[J].中南民族大学学报（自然科学版）,2026,45(5):683-696,14.基金项目
湖北省自然科学基金资助项目(2017CFB135) （2017CFB135）
中央高校基本科研业务费专项资金资助项目(CZY23019) （CZY23019）
网络创新及应用型人才课程实践教学研究项目(2019年第一批) （2019年第一批）
