Efficient methods for finding an optimal network location for travel planning
- 주제(키워드) 도움말 Spatial databases , Trip planning query , G-tree , Optimal location query , Optimal meeting point
- 발행기관 SPRINGER
- 발행년도 2021
- 총서유형 Journal
- 본문언어 영어
초록/요약 도움말
In this paper, we describe an optimal network location for travel planning (ONLTP) query, a type of optimal location query. In trip planning, finding the optimal point for a group of users is a fundamental problem in spatial group query processing. Many previous studies have considered the problem of finding the optimal point. However, their queries using an exact method perform efficiently only when the users are closely distributed, not spread out in large road networks. In contrast, approximation methods use two different spatial indices, but they cannot control the trade-off between query performance and accuracy. We propose a method using G-trees [1, 2] to remedy these drawbacks. Our exact method is a concrete implementation of the best-first search in G-trees, and our approximation method further reduces the visited nodes of the exact method.
more