ORDER: Optimal Routing with Path Indexing in Exchange Graph [Data-Intensive & Data Science Application]
Summary: ORDER optimizes size-aware routing across liquidity-fragmented exchange graphs using a hierarchical bucket path index, lazy updates, and adaptive bucket sizing. It avoids global rescans and delivers up to 114× faster DeFi routing without sacrificing execution quality. (summarized by gpt-5.6-luna on Jul 26 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Bingqiao Luo (National University of Singapore)
- 2. Yuhang Chen (National University of Singapore)
- 3. Yuheng Cong (Shanghai Jiao Tong University)
- 4. Ziyu He (Shanghai Jiao Tong University)
- 5. Jiaxin Jiang (National University of Singapore)
- 6. Shixuan Sun (Shanghai Jiao Tong University)
- 7. Bingsheng He (National University of Singapore)
- 8. Wee Howe Ang (Tokka Labs)
BibTeX Citation
@inproceedings{luo_sigmod26,
title = {{ORDER: Optimal Routing with Path Indexing in Exchange Graph [Data-Intensive \& Data Science Application]}},
author = {Luo, Bingqiao and Chen, Yuhang and Cong, Yuheng and He, Ziyu and Jiang, Jiaxin and Sun, Shixuan and He, Bingsheng and Ang, Wee Howe},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3802097},
url = {https://dl.acm.org/doi/10.1145/3802097},
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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,205 | Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice | 2013 | SIGMOD | 0.00011664469 |
| 5,678 | Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement | 2022 | VLDB | 6.1246854e-05 |
| 10,683 | Bursting Flow Query on Large Temporal Flow Networks | 2025 | SIGMOD | 5.093636e-05 |
| 10,963 | RICH: Real-time Identification of negative Cycles for High-efficiency Arbitrage | 2025 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,251 | Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions | 2011 | VLDB |
| 2 | 4,807 | Diversified Top-k Route Planning in Road Network | 2022 | VLDB |
| 3 | 1,796 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD |
| 4 | 4,289 | Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs | 2016 | SIGMOD |
| 5 | 10,478 | Order-based Algorithms for Efficient Core Maintenance in Large Bipartite Graphs | 2026 | SIGMOD |
| 6 | 10,356 | DAG of DAGs: Order-Fairness Made Practical | 2026 | SIGMOD |
| 7 | 2,097 | Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees | 2020 | VLDB |
| 8 | 1,511 | Speedup Graph Processing by Graph Ordering | 2016 | SIGMOD |
| 9 | 10,963 | RICH: Real-time Identification of negative Cycles for High-efficiency Arbitrage | 2025 | VLDB |
| 10 | 352 | On Graph Query Optimization in Large Networks | 2010 | VLDB |