System Design
05Design patternsReservation Availability Checking

05 · Reusable pattern

Reservation Availability Checking

Prevent overselling with holds, expirations, atomic inventory updates, and reconciliation.
8 minConcept guideReference-informed · independently authored
01

Lesson spine

What you need to understand.

Reservation systems separate a fast availability projection from the authoritative operation that creates a hold or sale.

01

Inventory model

Keep capacity by resource and time slot plus explicit holds, confirmed reservations, cancellations, and overrides.

02

Availability query

Use indexed counters or projections to find candidates quickly, but revalidate inside the write boundary.

03

Pessimistic reservation

Lock the scarce slot, check remaining capacity, create a hold, update the counter, and commit before releasing.

04

Optimistic reservation

Condition the write on an unchanged version when conflicts are rare and retry cost is low.

05

Hold lifecycle

Move available to held with an expiry, then sold on payment or released by an idempotent expiration worker.

06

Waiting room

Serialize peak demand before the database using a queue and controlled admission while preserving user order and transparency.

02

Before the boxes

Frame the decision.

Outcome

What must work

Prevent overselling with holds, expirations, atomic inventory updates, and reconciliation.

Scale

What changes the design

Units · holds/s · scarcity skew · TTL · conversion · reconciliation lag

Boundary

What owns the truth

Identify the component that commits authoritative state, then separate synchronous confirmation from derived work.

Non-goal

What stays simple

Do not add global coordination, multi-region writes, or a specialized store until a requirement earns the complexity.

03

Architecture map

Trace ownership, not just traffic.

Reservation Availability Checking · concept mechanism

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.

  1. 01

    Search — Reads availability projection Define the output contract before moving to the next owner.

  2. 02

    Hold API — Requests quantity Define the output contract before moving to the next owner.

  3. 03

    Inventory owner — Reserves atomically Define the output contract before moving to the next owner.

  4. 04

    Expiry scheduler — Releases holds Define the output contract before moving to the next owner.

  5. 05

    Checkout — Converts hold to sale Define the output contract before moving to the next owner.

  6. 06

    Reconciler — Repairs drift Confirm the result and emit the evidence needed to reconcile it.

04

Decision table

Make the trade-offs explicit.

DecisionDefensible positionCost to acknowledge
Primary mechanismStrong holds protect scarce stock; optimistic checkout accepts conflict and recovery.The stronger guarantee usually adds coordination, latency, state, or operational work.
Sync vs. asyncKeep 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. scaledBegin 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.
05

Failure review

Design the recovery path.

DetectBoundRetry safelyReconcileLearn

Topic-specific risk

Hold expiry races and duplicate checkout can oversell or strand inventory.

Response

Persist 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.

Response

Use 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.

Response

Expose queue depth and hot-key share, apply backpressure, isolate tenants, and degrade optional work before correctness.

06

Evidence + level bar

Prove the design can be operated.

Core signals

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.

Mid-level

Complete and clear

Finish the happy path, identify the state owner, choose reasonable building blocks, and explain one scale mechanism.

Senior

Trade-offs and failure

Separate read and write paths, define consistency, explain partitioning, and make duplicate or partial failure safe.

Staff+

Evolution and operations

Discuss multi-region boundaries, migration, tenant isolation, capacity, observability, and how the architecture changes over time.

07

Interview language

Open the deep dive with a claim.

“For Reservation Availability Checking, the decision I want to make explicit is this: Strong holds protect scarce stock; optimistic checkout accepts conflict and recovery. 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?

  1. For Reservation Availability Checking, where is the correctness boundary and which failure would you test first?
  2. Which component owns committed truth, and what event or response proves the commit?
  3. Where is the first scaling or coordination bottleneck under the stated envelope?
  4. What happens after an ambiguous timeout or duplicate operation?
  5. Which complexity would you remove at one hundredth of the scale?