Lesson 63 of 107 8 min

System Design: Designing a Proximity Service (Yelp/Google Maps)

Learn how to design a proximity service like Yelp or Google Maps. A technical deep dive into Geohashing, proximity searches, and how to scale location-based queries.

Reading Mode

Hide the curriculum rail and keep the lesson centered for focused reading.

System Design: Designing a Proximity Service (Yelp)

Mental Model

Connecting isolated components into a resilient, scalable, and observable distributed web.

A Proximity Service allows users to find nearby places (restaurants, gas stations, etc.). The technical challenge is searching millions of businesses based on a user's current GPS coordinates with millisecond latency.

1. Core Requirements

graph LR
    Producer[Producer Service] -->|Publish Event| Kafka[Kafka / Event Bus]
    Kafka -->|Consume| Consumer1[Consumer Group A]
    Kafka -->|Consume| Consumer2[Consumer Group B]
    Consumer1 --> DB1[(Primary DB)]
    Consumer2 --> Cache[(Redis)]
  • Add/Update Business: Business owners can add or modify their listings.
  • Proximity Search: Users find businesses within a given radius (e.g., 5km).
  • Filtering: Filtering by category, rating, or price.

2. The Scaling Problem

Storing latitude and longitude in a standard database index (B-Tree) is not enough. A standard index only works on one dimension. To find businesses near a point, we need a 2D Spatial Index.

3. The Solution: Geohashing

Geohash is a popular technique that divides the world into a grid and assigns each cell a short string of letters and numbers.

  • The Logic:
    1. The world is divided into 32 large squares.
    2. Each square is subdivided recursively.
    3. The more characters in a Geohash string, the smaller and more precise the area.
  • Example: 9q8yy is a broad area in San Francisco, while 9q8yyzh is a specific street corner.

Why Geohash works for search

Geohashes have a unique property: Prefix Matching. Two locations that are close to each other will often share the same Geohash prefix. To find restaurants near a user, we simply calculate the user's Geohash and perform a Prefix Search in our database.

4. Database Selection

  • Metadata Store:PostgreSQL or MySQL to store business details (name, description, menu).
  • Index Store:Redis or Elasticsearch is ideal for Geohash indexing.
    • Redis Geospatial (GEOADD/GEORADIUS): Uses Geohashes internally to provide (\log N)$ proximity searches.

5. Handling High Read Volume

Proximity services are read-heavy.

  • Caching: Cache the results of popular searches (e.g., "Sushi in Manhattan") in Redis.
  • Read Replicas: Since data updates (new restaurants) are rare, we can scale out using read replicas across different geographic regions.

6. Edge Case: The "Boundary" Problem

If a user is at the very edge of a Geohash cell, the nearest restaurant might be in the neighboring cell.

  • The Fix: Always search the user's current Geohash cell plus the 8 surrounding cells. This ensures no nearby locations are missed.

Summary

The heart of Yelp's architecture is Geohashing. By converting 2D coordinates into 1D strings, we can leverage traditional database indexing to build a blazing-fast proximity search engine that scales to millions of businesses and users.

Engineering Standard: The "Staff" Perspective

In high-throughput distributed systems, the code we write is often the easiest part. The difficulty lies in how that code interacts with other components in the stack.

1. Data Integrity and The "P" in CAP

Whenever you are dealing with state (Databases, Caches, or In-memory stores), you must account for Network Partitions. In a standard Java microservice, we often choose Availability (AP) by using Eventual Consistency patterns. However, for financial ledgers, we must enforce Strong Consistency (CP), which usually involves distributed locks (Redis Redlock or Zookeeper) or a strictly linearizable sequence.

2. The Observability Pillar

Writing logic without observability is like flying a plane without a dashboard. Every production service must implement:

  • Tracing (OpenTelemetry): Track a single request across 50 microservices.
  • Metrics (Prometheus): Monitor Heap usage, Thread saturation, and P99 latencies.
  • Structured Logging (ELK/Splunk): Never log raw strings; use JSON so you can query logs like a database.

3. Production Incident Prevention

To survive a 3:00 AM incident, we use:

  • Circuit Breakers: Stop the bleeding if a downstream service is down.
  • Bulkheads: Isolate thread pools so one failing endpoint doesn't crash the entire app.
  • Retries with Exponential Backoff: Avoid the "Thundering Herd" problem when a service comes back online.

Critical Interview Nuance

