基于时间感知的动态组旅行查询

Dynamic group travel query based on time perception

小组旅行规划(GTP)查询是空间数据库领域的一个热点研究问题,迄今为止已有不少研究成果.但目前尚无人考虑行程中新成员加入或现有成员离开的问题,也没有在行程规划中考虑兴趣点与查询需求的时间匹配问题.为了解决这个问题,把两者相结合,提出了时间感知的动态组旅行规划查询(TDGTP)问题,该查询包含一组空间分散、动态变化的成员,返回满足该组成员的多个兴趣需求的一组对象及所规划的最佳路径.首先,基于真实的Euclidean空间,设计了一个包含空间文本和时间信息的综合索引TIR-Tree,利用TIR-Tree对空间文本和时间进行剪枝,以此来筛选出所有符合约束条件的兴趣点集;其次利用椭圆的性质,规划出ESRA算法对兴趣点区域剪枝,进一步筛选满足小组成员要求的兴趣点集;然后对兴趣点集使用BestTD算法进行最短路径查询,返回满足该组行程的最佳旅行距离;最后通过大量实验验证了所提出的解决方法的有效性.

Group travel planning(GTP)query is a hot research topic in the field of spatial databases,and many research results have been achieved so far.However,no one has considered the joining of new members or the leaving of existing members in the itinerary,nor has the time matching between points of interest and query demands been considered in the itinerary planning.In order to solve these problems,combining the two aspects,a time-aware dynamic group travel planning query(TDGTP)problem is proposed.The query includes a group of spatially dispersed and dynamically changing members,and returns a group of objects that satisfy the multiple interest requirements of the group of members and the planned optimal path.Firstly,based on the real Euclidean space,a comprehensive index TIR-Tree containing spatial text and time information is designed,and TIR-Tree is used to prune the spatial text and time,so as to filter out all the set of interest points that meet the constraints.Then using the properties of ellipse,ESRA(Elliptic Search Refinement Algorithm)algorithm is planned to prune the interest point area,and further filter the interest point set that meets the requirements of group members.Secondly,the BestTD(Best Time Dynamic)algorithm is used to query the shortest path of the interest point set,returns the optimal travel distance that satisfies the group of itineraries.Finally,the effectiveness of the solution proposed in this paper is verified through a large number of experiments.