Lines Matching refs:file
10 …les at lower levels) can span the entire key-range, a key might be in any file, thus reads need to…
12 Although, the mechanism with which we enforce L0's file count limit may be unappealing. When the li…
16 …nts better, we added a new type of compaction, L0->L0. It quickly reduces file count in L0 and can…
20 …viously, our logic for picking which L0 file to compact was the same as every other level: pick th…
24 …s in every L0 and L1 file. This happens regardless of which L0 file is initially chosen as each fi…
30 …file from the top is the largest, and let's say the top two files are created after the compaction…
32 …While this is happening, new files are being flushed to L0, advancing towards the file count limit.
36 We introduced compaction within L0 to improve both parallelization and speed of reducing L0 file co…
40 …file. In this case, we compact files within L0. This allows us to start the work for eliminating L…
42 …action stalls and improved write throughput. One justification is that L0 file data is highly like…
48 …file for compaction. This didn't fit well with L0->L0 compaction, which operates on a span of file…
50 So, we changed the L0->L1 picking algorithm to start from the oldest file and expand towards newer …
54 … are available for L0->L0, we perform less compaction work per deleted L0 file, thus improving eff…