| Title: |
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks |
| Article URLs: |
|
| Alternative Article URLs: |
|
| Authors: |
Dian Ouyang |
-
University of Technology, CAI, FEIT
|
| Lu Qin |
-
University of Technology, CAI, FEIT
|
| Lijun Chang |
|
| Xuemin Lin |
-
The University of New South Wales
|
| Ying Zhang |
-
University of Technology, CAI, FEIT
|
| Qing Zhu |
-
Renmin University of China, School of Information
|
| Sharing: |
Unknown
|
| Verification: |
Authors have
not verified
information
|
| Artifact Evaluation Badge: |
none
|
| Artifact URLs: |
|
| Artifact Correspondence Email Addresses: |
|
| NSF Award Numbers: |
|
| DBLP Key: |
conf/sigmod/OuyangQCLZZ18
|
| Author Comments: |
|