When an interviewer asks you about this topic, don't just explain the code. Explain the Trade-offs. A Staff Engineer is someone who knows that every architectural decision is a choice between two "bad" outcomes. You are picking the one that aligns with the business goal.

Performance Checklist for High-Load Systems:

  1. Minimize Object Creation: Use primitive arrays and reusable buffers.
  2. Batching: Group 1,000 small writes into 1 large batch to save I/O cycles.
  3. Async Processing: If the user doesn't need the result immediately, move it to a Message Queue (Kafka/SQS).

Advanced Architectural Blueprint: The Staff Perspective

In modern high-scale engineering, the primary differentiator between a Senior and a Staff Engineer is the ability to see beyond the local code and understand the Global System Impact. This section provides the exhaustive architectural context required to operate this component at a "MANG" (Meta, Amazon, Netflix, Google) scale.

1. High-Availability and Disaster Recovery (DR)

Every component in a production system must be designed for failure. If this component resides in a single availability zone, it is a liability.

  • Multi-Region Active-Active: To achieve "Five Nines" (99.999%) availability, we replicate state across geographical regions using asynchronous replication or global consensus (Paxos/Raft).
  • Chaos Engineering: We regularly inject "latency spikes" and "node kills" using tools like Chaos Mesh to ensure the system gracefully degrades without a total outage.

2. The Data Integrity Pillar (Consistency Models)

When managing state, we must choose our position on the CAP theorem spectrum.

Model latency Complexity Use Case
Strong Consistency High High Financial Ledgers, Inventory Management
Eventual Consistency Low Medium Social Media Feeds, Like Counts
Monotonic Reads Medium Medium User Profile Updates

3. Observability and "Day 2" Operations

Writing the code is only 10% of the lifecycle. The remaining 90% is spent monitoring and maintaining it.

  • Tracing (OpenTelemetry): We use distributed tracing to map the request flow. This is critical when a P99 latency spike occurs in a mesh of 100+ microservices.
  • Structured Logging: We avoid unstructured text. Every log line is a JSON object containing correlationId, tenantId, and latencyMs.
  • Custom Metrics: We export business-level metrics (e.g., "Orders processed per second") to Prometheus to set up intelligent alerting with PagerDuty.

4. Production Readiness Checklist for Staff Engineers

  • Capacity Planning: Have we performed load testing to find the "Breaking Point" of the service?
  • Security Hardening: Is all communication encrypted using mTLS (Mutual TLS)?
  • Backpressure Propagation: Does the service correctly return HTTP 429 or 503 when its internal thread pools are saturated?
  • Idempotency: Can the same request be retried 10 times without side effects? (Critical for Payment systems).

Critical Interview Reflection

When an interviewer asks "How would you improve this?", they are looking for your ability to identify Bottlenecks. Focus on the network I/O, the database locking strategy, or the memory allocation patterns of the JVM. Explain the trade-offs between "Throughput" and "Latency." A Staff Engineer knows that you can never have both at their theoretical maximums.

Optimization Summary:

  1. Reduce Context Switching: Use non-blocking I/O (Netty/Project Loom).
  2. Minimize GC Pressure: Prefer primitive specialized collections over standard Generics.
  3. Data Sharding: Use Consistent Hashing to avoid "Hot Shards."

Technical Trade-offs: Messaging Systems

Pattern Ordering Durability Throughput Complexity
Log-based (Kafka) Strict (per partition) High Very High High
Memory-based (Redis Pub/Sub) None Low High Very Low
Push-based (RabbitMQ) Fair Medium Medium Medium

Key Takeaways

  • Add/Update Business: Business owners can add or modify their listings.
  • Proximity Search: Users find businesses within a given radius (e.g., 5km).
  • Filtering: Filtering by category, rating, or price.

Verbal Interview Script

Interviewer: "How would you ensure high availability and fault tolerance for this specific architecture?"

Candidate: "To achieve 'Five Nines' (99.999%) availability, we must eliminate all Single Points of Failure (SPOF). I would deploy the API Gateway and stateless microservices across multiple Availability Zones (AZs) behind an active-active load balancer. For the data layer, I would use asynchronous replication to a read-replica in a different region for disaster recovery. Furthermore, it's not enough to just deploy redundantly; we must protect the system from cascading failures. I would implement strict timeouts, retry mechanisms with exponential backoff and jitter, and Circuit Breakers (using a library like Resilience4j) on all synchronous network calls between microservices."

Want to track your progress?

Sign in to save your progress, track completed lessons, and pick up where you left off.