Skip to content

Alert fatigue is arithmetic Amplification Break-even reuse count Cost per unit of work Cost-aware eviction: value density Costs of a hash shuffle Dictionary code width Endurance budget Erasure coding: overhead and repair Error-budget burn rate Event-time skew Forces per commit Freshness and ETA Freshness lag Headroom a reactive autoscaler needs How big keyed state gets How long a backfill takes How many files a pipeline writes How many runs an experiment needs How many time series a metric makes Junk dimension size Key groups Lease drift margin Load per node under replication Memory grant Memory held by batching Moving data through a rate limit Off-CPU time One commit per catalog round trip Periodic snapshot size Population stability index Reciprocal rank fusion Recovering a streaming job Retention tiers by resolution Roaring container break-even Routing between two price models Serverless cost is memory × time Sliding windows multiply work Sparse index granule The expiry invariant The miss-ratio curve The partition of RAM The real price of spot capacity The value of not reading Transactional sink timeout Usable buffer-pool frames Utilization Varint length Vector batch size What an instrument costs What keeping an old interface costs What polling costs When statistics refresh When to rewrite away deletes Write-back coalescing

The Data EngineeringBeta

Main content

Relationships
Routing between two price models

Relationships

Definition

Routing between two price models

Route each query to the engine whose price model it falls cheaper under.

a_{1} + b_{1} x = a_{2} + b_{2} x ⟹ x^{*} = \frac{a _{1} - a _{2}}{b _{2} - b _{1}}

$a$: Per-query price; fixed price per query
$b$: Per-TB price; price per TB scanned

Worked examples, recomputed

Every number the mechanisms quote for this relationship is recomputed from it, so none of them disagrees with it.

$0.50 + $1/TB against $0.01 + $8/TB → cross at 70 GB

Where it appears

Each mechanism states it in its own names. The general symbol each name stands for is shown with it.

Cost Mechanics
What is metered, and what is the smallest increment you are charged for?
$0.50 + 1 \times x = 0.01 + 8 \times x$
Read it in place →

Roaring container break-even

Previous Page

Serverless cost is memory × time

Next Page

The Data Engineering

Learn

Mechanisms
Symptoms
Routes

Practice

Labs
Playbooks
Interview

Reference

Trade-offs
Relationships
Glossary

The project

About
Privacy

Text CC BY-NC 4.0 · Lab code MIT

Written by Aayush Sharma