摘要
为了解决路网中考虑偏好的空间文本对象多目标最短路径查询问题,设计了包含属性的IR树索引结构;然后利用类别约束,排序约束构建限定的有向无环图.提出了支持属性的局部贪婪算法SALG_SPG,以对最短路径查询进行处理;为进一步提高查询处理效率,提出了支持属性的全局优化算法SAGO_SPG,该算法利用阈值和缓存机制减少了大量无效、重复的计算;最后,通过与现有的FEBF算法的对比实验,分析并验证了所提算法的高效性.
In order to solve the problem of multi-objective shortest path queries of spatial-textual objects considering preference in the road network,an IR tree index structure including attributes is designed;then a restricted directed acyclic graph is constructed by using category constraints and sorting constraints.A local greedy algorithm SALG_SPG supporting attributes is proposed to process the shortest path query.To further improve the query processing efficiency,a global optimal algorithm supporting attributes called SAGO_SPG is proposed.The algorithm uses the threshold and caching mechanism to reduce a large number of invalid and repeated calculations.Finally,the efficiency of the proposed algorithm is analyzed and verified through a comparative experiment with the existing FEBF algorithm.
作者
李艳红
毛德权
欧昱宏
曹阳
LI Yanhong;MAO Dequan;OU Yuhong;CAO Yang(College of Computer Science,South-Central Minzu University,Wuhan 430074,China)
出处
《中南民族大学学报（自然科学版）》
CAS
2024年第5期642-649,共8页
Journal of South-Central University for Nationalities：Natural Science Edition
基金
湖北省自然科学基金资助项目(2017CFB135)
中央高校基本科研业务费专项资金资助项目(CZY23019)。
关键词
最短路径
路网
空间文本对象
排序约束
偏好约束
shortest path
road network
spatial-textual object
ordering constraint
preference constraint
