Edge-Based Shortest Path Caching in Road Networks

被引:0
|
作者
Zhang, Detian [1 ]
Liu, An [1 ]
Jin, Gaoming [1 ]
Li, Qing [2 ]
机构
[1] Soochow Univ, Sch Comp Sci & Technol, Inst Artificial Intelligence, Suzhou, Peoples R China
[2] Hong Kong Polytech Univ, Dept Comp, Kowloon, Hong Kong, Peoples R China
来源
基金
中国国家自然科学基金;
关键词
Shortest path queries; Path cache; Large-scale;
D O I
10.1007/978-3-030-18590-9_56
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:411 / 414
页数:4
相关论文
共 50 条
  • [1] Edge-Based Shortest Path Caching for Location-Based Services
    Zhang, Detian
    Liu, An
    Jin, Gaoming
    Li, Qing
    [J]. 2019 IEEE INTERNATIONAL CONFERENCE ON WEB SERVICES (IEEE ICWS 2019), 2019, : 320 - 327
  • [2] Calculating shortest path on edge-based data structure of graph
    Chen, Guilin
    Pang, Mingyong
    Wang, Jidong
    [J]. SECOND WORKSHOP ON DIGITAL MEDIA AND ITS APPLICATION IN MUSEUM & HERITAGE, PROCEEDINGS, 2007, : 416 - 421
  • [3] RimJump: Edge-based Shortest Path Planning for a 2D Map
    Yao, Zhuo
    Zhang, Weimin
    Shi, Yongliang
    Li, Mingzhu
    Liang, Zhenshuo
    Li, Fangxing
    Huang, Qiang
    [J]. ROBOTICA, 2019, 37 (04) : 641 - 655
  • [4] Shortest Path Solution to Wireless Sensor Networks Using Edge-Based Three-Point Steiner Tree Concept
    Sundar, S.
    Balakrishnan, V.
    Kumar, R.
    Kittur, Harish M.
    [J]. WIRELESS COMMUNICATION NETWORKS AND INTERNET OF THINGS, VOL VI, 2019, 493 : 51 - 67
  • [5] Cost-Driven Data Caching in Edge-Based Content Delivery Networks
    Wang, Yang
    Dai, Hao
    Han, Xinxin
    Wang, Pengfei
    Zhang, Yong
    Xu, Chengzhong
    [J]. IEEE TRANSACTIONS ON MOBILE COMPUTING, 2023, 22 (03) : 1384 - 1400
  • [6] Shortest path calculation in large road networks
    Ertl, G
    [J]. OR SPEKTRUM, 1998, 20 (01) : 15 - 20
  • [7] Shortest path calculation in large road networks
    Ertl G.
    [J]. Operations-Research-Spektrum, 1998, 20 (1) : 15 - 20
  • [8] Refreshment Strategies for the Shortest Path Caching Problem with Changing Edge Weight
    Li, Xiaohua
    Qiu, Tao
    Yang, Xiaochun
    Wang, Bin
    Yu, Ge
    [J]. WEB TECHNOLOGIES AND APPLICATIONS, APWEB 2014, 2014, 8709 : 331 - 342
  • [9] Shortest-Path-Based Resilience Analysis of Urban Road Networks
    Kaub, David
    Lohr, Christian
    David, Anelyse Reis
    Das Chandan, Monotosch Kumar
    Chanekar, Hilal
    Tung Nguyen
    Berndt, Jan Ole
    Timm, Ingo J.
    [J]. DYNAMICS IN LOGISTICS, LDIC 2024, 2024, : 132 - 143
  • [10] Projecting vector-based road networks with a shortest path algorithm
    Anderson, AE
    Nelson, J
    [J]. CANADIAN JOURNAL OF FOREST RESEARCH, 2004, 34 (07) : 1444 - 1457