The Collective Trip Planning Query Processing Using G-Tree Index Structure

TLDR: This work proposes an effective query processing method for the CTP query using G-tree index structure on a road network, and shows that the proposed method can be obtained the optimal query result without being affected the limitations or constraints of the previous studies.

Abstract: Since the sharing economy is defined as economic model based on combination of social relationships, many related services of sharing economy have emerged. Among these services, the location based ride sharing services have been the most common. We discuss a collective trip planning (CTP) query that minimizes the overall cost, one of the problems addressed in ride sharing services. The CTP query finds a meeting point that minimizes the overall cost to pick up passengers. Although many researches related to the CTP query have been conducted, there is a problem that the query performance is effective only in a specific situation. Therefore, we propose an effective query processing method for the CTP query using G-tree index structure on a road network. Furthermore, We analyze the limitations of the previous researches, and show that the proposed method can be obtained the optimal query result without being affected the limitations or constraints of the previous studies.