Top-k Sequenced Route Queries
Top-k Sequenced Route Queries
复制标题
DOI：
10.1109/mdm.2017.51
复制
发表时间：
2017-05
期刊：
影响因子：
--
通讯作者：
Y. Ohsawa;H. Htoo
中科院分区：
文献类型：
--
作者：
Y. Ohsawa;H. Htoo
给定当前点、最终目的地和行程中的访问数据点类别，顺序路线查询将查找满足查询条件的最短路线。针对这一问题，已经提出了几种算法。在真实的应用中使用该查询时，访问点（例如，餐馆、购物中心等）的受欢迎程度除了路线的长度之外，在旅行中也很重要。因此，需要一种通过长度和受欢迎程度等多个标准来评估好坏的推荐查询方法。这种类型的查询被称为Top-k查询。针对顺序路由查询，提出了一种快速Top-k查询方法。
Given a current point, a final destination, and visiting data point categories on a trip, a sequenced route query finds the shortest route which meets the query condition. Several algorithms have been proposed targeting to this query. When this query is used in real applications, the popularity of the visiting points (for example, restaurant, shopping center, etc.) in a trip are also important besides the length of the route. Therefore, a recommendation query method that evaluates the goodness by multiple criteria, such as the length and the popularity, is requested. This type of queries has been called Top-k query. This paper proposes a fast Top-k query method targeting to sequenced route queries.