DBScholar

Back to papers

Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks

Summary: TD-TNR-CH: a 4‑hop transit-node index for time‑dependent road networks that maps nodes to nearest transit (critical) nodes and precomputes candidate tables to answer medium/long TD‑MTTQs (short trips via TCH local search). Up to 103× faster queries and ~30 min parallel preprocessing. (summarized by gpt-5-mini on Feb 11 2026)

Paper ID
7587
Venue
SIGMOD
Year
2026
Pagerank
5.093636e-05
Overall Rank
10,379 | 28.80%
DOI
10.1145/3769801

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{yu_sigmod26,
        title = {{Hops Can be Constrained: Efficient Distance Queries on Large Time-Dependent Road Networks}},
        author = {Yu, Weihao and Ouyang, Dian and Zhang, Fan and Zhao, Xiang and Su, Shen and Lin, Xuemin and Tian, Zhihong},
        series = {{SIGMOD} '26},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3769801},
        url = {https://dl.acm.org/doi/10.1145/3769801},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers