Name
Abstract | ||
|---|---|---|
Computing the shortest path distances between two vertices on road networks is a core operation in many real-world applications, e.g., finding the closest taxi/hotel. However existing techniques have several limitations. First, traditional Dijkstra-based methods have long latency and cannot meet the high-performance requirement. Second, existing indexing-based methods either involve huge index siz... |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/ICDE51399.2021.00038 | 2021 IEEE 37th International Conference on Data Engineering (ICDE) |
Keywords | DocType | ISSN |
Road Network Embedding,Shortest Path,Hierarchical Model | Conference | 1084-4627 |
ISBN | Citations | PageRank |
978-1-7281-9184-3 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shuai Huang | 1 | 0 | 0.34 |
| Yong Wang | 2 | 275 | 92.19 |
| Tianyu Zhao | 3 | 17 | 3.06 |
| Guoliang Li | 4 | 3077 | 154.70 |