Block size — where it appears
Named by 2 essays across one field — each of them below, with the objects they name alongside it.
The sibling a full leaf asks first
The rule databases use to fix ascending inserts fills their leaves completely and collapses to 53.4% when one key in a hundred arrives late. A leaf that offers a key to a sibling before it splits, and splits two full leaves into three when neither will take one, holds 84.2% on the same stream — and is better with a trickle of late keys than without one, because a perfectly ascending stream has no sibling with room.
The read a filter has no key for
A Bloom filter on every run of a log-structured store turns a lookup for a missing key from a read of every level into a fraction of one — 0.72 transfers across eight levels at five bits a key, and 0.00027 at twenty. A range query over the same store reads nine transfers at five bits and nine at twenty, because a filter answers whether one named key is in a run and a range has no key to name.
Named alongside it
The objects these essays reach for when they reach for this one.
Design parameterSpace time tradeAmortisationB-treeBloom filterBulk loadingCompactionIndex maintenanceInsertion orderLsm treeNode fillPresortedness