Home
last modified time | relevance | path

Searched refs:from (Results 1 – 7 of 7) sorted by relevance

/leveldb-1.20/port/
H A DREADME2 rest of the package from platform details.
4 Code in the rest of the package includes "port.h" from this directory.
/leveldb-1.20/doc/
H A Dimpl.md29 table generated from a log file is placed in a special **young** level (also
41 from the young level to the largest level using only bulk reads and writes
78 thread. The compaction picks a file from level L and all overlapping files from
82 is special (files in it may overlap each other), we treat compactions from
91 compaction of a level-(L+1) file will not pick up too much data from
108 Level-0 compactions will read up to four 1MB files from level-0, and at worst
111 Other than the special level-0 compactions, we will pick one 2MB file from level
112 L. In the worst case, this will overlap ~ 12 files from level L+1 (10 because
170 referenced from some level and are not the output of an active compaction.
H A Dtable_format.md59 an entry that maps from `filter.<N>` to the BlockHandle for the filter
93 mapping from a data block offset to the corresponding filter.
H A Dindex.md92 Apart from its atomicity benefits, `WriteBatch` may also be used to speed up
98 write from the process into the operating system. The transfer from operating
116 false, an update is pushed from the process memory into the operating system
134 implementation acquires a lock from the operating system to prevent misuse.
315 the unit of transfer to and from persistent storage. The default block size is
357 according to application level data sizes, without any reduction from
395 involve multiple reads from disk. The optional FilterPolicy mechanism can be
457 verification of all data that is read from the file system on behalf of a
/leveldb-1.20/
H A DREADME.md1 …-value storage library written at Google that provides an ordered mapping from string keys to stri…
60 Here is a performance report (with explanations) from the run of the
84 from the operating system to the disk after every operation; the other
112 by the one or two disk seeks needed to fetch the data from disk.
129 Some of the high cost of reads comes from repeated decompression of blocks
130 read from disk. If we supply enough cache to the leveldb so it can hold the
158 an iterator from a DB object.
166 * **include/status.h**: Status is returned from many of the public interfaces
H A DLICENSE14 contributors may be used to endorse or promote products derived from
/leveldb-1.20/db/
H A Ddb_test.cc501 const std::string from = TableFileName(dbname_, number); in RenameLDBToSST() local
503 ASSERT_OK(env_->RenameFile(from, to)); in RenameLDBToSST()