Search, Geo & Logistics

Autocomplete, proximity, dispatch, and tracking.

Learn the reason behind each component

4 independent guides. Each includes local concept explanations, a correctness contract, a worked failure trace, and a runnable Python learning model.

Read in this order: requirements → concepts → data flow → concurrency and failure behavior → sizing → worked example. Explain what can fail before choosing a technology.

01·Search AutocompleteServe ranked prefix completions from a normalized, versioned snapshot without traversing a huge subtree on each keystroke. 02·Proximity Service (Nearby Places)Find nearby points by a conservative spatial covering, then refine and rank without missing boundary neighbors. 03·Ride Matching (Dispatch)Use approximate location candidates but one authoritative state transition for exclusive trip assignment. 04·Package / Delivery TrackingTurn messy carrier scans into a trustworthy shipment history and a reproducible current-state projection.

Find a guide or concept

4 guides

Designing Package / Delivery Tracking — A System Design Interview Guide

Turn messy carrier scans into a trustworthy shipment history and a reproducible current-state projection.

State machines and projections · Event time and watermarks · Deduplication · Optimistic concurrency and compare-and-set · Transactional outbox · ETA and uncertainty

Designing a Proximity Service — A System Design Interview Guide

Find nearby points by a conservative spatial covering, then refine and rank without missing boundary neighbors.

Geohash · Quadtree and adaptive spatial indexing · ETA and uncertainty · Inverted indexes and columnar storage · Cache-aside and invalidation

Designing a Ride Matching Service — A System Design Interview Guide

Use approximate location candidates but one authoritative state transition for exclusive trip assignment.

Geohash · ETA and uncertainty · Optimistic concurrency and compare-and-set · Leases · State machines and projections · Transactional outbox

Designing a Search Autocomplete System — A System Design Guide

Serve ranked prefix completions from a normalized, versioned snapshot without traversing a huge subtree on each keystroke.

Trie and cached prefix top-k · Top-k candidate discovery · Cardinality · Cache-aside and invalidation · DAG scheduling

Download the Python concept models · Python 3.10+, no packages required.

Student clarity and correctness review · 19 October 2026