Nearby Places Search · Analysis

01 · Frame the problem

Understand the central challenge

Build radius search for places with coordinates and visibility rules. Nearby cells cross partition boundaries, index updates lag, and dense areas contain far more candidates than rural ones.

A spatial index reduces candidates but does not by itself prove exact distance, current coordinates or visibility. Analyse coverage across cell boundaries and the completeness claim when scan budgets are limited.

02 · Find the design pressure

Start simple, then identify the gap

Begin with a bounding-region candidate query and exact distance filtering. Searching only the query's center cell misses neighbors across boundaries. Add authoritative hydration and stable ordering, and return truncation when bounded work prevents exhaustive coverage.

Use a spatial index to obtain bounded candidates and authoritative records to apply visibility and current coordinates. Exact distance filtering and a clear snapshot or best-effort contract make the results explainable. Validate finite coordinates, radius and page size. Select an index resolution that bounds coverage without excluding intersecting cells, including geographic wraparound. Retrieve candidates from every intersecting cell using a supported spatial query. Deduplicate IDs and apply exact radius checks with a tested geospatial distance implementation. Load authoritative place records, enforce visibility and use current coordinates for final filtering. A stale index may still miss moved-in places, so disclose the freshness contract. Sort by distance and stable ID. Pin an index snapshot for consistent continuation, or document best-effort pages. Enforce work budgets and mark incomplete results explicitly.

03 · Define success

Requirements to preserve

Validate coordinates and cap radius/result size.
Cover neighboring spatial cells before exact distance checks.
Apply current visibility rules before returning results.
Define index freshness and pagination semantics.

Workload: 25,000 reads/s, 1,000 writes/s, 1000 B records, 200 ms read p99 target. These are exercise assumptions; the Solution includes capacity formulas.

04 · Identify the correctness boundary

Consistency, ownership and failure boundaries

Spatial cells produce candidates, not exact distances or current visibility. Cover all cells intersecting the query region, compute exact distance using a documented geographic model, and bound scans. If the candidate budget is exhausted, disclose truncation rather than claiming the returned set contains every nearby item.

05 · Make it concrete

Reason through a worked example

A point lies just across a cell boundary but within a 500 m radius. Searching only the center cell misses it; covering intersecting cells finds it. Hydration removes a location that became private. Stable distance-and-ID ordering makes equal-distance results deterministic within the declared snapshot.