05Design patternsProximity-based services
05 · Reusable pattern
Proximity-based services
Use spatial indexes, cell systems, moving-object updates, and distance-aware ranking.Lesson spine
What you need to understand.
Proximity systems reduce a global point set to a bounded local candidate set, then compute exact distance and product ranking.
Geohash or cell IDs
Map coordinates to hierarchical cells so nearby objects share prefixes; always inspect neighboring cells at boundaries.
Quadtrees
Recursively split dense regions, adapting cell size to data distribution at the cost of a mutable tree.
Real-time location index
Keep active objects in a low-latency geo store with TTLs and persist historical trails separately.
Query expansion
Start with the user's cell, expand rings until enough candidates exist, then filter eligibility and compute exact distance.
Moving objects
Batch or threshold updates, version location timestamps, and expire stale drivers or devices.
Regional partitioning
Keep city or geographic ownership local while handling cross-border queries and failover explicitly.
Before the boxes
Frame the decision.
What must work
Use spatial indexes, cell systems, moving-object updates, and distance-aware ranking.
What changes the design
Update frequency · object count · density · radius · candidate cap · freshness
What owns the truth
Identify the component that commits authoritative state, then separate synchronous confirmation from derived work.
What stays simple
Do not add global coordination, multi-region writes, or a specialized store until a requirement earns the complexity.
Architecture map
Trace ownership, not just traffic.
Follow the decision from left to right. Every arrow should have a reason.
Updates coordinates
Computes key
Maintains active objects
Expands neighboring cells
Applies eligibility
Computes exact distance
Persists trails
Walk one representative request across every arrow. Say whether the handoff is synchronous or asynchronous, what identity makes a retry safe, and which step changes authoritative state.
- 01
Location producer — Updates coordinates Define the output contract before moving to the next owner.
- 02
Cell mapper — Computes key Define the output contract before moving to the next owner.
- 03
Hot store — Maintains active objects Define the output contract before moving to the next owner.
- 04
Query service — Expands neighboring cells Define the output contract before moving to the next owner.
- 05
Filter — Applies eligibility Define the output contract before moving to the next owner.
- 06
Ranker — Computes exact distance Define the output contract before moving to the next owner.
- 07
History — Persists trails Confirm the result and emit the evidence needed to reconcile it.
Decision table
Make the trade-offs explicit.
| Decision | Defensible position | Cost to acknowledge |
|---|---|---|
| Primary mechanism | Small cells reduce scans but increase churn and boundary fan-out. | The stronger guarantee usually adds coordination, latency, state, or operational work. |
| Sync vs. async | Keep only correctness-critical confirmation synchronous. Move derived views, notifications, analytics, and cleanup behind a durable boundary. | Async work needs idempotency, lag monitoring, replay, and a product definition for partial completion. |
| Simple vs. scaled | Begin with one logical owner and a clear API. Partition or replicate only the resource proven to be the first bottleneck. | Migration requires stable identities, versioned contracts, backfill, and a rollback path. |
Failure review
Design the recovery path.
Topic-specific risk
Moving objects and boundaries can return stale, missing, or duplicate candidates.
ResponsePersist enough identity and state to distinguish retry, resume, compensation, and operator repair.
Dependency timeout
A timeout is ambiguous: the remote side may have failed, succeeded, or still be running.
ResponseUse deadlines, bounded backoff with jitter, idempotency keys, and a status or reconciliation path.
Overload or skew
Average capacity can look healthy while a tenant, key, partition, region, or expensive request saturates one owner.
ResponseExpose queue depth and hot-key share, apply backpressure, isolate tenants, and degrade optional work before correctness.
Evidence + level bar
Prove the design can be operated.
Health of the promise
Measure user-visible latency or freshness, correctness drift, saturation, retry volume, and time to recover. Alert on the failed promise—not only CPU.
Complete and clear
Finish the happy path, identify the state owner, choose reasonable building blocks, and explain one scale mechanism.
Trade-offs and failure
Separate read and write paths, define consistency, explain partitioning, and make duplicate or partial failure safe.
Evolution and operations
Discuss multi-region boundaries, migration, tenant isolation, capacity, observability, and how the architecture changes over time.
Interview language
Open the deep dive with a claim.
“For Proximity-based services, the decision I want to make explicit is this: Small cells reduce scans but increase churn and boundary fan-out. I’ll trace the state-changing path first, show where the result becomes durable, then test the design against the highest-risk failure and our target scale.”
08 · Retrieval check
Can you defend it without the page?
- For Proximity-based services, where is the correctness boundary and which failure would you test first?
- Which component owns committed truth, and what event or response proves the commit?
- Where is the first scaling or coordination bottleneck under the stated envelope?
- What happens after an ambiguous timeout or duplicate operation?
- Which complexity would you remove at one hundredth of the scale?