基于时间的关键字路网路径规划  

Time-based keyword road network path planning

作　　者：卢航 李艳红[1] 黄金亮 LU Hang;LI Yanhong;HUANG Jinliang(College of Computer Science,South-Central Minzu University,Wuhan 430074,China)

机构地区：[1]中南民族大学计算机科学学院,武汉430074

出　　处：《中南民族大学学报（自然科学版）》2024年第2期201-208,共8页Journal of South-Central University for Nationalities：Natural Science Edition

基　　金：国家自然科学基金资助项目(61309002);湖北省自然科学基金资助项目(2017CFB135);中央高校基本科研业务费专项资金资助项目(CZY23019)。

摘　　要：为了便于道路网距离的计算、对象文本信息和时间信息的组织和快速获取,改进G-Tree,在索引结构上增加时间戳和倒排序列相关信息,称包含时间戳和倒排序列相关信息的G-Tree为IGT-Tree.并基于构建的IGT-Tree设计了两种推荐算法:一种是基于时间的目标点查询算法,另一种是在目标点查询算法基础上的路径推荐算法.最后,在基于时间的关键字路网通过实验对比G-Tree的算法验证了所提算法的高效性.In order to facilitate the calculation of road network distance,the organization and rapid acquisition of object text information and time information,improve G-Tree to add timestamp and inverted sequence related information to the index structure,and call G-Tree containing timestamp and inverted sequence related information as IGT-Tree,two recommendation algorithms are designed,one is a time-based target point query algorithm,and the other is a path recommendation algorithm based on the target point query algorithm.Finally,the efficiency of the proposed algorithm is verified by comparing the G-Tree algorithm in the time-based keyword road network.

关 键 词：道路网络 时空数据库 关键词搜索 路径规划 索引 

分 类 号：TP399[自动化与计算机技术—计算机应用技术]