Home
last modified time | relevance | path

Searched refs:range (Results 1 – 25 of 57) sorted by relevance

123

/rocksdb-6.9/docs/_posts/
D2018-11-21-delete-range.markdown43 the deleted range(s). This deletes the range asynchronously, so cannot be used
178 range tombstone memtables/meta-blocks.
202 * no range tombstones overlap; and
203 * range tombstones are ordered by start key.
220 the range tombstone).
222 For range scans, we create iterators over all the fragmented range
227 its own range tombstone iterator, querying range tombstones requires key comparisons (and
229 collapsed representation of all range tombstones). As a result, very long range scans may become
231 more common class of range scan.
236 and long range scan performance across:
[all …]
D2014-04-21-indexing-sst-files-for-better-lookup-performance.markdown12 On level 0, files are sorted based on the time they are flushed. Their key range (as defined by Fil…
16 … on key. Their key range are mutually exclusive. Instead of scanning through each SST file and che…
18 …actional_cascading) kind of optimization to narrow down the binary search range. Here is an exampl…
22 …MetaData.smallest and FileMetaData.largest to decide if it falls into the range. The comparison sh…
24 …range shows the target key is smaller than file 2's FileMetaData.smallest 300. Even though, we cou…
26 …range of files on level 2. For example, file 1 on level 1 points to file 3 (on level 2) on the lef…
D2016-01-29-compaction_pri.markdown10 …tial increasing target size. Except a special level 0, every level is key-range partitioned into m…
20 …range. For instance, when we compact one file of a level to the next level, it creates a hole. Ove…
22 …because a file being picked covers a range whose last compaction time to the next level is the old…
24 …he oldest updates in the level, which usually is contains the densest key range. If you have a use…
30 …range for the longest. Usually it is the coldest range. By compacting coldest range first, we leav…
D2017-06-26-17-level-based-changes.markdown10 …on. Since L0 files (unlike files at lower levels) can span the entire key-range, a key might be in…
14 Also, due to how L0 files can span the entire key-range, compaction parallelization is limited. Fil…
22 ![full-range.png](/static/images/compaction/full-range.png)
26 Users may insert their data less uniformly in the key-range. For example, a database may look like …
28 ![part-range-old.png](/static/images/compaction/part-range-old.png)
D2017-09-28-rocksdb-5-8-released.markdown24 * Fix transient reappearance of keys covered by range deletions when memtable prefix bloom filter i…
25 * Fix potentially wrong file smallest key when range deletions separated by snapshot are written to…
/rocksdb-6.9/util/
Drandom_test.cc22 for (int range : {1, 2, 8, 12, 100}) { in TEST()
23 std::vector<int> counts(range, 0); in TEST()
26 ++counts.at(r.Uniform(range)); in TEST()
29 for (int i = 0; i < range; ++i) { in TEST()
39 for (int range : {1, 2, 8, 12, 100, 1234}) { in TEST()
42 for (int i = 0; i < average * range; ++i) { in TEST()
43 if (r.OneIn(range)) { in TEST()
47 if (range == 1) { in TEST()
63 if (r.OneInOpt(range)) { in TEST()
67 if (range < 1) { in TEST()
[all …]
Dhash.h86 inline uint32_t fastrange32(uint32_t hash, uint32_t range) { in fastrange32() argument
87 uint64_t product = uint64_t{range} * hash; in fastrange32()
95 inline size_t fastrange64(uint64_t hash, size_t range) { in fastrange64() argument
98 __uint128_t wide = __uint128_t{range} * hash; in fastrange64()
106 uint64_t range64 = range; // ok to shift by 32, even if size_t is 32-bit in fastrange64()
Dhash_test.cc364 uint32_t fastrange32(uint32_t hash, uint32_t range) { in fastrange32() argument
365 return ROCKSDB_NAMESPACE::fastrange32(hash, range); in fastrange32()
369 size_t fastrange64(uint64_t hash, size_t range) { in fastrange64() argument
370 return ROCKSDB_NAMESPACE::fastrange64(hash, range); in fastrange64()
/rocksdb-6.9/table/block_based/
Dfull_filter_block.cc188 MultiGetRange* range, const SliceTransform* /*prefix_extractor*/, in KeysMayMatch() argument
192 (void)range; in KeysMayMatch()
201 MayMatch(range, no_io, nullptr, lookup_context); in KeysMayMatch()
205 MultiGetRange* range, const SliceTransform* prefix_extractor, in PrefixesMayMatch() argument
209 (void)range; in PrefixesMayMatch()
213 MayMatch(range, no_io, prefix_extractor, lookup_context); in PrefixesMayMatch()
217 MultiGetRange* range, bool no_io, const SliceTransform* prefix_extractor, in MayMatch() argument
221 const Status s = GetOrReadFilterBlock(no_io, range->begin()->get_context, in MayMatch()
244 MultiGetRange filter_range(*range, range->begin(), range->end()); in MayMatch()
263 range->SkipKey(iter); in MayMatch()
Dfilter_block.h106 virtual void KeysMayMatch(MultiGetRange* range, in KeysMayMatch() argument
110 for (auto iter = range->begin(); iter != range->end(); ++iter) { in KeysMayMatch()
116 range->SkipKey(iter); in KeysMayMatch()
131 virtual void PrefixesMayMatch(MultiGetRange* range, in PrefixesMayMatch() argument
135 for (auto iter = range->begin(); iter != range->end(); ++iter) { in PrefixesMayMatch()
143 range->SkipKey(iter); in PrefixesMayMatch()
Dfull_filter_block.h108 void KeysMayMatch(MultiGetRange* range,
113 void PrefixesMayMatch(MultiGetRange* range,
128 void MayMatch(MultiGetRange* range, bool no_io,
/rocksdb-6.9/tools/block_cache_analyzer/
Dblock_cache_trace_analyzer_plot.py29 for i in range(n_colors):
138 for i in range(len(label)):
160 for i in range(1, len(data_rows[0])):
163 for i in range(1, len(data_rows)):
164 for j in range(len(data_rows[i])):
182 for i in range(1, len(data_rows)):
185 for i in range(1, len(data_rows[0])):
187 for i in range(1, len(data_rows)):
188 for j in range(len(data_rows[i])):
284 for i in range(0, len(label_stats)):
[all …]
Dblock_cache_pysim.py187 for i in range(len(self.table)):
197 for i in range(len(self.table)):
246 for i in range(len(self.table)):
250 for j in range(len(entries)):
347 for i in range(len(miss_bytes)):
416 for i in range(len(policies)):
1023 for _i in range(len(policies)):
1069 for i in range(len(self.policies)):
1083 for a in range(len(self.policies)):
1890 for i in range(len(cache_stats)):
[all …]
Dblock_cache_pysim_test.py35 for i in range(data_size):
37 for i in range(data_size):
39 for i in range(data_size):
41 for i in range(data_size):
47 for i in range(n):
72 for _i in range(10):
296 for i in range(n):
362 for i in range(n):
519 for i in range(6, 100):
531 cache, [kSampleSize, 103, 99, [i for i in range(101 - kSampleSize, 101)], []]
/rocksdb-6.9/tools/
Dcheck_format_compatible.sh31 for i in range(1,1024):
33 for j in range(1, random.randint(1,32)):
36 for j in range(1, random.randint(0,128)):
39 for j in range(1, random.randint(1, 5)):
50 for i in range(0,10):
Dwrite_stress_runner.py15 possible_runtimes_sec = list(range(1, 10)) + list(range(1, 20)) + [100, 1000]
Ddb_crashtest.py90 "index_block_restart_interval": lambda: random.choice(range(1, 16)),
98 [t * 16384 if t < 3 else 1024 * 1024 * 1024 for t in range(1, 30)]),
101 [1 if t == 0 else 0 for t in range(0, 20)]),
/rocksdb-6.9/tools/advisor/test/
Dtest_db_stats_fetcher.py116 for ix in range(5):
119 timestamps = [timestamp+(ix*10) for ix in range(1, 5, 1)]
120 values = [val for val in range(2, 15, 4)]
121 inner_dict = {timestamps[ix]: values[ix] for ix in range(4)}
/rocksdb-6.9/include/rocksdb/
Ddb.h1003 const Range* range, int n,
1010 const Range* range, int n, uint64_t* sizes,
1017 GetApproximateSizes(options, column_family, range, n, sizes);
1019 virtual void GetApproximateSizes(const Range* range, int n, uint64_t* sizes,
1027 const Range& range,
1030 virtual void GetApproximateMemTableStats(const Range& range, in GetApproximateMemTableStats() argument
1033 GetApproximateMemTableStats(DefaultColumnFamily(), range, count, size); in GetApproximateMemTableStats()
1038 const Range* range, int n, uint64_t* sizes, bool include_memtable) { in GetApproximateSizes() argument
1046 ColumnFamilyHandle* column_family, const Range* range, int n, in GetApproximateSizes() argument
1052 GetApproximateSizes(column_family, range, n, sizes, include_flags); in GetApproximateSizes()
[all …]
/rocksdb-6.9/tools/rdb/
DAPI.md105 # Compact the underlying storage for a given range.
107 # In addition to the endpoints of the range, the method is overloaded to
110 # begin (string) - First key in the range to compact.
111 # end (string) - Last key in the range to compact.
116 # column_family (string) - Which column family to compact the range in.
/rocksdb-6.9/table/
Dmultiget_context.h156 Iterator(const Range* range, size_t idx) in Iterator() argument
157 : range_(range), ctx_(range->ctx_), index_(idx) { in Iterator()
/rocksdb-6.9/db/
Dconvenience.cc24 RangePtr range(begin, end); in DeleteFilesInRange() local
25 return DeleteFilesInRanges(db, column_family, &range, 1, include_end); in DeleteFilesInRange()
Dversion_set.cc365 range_(range), in FilePickerMultiGet()
366 batch_iter_(range->begin()), in FilePickerMultiGet()
367 batch_iter_prev_(range->begin()), in FilePickerMultiGet()
369 current_level_range_(*range, range->begin(), range->end()), in FilePickerMultiGet()
370 current_file_range_(*range, range->begin(), range->end()), in FilePickerMultiGet()
1895 for (auto iter = range->begin(); iter != range->end(); ++iter) { in MultiGet()
1911 for (auto iter = range->begin(); iter != range->end(); in MultiGet()
1916 MultiGetRange file_picker_range(*range, range->begin(), range->end()); in MultiGet()
2025 for (auto iter = range->begin(); iter != range->end(); ++iter) { in MultiGet()
2037 range->MarkKeyDone(iter); in MultiGet()
[all …]
/rocksdb-6.9/include/rocksdb/utilities/
Dstackable_db.h236 const Range& range, in GetApproximateMemTableStats() argument
239 return db_->GetApproximateMemTableStats(column_family, range, count, size); in GetApproximateMemTableStats()
428 ColumnFamilyHandle* column_family, const Range* range, std::size_t n, in GetPropertiesOfTablesInRange() argument
430 return db_->GetPropertiesOfTablesInRange(column_family, range, n, props); in GetPropertiesOfTablesInRange()
/rocksdb-6.9/java/benchmark/src/main/java/org/rocksdb/benchmark/
DDbBenchmark.java205 protected void getRandomKey(byte[] key, long range) { in getRandomKey() argument
206 generateKeyFromLong(key, Math.abs(rand_.nextLong() % range)); in getRandomKey()
281 abstract protected void getKey(byte[] key, long id, long range); in getKey() argument
302 @Override protected void getKey(byte[] key, long id, long range) { in getKey() argument
322 @Override protected void getKey(byte[] key, long id, long range) { in getKey() argument
323 getRandomKey(key, range); in getKey()
345 @Override protected void getKey(byte[] key, long id, long range) { in getKey() argument

123