An interactive explainer
A rider taps Request and expects a name, a photo and an arrival time in about three seconds. The city holds thirty thousand drivers, all moving, each reporting a new position every four seconds. The system throws almost all of them away with one hash lookup. Then it scores the few that survive, and picks the driver who is best for the whole city. That is often not the nearest car.
Geospatial indexing · Real-time matching · Dispatch
Systems · Advanced · 12 min · Why the ride you get is not the nearest car — an interactive explainer on ViLearn, with a simulation and a knowledge check. All explainers.
Related: Jury duty for servers · Why one expired key takes down a database that was 20% busy · Why a log beats a queue when two teams want the same event