Can you describe a concrete lookup for finding nearby drivers?
Hash the rider's coordinates to their H3 cell at precision 9 (roughly 174 meters). Extract the level-8 parent cell to identify the region. Query a hash table for the six level-8 neighbor cells. Drivers indexed by cell ID are found in microseconds—no distance math, no sorting, just table probes.
Answered in
Why Uber Tiles the Planet in HexagonsHexagons with equidistant neighbors replace lat/long trigonometry with O(1) table lookups for finding nearby drivers and calculating surge pricing.
Read the full analysisOther questions this article answers
More system design questions
- Why doesn't Google just run Dijkstra faster?
- What is a shortcut edge and when is it precomputed?
- How much space do shortcut edges take compared to the original graph?
- Can Contraction Hierarchies handle dynamic graphs like traffic or road closure?
- Why contract low-degree nodes first instead of high-degree ones?
- What is a CRDT and why does it matter for real-time collaboration?
- How do CRDTs handle concurrent edits without a central server referee?
- Why did Figma move from operational transforms to CRDTs?
Every answer on Crashtech is written by the editor of the article it comes from — never auto-summarised. Browse all answers or the System Design beat.