Lines Matching refs:memtable

117 then applied to a dedicated range tombstone memtable during `Write`. Later in
118 the background the range tombstone memtable and its corresponding data memtable
123 We chose to use a dedicated memtable for range tombstones. The memtable
125 case, which is the memtable contains zero or a small number of range tombstones.
126 The range tombstones are segregated to a separate memtable for the same reason
144 if we implement this, the range tombstone memtable still needs to be linearly
152 search through live memtable, immutable memtables, and then SSTs. When a key is
157 memtable, immutable memtables, and SSTs. The skyline is expensive to construct but fast to determin…
172 and applies to memtable. Logging to WAL always `fflush`es, and optionally
173 `fsync`s or `fdatasync`s. Applying to memtable is always an in-memory operation.
174 Since range tombstones have a dedicated skiplist memtable, the complexity of inserting is O(log(T))…
184 found across live memtable, immutable memtable, L0 files, and one file from each
200  we can locally “fragment” them for each SST file and memtable to guarantee that:
226  This requires significantly less work on iterator creation, but since each memtable/SST has
277 Note that memtable range tombstones are fragmented every read; for now this is acceptable,
279  enforce this by keeping track of the number of memtable range deletions and manually flushing