Edge-Based Shortest Path Caching in Road Networks

Detian Zhang, An Liu, Gaoming Jin, Qing Li

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationDatabase Systems for Advanced Applications - DASFAA 2019 International Workshops
Subtitle of host publicationBDMS, BDQM, and GDMA, Proceedings
EditorsGuoliang Li, Jun Yang, Joao Gama, Juggapong Natwichai, Yongxin Tong
PublisherSpringer-Verlag
Pages411-414
Number of pages4
ISBN (Print)9783030185893
DOIs
Publication statusPublished - 1 Jan 2019
Event24th International Conference on Database Systems for Advanced Applications, DASFAA 2019 - Chiang Mai, Thailand
Duration: 22 Apr 201925 Apr 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11448 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference24th International Conference on Database Systems for Advanced Applications, DASFAA 2019
CountryThailand
CityChiang Mai
Period22/04/1925/04/19

Keywords

  • Large-scale
  • Path cache
  • Shortest path queries

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this