Research map / Architectures and efficiency / RNNs and normalization
EHL*: Memory-Budgeted Indexing for Ultrafast Optimal Euclidean Pathfinding
Jinchun Du, Bojie Shen, Muhammad Aamir Cheema
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| reduce EHL* memory budget from 80% to 20% of EHL-1 | EHL* · DAO (unknown queries) | query time (us): 2.02 -> 2.49 | No clear effect |
| reduce EHL* memory budget from 20% to 5% of EHL-1 | EHL* · DAO (unknown queries) | query time (us): 2.49 -> 4.40 | Hurt |
| use known query workload when merging (Cluster-2) at 5% budget (ablation) | EHL* · DAO | query time (us): 4.40 -> 1.15 | Improved |
| merge cells by hub-label similarity under budget instead of larger EHL cell size (EHL-4) | EHL*-20 · DAO (unknown queries) | query time (us): 3.19 -> 2.49 | Improved |
| increase number of query clusters from 2 to 8 at 5% budget | EHL*-5 · DAO | query time (us): 1.15 -> 2.00 | Hurt |
| build index with known workload when only 20% of queries match prediction (20% budget) (ablation) | EHL* (Known) · DA Cluster-8, 20% on-distribution queries | query time (us): 2.08 -> 3.09 | Hurt |
| build index with known workload when all queries match prediction (20% budget) (ablation) | EHL* (Known) · DA Cluster-8, 100% on-distribution queries | query time (us): 2.04 -> 1.64 | Improved |
Closest papers by meaning
- Ultrafast Euclidean Shortest Path Computation Using Hub Labeling (AAAI 2023 · similarity 0.87)
- Combining Bounding Boxes and JPS to Prune Grid Pathfinding (AAAI 2016 · similarity 0.85)
- Graph Reordering for Cache-Efficient Near Neighbor Search (NeurIPS 2022 · similarity 0.85)
- Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits (NeurIPS 2024 · similarity 0.82)
- MCGI: Manifold-Consistent Graph Indexing for Billion-Scale Disk-Resident Vector Search (NeurIPS 2026 · similarity 0.82)
- Approximate Distance Oracle for Fault-Tolerant Geometric Spanners (AAAI 2024 · similarity 0.82)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
