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

Time-based keyword road network path planning

为了便于道路网距离的计算、对象文本信息和时间信息的组织和快速获取,改进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.