Lines Matching refs:compaction
14 …compaction parallelization is limited. Files at L0 or L1 may be locked due to involvement in pendi…
16 To handle these constraints better, we added a new type of compaction, L0->L0. It quickly reduces f…
20 … L0->L1 compaction is that files can overlap in the input level, so those overlapping files must b…
22 
24 This compaction pulls in every L0 and L1 file. This happens regardless of which L0 file is initiall…
26 …ss uniformly in the key-range. For example, a database may look like this during L0->L1 compaction:
28 
30 …t, and let's say the top two files are created after the compaction started. When the compaction i…
32 …vent us from parallelizing compactions. When locked files block L0->L1 compaction, there is nothin…
36 We introduced compaction within L0 to improve both parallelization and speed of reducing L0 file co…
38 
40 …compaction started first. Now L0->L1 is prevented by the locked L1 file. In this case, we compact …
42 …compaction work, as we're now compacting files without contributing towards our eventual goal of m…
48 … picking algorithm chose the largest L0 file for compaction. This didn't fit well with L0->L0 comp…
52 
54 …. When longer spans of files are available for L0->L0, we perform less compaction work per deleted…
60 …e primary change between his March 17 and April 14 builds is the latter performs L0->L0 compaction.