| /rocksdb-6.9/test_util/ |
| D | sync_point_impl.cc | 66 bool SyncPoint::Data::PredecessorsAllCleared(const std::string& point) { in PredecessorsAllCleared() argument
67 for (const auto& pred : predecessors_[point]) { in PredecessorsAllCleared()
75 void SyncPoint::Data::ClearCallBack(const std::string& point) { in ClearCallBack() argument
80 callbacks_.erase(point); in ClearCallBack()
91 void SyncPoint::Data::Process(const std::string& point, void* cb_arg) { in Process() argument
99 auto marker_iter = markers_.find(point); in Process()
106 if (DisabledByMarker(point, thread_id)) { in Process()
110 while (!PredecessorsAllCleared(point)) { in Process()
112 if (DisabledByMarker(point, thread_id)) { in Process()
117 auto callback_pair = callbacks_.find(point); in Process()
[all …]
|
| D | sync_point_impl.h | 46 bool PredecessorsAllCleared(const std::string& point);
47 void SetCallBack(const std::string& point, in SetCallBack()
50 callbacks_[point] = callback; in SetCallBack()
53 void ClearCallBack(const std::string& point);
65 bool DisabledByMarker(const std::string& point, in DisabledByMarker()
67 auto marked_point_iter = marked_thread_id_.find(point); in DisabledByMarker()
71 void Process(const std::string& point, void* cb_arg);
|
| D | sync_point.cc | 36 void SyncPoint::SetCallBack(const std::string& point, in SetCallBack() argument
38 impl_->SetCallBack(point, callback); in SetCallBack()
41 void SyncPoint::ClearCallBack(const std::string& point) { in ClearCallBack() argument
42 impl_->ClearCallBack(point); in ClearCallBack()
61 void SyncPoint::Process(const std::string& point, void* cb_arg) { in Process() argument
62 impl_->Process(point, cb_arg); in Process()
|
| D | sync_point.h | 91 void SetCallBack(const std::string& point,
95 void ClearCallBack(const std::string& point);
112 void Process(const std::string& point, void* cb_arg = nullptr);
|
| /rocksdb-6.9/docs/_posts/ |
| D | 2018-08-23-data-block-hash-index.markdown | 7 …e benefit of both reducing the CPU util and increasing the throughput for point lookup queries wit…
11 Benchmarks with `db_bench` show the CPU utilization of one of the main functions in the point look…
41 … a restart point, is stored in an array called restart interval index or binary seek index. RocksD…
54 …e less the util ratio, the less hash collision, and the less chance for a point lookup falls back …
87 …r number of restart intervals, the hash index will not be created and the point lookup will be don…
89 Data block hash index only supports point lookup. We do not support range lookup. Range lookup requ…
106 …. We observe that the CPU utilization of one of the main functions in the point lookup code path, …
|
| D | 2014-09-12-cuckoo.markdown | 12 …point lookups. The new format was built for applications which require very high point lookup rate…
21 * Get an end to end point lookup rate of at least 4 Mqps
|
| D | 2018-11-21-delete-range.markdown | 120 periodically undergo compaction which rewrites SSTs with point data and range
128 interleave the range tombstone with point data in a way that we would be able to
134 *Lifetime of point keys and range tombstones in RocksDB*
146 side, hoping a good caching strategy could optimize this at some future point.
151 In point lookups, we aggregate range tombstones in an unordered vector as we
187 between consecutive point keys).
215 When an SST file is opened, its range tombstones are fragmented and cached. For point
235 To understand the performance of this new design, we used `db_bench` to compare point lookup, short…
|
| D | 2015-11-10-use-checkpoints-for-efficient-snapshots.markdown | 10 …tory. Checkpoints can be used as a point in time snapshot, which can be opened Read-only to query …
|
| D | 2014-04-21-indexing-sst-files-for-better-lookup-performance.markdown | 26 …point to a range of files on level 2. For example, file 1 on level 1 points to file 3 (on level 2)…
|
| D | 2017-06-29-rocksdb-5-5-1-released.markdown | 12 * Introduce WriteBatch::PopSavePoint to pop the most recent save point explicitly.
|
| D | 2017-08-24-pinnableslice.markdown | 2 title: PinnableSlice; less memcpy with point lookups
|
| D | 2019-03-08-format-version-4.markdown | 27 …ever the shared_size is 0, which included the first entry in each restart point. Otherwise the for…
|
| D | 2014-09-12-new-bloom-filter-format.markdown | 21 … for the key. If not, we would return directly. So it could help speed up point look up operation …
|
| D | 2017-05-12-partitioned-index-filter.markdown | 18 …and its large size is not helping in reducing the IO cost. While a simple point lookup might need …
|
| /rocksdb-6.9/CMakeFiles/Export/7a006447cadce6044e9a8143a913fd66/ |
| D | RocksDBTargets-release.cmake | 28 # Commands beyond this point should not need to know the version.
|
| D | RocksDBTargets-relwithdebinfo.cmake | 28 # Commands beyond this point should not need to know the version.
|
| D | RocksDBTargets.cmake | 113 # Commands beyond this point should not need to know the version.
|
| /rocksdb-6.9/ |
| D | thirdparty.inc | 7 # Set environment variable THIRDPARTY_HOME to point to your third party libraries home (Unix style …
|
| D | USERS.md | 104 …iki/Entity%E2%80%93attribute%E2%80%93value_model) index storage to enable point-in-time bitemporal…
|
| D | HISTORY.md | 347 * Fix incorrect `NotFound` point lookup result when querying the endpoint of a file that has been e…
407 * Remove sync point in Block destructor.
418 * Add hash index support to data blocks, which helps reducing the cpu utilization of point-lookup o…
576 * Fix a potential data inconsistency issue during point-in-time recovery. `DB:Open()` will abort if…
637 * Introduce WriteBatch::PopSavePoint to pop the most recent save point explicitly.
740 * Block cache mid-point insertion, where index and filter block are inserted into LRU block cache w…
1058 … but it does not have any effect. We plan to completely remove it at some point, so we ask users t…
|
| D | WINDOWS_PORT.md | 34 …party.inc that also resides on the top level. This file must be edited to point to actual third pa…
|