Lines Matching refs:in
10 …nlike files at lower levels) can span the entire key-range, a key might be in any file, thus reads…
12 …DB intentionally delays user writes. This slows down accumulation of files in L0, and frees up res…
14 …llelization is limited. Files at L0 or L1 may be locked due to involvement in pending L0->L1 or L1…
16 …, we added a new type of compaction, L0->L0. It quickly reduces file count in L0 and can be schedu…
20 …le in the level. One special property of L0->L1 compaction is that files can overlap in the input …
24 This compaction pulls in every L0 and L1 file. This happens regardless of which L0 file is initiall…
26 Users may insert their data less uniformly in the key-range. For example, a database may look like …
30 …rth L0 file and six rightmost L1 files are pulled in due to overlap. Notice this leaves the databa…
32 We can now see the high-level problems with this approach more clearly. First, locked files in L0 o…
40 …also lets us do less work since we don't pull in any L1 files, whereas L0->L1 compaction would've …
42 … write throughput. One justification is that L0 file data is highly likely in page cache and/or bl…
48 … prevent us from getting a long span of files. See the second illustration in this post for a scen…
54 Now, there can never be L0 files unreachable for L0->L0 due to L0->L1 selecting files in the middle…
56 This feature will be available in RocksDB 5.7.