| /rocksdb-6.9/db/ |
| D | column_family_test.cc | 912 PutFixed64(&one, 1); in TEST_P()
1300 PutFixed64(&one, 1); in TEST_P()
1340 one.num_levels = 1; in TEST_P()
1412 one.num_levels = 1; in TEST_P()
1512 one.num_levels = 1; in TEST_P()
1608 one.num_levels = 1; in TEST_P()
1707 one.num_levels = 1; in TEST_P()
1712 Reopen({default_cf, one}); in TEST_P()
1809 one.num_levels = 1; in TEST_P()
1902 one.num_levels = 1; in TEST_P()
[all …]
|
| D | db_wal_test.cc | 353 std::string one, two; in TEST_F() local
354 PutFixed64(&one, 1); in TEST_F()
356 ASSERT_OK(db_->Merge(WriteOptions(), Slice("foo"), Slice(one))); in TEST_F()
357 ASSERT_OK(db_->Merge(WriteOptions(), Slice("foo"), Slice(one))); in TEST_F()
358 ASSERT_OK(db_->Merge(WriteOptions(), Slice("bar"), Slice(one))); in TEST_F()
372 ASSERT_EQ(one, Get("bar")); in TEST_F()
386 ASSERT_EQ(one, Get("bar")); in TEST_F()
403 ASSERT_EQ(one, Get("bar")); in TEST_F()
|
| D | db_compaction_filter_test.cc | 537 std::string one, two, three, four; in TEST_F() local
538 PutFixed64(&one, 1); in TEST_F()
557 ASSERT_OK(db_->Merge(WriteOptions(), "foo", one)); in TEST_F()
579 ASSERT_OK(db_->Put(WriteOptions(), "foobar", one)); in TEST_F()
|
| /rocksdb-6.9/docs/_posts/ |
| D | 2016-01-29-compaction_pri.markdown | 10 …ned into many files. When size of a level exceeds its target size, we pick one or more of its file…
14 Which file to pick to compact is an interesting question. LevelDB only uses one thread for compacti…
20 …one file of a level to the next level, it creates a hole. Over time, incoming compaction will fill…
34 If one file contains a lot of delete markers, it may slow down iterating over this area, because we…
43 …ptions.compaction_pri=kOldestSmallestSeqFirst` (note it is not the default one for backward compat…
|
| D | 2014-09-12-cuckoo.markdown | 50 …sh location that is free. If all the locations are blocked, we try to move one of the colliding ke…
52 …ket _B_ using one of the hash functions. The source nodes are the possible hash locations for the …
54 …, we compute hashes, _h1(k), ..., __hn__(k)_ and the key must be present in one of these locations.
|
| D | 2017-03-02-rocksdb-5-2-1-released.markdown | 9 …acity, if the user doesn't pass one. This also impacts the default block cache when the user doesn…
|
| D | 2014-03-27-how-to-persist-in-memory-rocksdb-database.markdown | 16 Every update to RocksDB is written to two places - one is an in-memory data structure called memtab…
21 …one day. To fully recover the DB, we also need to backup the current snapshot of the database (con…
|
| D | 2018-08-23-data-block-hash-index.markdown | 11 Benchmarks with `db_bench` show the CPU utilization of one of the main functions in the point look…
56 Space overhead depends on the util ratio. Each bucket is a `uint8_t` (i.e. one byte). For a util r…
66 …ntComparator`, but they probably hash to different value. Later queries to one form of the key wil…
77 NOTE: to use the hash index feature, one should 1) have a comparator that can never treat different…
106 … idnex in a purely cached workload. We observe that the CPU utilization of one of the main functio…
|
| D | 2015-02-27-write-batch-with-index.markdown | 10 …one of their storage engines. RocksDB can help with guaranteeing some of the ACID properties: dura…
14 However, if we enforce atomicity by only committing all writes in the end of the transaction in one…
|
| D | 2014-05-14-lock.markdown | 12 …ta structures supporting single writer and multiple readers. There is only one single major lock, …
33 … counting to one single super version and removing the locking for decreasing reference counts, in…
48 When I said there was only one single major lock, I was lying. In RocksDB, all LRU caches had exclu…
62 try and open the same rocksdb for reading, only one of the open requests
|
| D | 2018-11-21-delete-range.markdown | 30 users, since we want to build a generally useful system, not one that has many
31 one-off features for individual users. The range deletion pattern is common as
142 unsatisfactory: (1) we need to store multiple skylines, one for each snapshot,
184 found across live memtable, immutable memtable, L0 files, and one file from each
216 lookups, we binary search each file's fragmented range tombstones for one that covers
223 tombstones and store them in a list, seeking each one to cover the start key of the range
|
| D | 2017-05-12-partitioned-index-filter.markdown | 12 RocksDB has by default one index/filter block per SST file. The size of the index/filter varies bas…
18 …point lookup might need at most a couple of data block reads (of size 4KB) one from each layer of …
|
| D | 2014-05-22-rocksdb-3-1-release.markdown | 20 We released 3.1 so fast after 3.0 because one of our internal customers needed materialized hash in…
|
| D | 2017-05-14-core-local-stats.markdown | 64 To measure statistics query latency, we ran sysbench with 4K OLTP clients concurrently with one cli…
75 …ough, we found use cases where those assumptions do not hold. For example, one application has per…
|
| D | 2014-06-27-avoid-expensive-locks-in-get.markdown | 64 The new approach entails one issue: a thread can visit GetImpl() once but can never come back again…
88 try and open the same rocksdb for reading, only one of the open requests
|
| D | 2015-07-23-dynamic-level.markdown | 10 In this article, we follow up on the first part of an answer to one of the questions in our [AMA](h…
14 Level-based compaction is the original LevelDB compaction style and one of the two major compaction…
|
| D | 2014-09-15-rocksdb-3-5-release.markdown | 35 …4. OptimizeForPointLookup() takes one parameter for block cache size. It now builds hash index, bl…
|
| D | 2015-07-22-rocksdb-is-now-available-in-windows-platform.markdown | 12 …t created here at Microsoft which we intend to use as a storage option for one of our key/value da…
|
| D | 2017-06-26-17-level-based-changes.markdown | 10 …e key-range, a key might be in any file, thus reads need to check them one-by-one. Users often wis…
|
| D | 2017-07-25-rocksdb-5-6-1-released.markdown | 16 …fer manager, so that they can cap memory usage for memtable and block cache using one single limit.
|
| /rocksdb-6.9/examples/ |
| D | rocksdb_option_file_example.ini | 4 # Version section, DBOptions section, at least one CFOptions
5 # section, and one TableOptions section for each column family.
23 # Furthermore, each line can only contain at most one statement.
|
| /rocksdb-6.9/ |
| D | RocksDBConfigVersion.cmake | 8 # but only if the requested major version is the same as the current one.
60 # check that the installed version has the same 32/64bit-ness as the one which is currently searchi…
|
| /rocksdb-6.9/tools/advisor/advisor/ |
| D | rules.ini | 16 # There should be at least one Rule section in the file with its corresponding
23 # A condition can be associated with one or more Rules.
27 # one or more Rules.
|
| /rocksdb-6.9/tools/rdb/ |
| D | API.md | 34 # one exists, or null otherwise.
136 A BatchObject must have at least one of the following key-value pairs:
|
| /rocksdb-6.9/tools/advisor/test/input_files/ |
| D | test_rules.ini | 9 [Rule "multiple-conds-one-false"]
|