When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks

Authors

• 1. Dian Ouyang (University of Technology Sydney)
• 2. Lu Qin (University of Technology Sydney)
• 3. Lijun Chang (University of Sydney)
• 4. Xuemin Lin (University of New South Wales)
• 5. Ying Zhang (University of Technology Sydney)
• 6. Qing Zhu (Renmin University of China)

@inproceedings{ouyang_sigmod18,
        title = {{When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks}},
        author = {Ouyang, Dian and Qin, Lu and Chang, Lijun and Lin, Xuemin and Zhang, Ying and Zhu, Qing},
        series = {{SIGMOD} '18},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3183713.3196913},
        url = {https://dl.acm.org/doi/10.1145/3183713.3196913},
        year = {2018}
}

Incoming Citations (Sorted by Pagerank)

Showing 35 of 35 citing papers.

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

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

Semantically Similar Papers