In this paper, we propose an edge-based shortest path cache that can efficiently handle large-scale path queries without needing any road information. We achieve this by designing a totally new edge-based path cache structure, an efficient R-tree-based cache lookup algorithm, and a greedy-based cache construction algorithm. Experiments on a real road network and real POI datasets are conducted, and the results show the efficiency of our proposed caching techniques.
CITATION STYLE
Zhang, D., Liu, A., Jin, G., & Li, Q. (2019). Edge-Based Shortest Path Caching in Road Networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11448 LNCS, pp. 411–414). Springer Verlag. https://doi.org/10.1007/978-3-030-18590-9_56
Mendeley helps you to discover research relevant for your work.