VSVineet Singhalinvineet-s1nghal.hashnode.dev·May 28 · 6 min readHow GeoHash, H3 and S2 Help Modern Systems Understand LocationWhen you open a ride-sharing app and request a cab, the system instantly answers: which drivers are near you right now? That sounds simple. But underneath that answer is one of the more interesting en00
VSVineet Singhalinvineet-s1nghal.hashnode.dev·May 28 · 6 min readH3 Explained — Why Uber Chose Hexagons for Geo IndexingWhy GeoHash Was Not Enough for Uber GeoHash works well for basic proximity search — finding nearby restaurants or nearby drivers. But Uber's geo problems were more complex than that. Uber needed to an00
VSVineet Singhalinvineet-s1nghal.hashnode.dev·May 28 · 7 min readS2 Explained — How Google Built Planet-Scale Geo InfrastructureWhy Google Needed Something Different GeoHash and H3 are both solid systems, but they share a fundamental limitation: they both start by projecting Earth onto a flat surface — a rectangle or a set of 00
VSVineet Singhalinvineet-s1nghal.hashnode.dev·May 28 · 6 min readGeoHash Explained — How Databases Turn Location Into a StringThe Problem It Solves Databases are excellent at one thing: searching sorted data fast. A B-Tree index can answer WHERE age > 25 or WHERE city = 'Delhi' in milliseconds because these values sit on a s00
