High Throughput Shortest Distance Query Processing on Large Dynamic Road Networks
<|reference_start|>High Throughput Shortest Distance Query Processing on Large Dynamic Road Networks: Shortest path (SP) computation is the building block for many location-based services, and achieving high throughput SP query processing is an essential goal for the real-time response of those services. However, the large number of queries submitted in large-scale dynamic road networks still poses challenges to this goal. Therefore, in this work, we propose a novel framework aiming to process SP queries with high throughput in large and dynamic road networks, by leveraging the Partitioned Shortest Path (PSP) index. Specifically, we first put forward a cross-boundary strategy to accelerate the query processing of PSP index and analyze its efficiency upper-bound by discovering the curse of PSP index query efficiency. After that, we propose a non-trivial Partitioned Multi-stage Hub Labeling (PMHL) that utilizes multiple PSP strategies and thread parallelization to achieve consecutive query efficiency improvement and fast index maintenance. Finally, to further increase query throughput, we design tree decomposition-based graph partitioning and propose Post-partitioned Multi-stage Hub Labeling (PostMHL) with faster query processing and index update than PMHL. Experiments on real-world road networks show that our methods outperform state-of-the-art baselines in query throughput, yielding up to 1-4 orders of magnitude improvement.<|reference_end|>
@article{zhou2024high,
    title={High Throughput Shortest Distance Query Processing on Large Dynamic Road
  Networks},
    author={Xinjie Zhou, Mengxuan Zhang, Lei Li, Xiaofang Zhou},
    journal={arXiv preprint arXiv:2409.06148},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.06148},
    primaryClass={cs.DB}
}