Space vs. time
Where you meet it: compression, indexing, materialization, caching.
What it is
Why does nobody collect this gain? Context-mixing models run at 100 KB/s–1 MB/s. That is three to four orders of magnitude slower than ZSTD, for roughly 2× more ratio. The last 2× of ratio costs about 1000× the CPU. The exchange rate is harsh. So data pipelines sit permanently at the cheap end of a curve that everybody knows is not the ceiling.
From Encoding, Serialization & Compression › General-purpose compression
In compact, queryable structures the usual trade-off inverts. In every other article, space and time are opposites: you spend one to buy the other. Here they move together, for two compounding reasons. First, analytics is bandwidth-bound (limited by bytes moved, not by arithmetic), so bytes not stored are bytes not moved. That alone makes smaller faster. Second, once data is packed into bits, a 64-bit word operation processes 64 elements at once and a 512-bit AVX register processes 512. Compactness converts directly into parallelism. A bitmap AND does 512 row-level predicate tests in one instruction, not because it is clever, but because the representation happens to fit the arithmetic unit.
From Core Data Structures › Compact and queryable
Where it appears
In 16 mechanisms. Each says what the mechanism is about, then how this trade-off shows up there, in its own words.
- Physical Substrate & Performance Laws
Why do trade-offs exist at all?
compression — use the idle arithmetic units to save bandwidth.
Read it inThe core and the operating systemSeven root causes: why trade-offs exist at allDisk and flash
- Data Movement
How do records cross between two systems that have independent rates, independent availability and independent lifetimes, and what are you willing to lose when the assumption underneath the crossing breaks?
Compression trades space for time: spend CPU to move fewer bytes.
Read it inCompression on the wire
- Storage: Physical Organization
What should sit next to what, given that I must decide at write time and find out at read time?
A second access pattern needs a second copy.
- Persistence & Durability
When a system says "yes, your data is safe", what exactly has it promised, and what did it have to do to keep that promise?
Notice how the same two themes return: space is bought with reconstruction cost (the incremental chain-length trade again), and the failure-domain assumption sits under every number.
Read it inPlacement, rebuild time and erasure codingTwo liabilities: recovery and spaceLog truncation and retention policies
- Core Data Structures
How do we choose a data structure when the real cost is set by the hardware, not by Big-O?
Here space is speed, because the machine is starved for bandwidth, and every byte you do not store is a byte you do not move or decode.
- Encoding, Serialization & Compression
What do we turn our values into when we turn them into bytes, and what does that choice cost?
This is the whole economics of encoding in one line.
Read it inBytes become an outputGeneral-purpose compression: the last passColumnar files, Arrow and schema resolution
- Indexing
When does a separate "where is it?" structure pay for itself, and what does it cost to keep it true?
Every anatomical choice in an index is the same choice at a different scale: how much of the row to duplicate, and for which rows.
Read it inAn index entry is a pair with four dialsTwo and three dimensions: the first real loss
- Query Processing
Why can one question be answered by plans whose costs differ by a factor of ten thousand, and what does each operator force the engine to do?
Precision costs quadratically in memory, the same square-root law (error ∝ 1/√n) that governs sampling.
- Memory & Resource Management
Who is allowed to hold how much memory, for how long, and what happens to the work when the answer is less than it asked for?
Memory enters quadratically in the one-pass capacity.
Read it inHash spill and the arithmetic of a single passLRU-K, 2Q and ARC
- Caching
What happens when we deliberately keep a second copy of data that no protocol forces to be correct?
It buys latency with space at a logarithmic exchange rate, and pays for the difference in truth.
Read it inThe first copy with no obligationHit rate is a measurement, not a tuning knob
- Fault Tolerance & Delivery Semantics
What is the cheapest thing that can be safely done twice?
Exact deduplication requires remembering every key forever: unbounded state against unbounded time.
Read it inIdempotency: the three sources
- Cost Mechanics
What is metered, and what is the smallest increment you are charged for?
Same data, same engine, same physics, three different correct answers, decided by one clause in the contract.
Read it inCompression as a lever: the answer depends on the billing clause
- Time & Temporal Semantics
When am I allowed to act on data that may still be incomplete, and what do I owe the reader if I was wrong?
The window width is at the same time the meaning of the join and its memory bill: both sides are held for w, and nothing can be emitted as complete until the watermark passes tA + w (what a stream join keeps).
Read it inTemporal joins and future leakageTTL and expiryLate data: drop, divert or re-fireThe three ways out of incompleteness
- Table & Storage Maintenance
Who pays for the gap between the order data arrives in and the order it is read in: the writer, every reader, or a background job, and what is the break-even?
The non-obvious term is f: compaction is a rewrite, so it makes f larger.
Read it inSnapshot expiration: history costs space
- Observability & Operations
What is the smallest description of a running system from which we can find a fault, fast enough to matter, at a cost we can still pay while the system is failing?
Logs are the only signal that keeps the specific record.
Read it inStructured logging
- Specialized Processing Models
What do you build when a query predicate cannot be reduced to a range over an ordered key?
Where data carries a resolution dimension, retention becomes continuous: degrade rather than delete.
Read it inDownsampling, rollups and retention tiersNothing can be eliminated by inspection
Related
Made on the same pages most often.