Add a PerfContext counter for merge operands applied in point lookups (#11284)

Summary:
The existing PerfContext counter `internal_merge_count` only tracks the
Merge operands applied during range scans. The patch adds a new counter
called `internal_merge_count_point_lookups` to track the same metric
for point lookups (`Get` / `MultiGet` / `GetEntity` / `MultiGetEntity`), and
also fixes a couple of cases in the iterator where the existing counter wasn't
updated.

Pull Request resolved: https://github.com/facebook/rocksdb/pull/11284

Test Plan: `make check`

Reviewed By: jowlyzhang

Differential Revision: D43926082

Pulled By: ltamasi

fbshipit-source-id: 321566d8b4cf0a3b6c9b73b7a5c984fb9bb492e9
oxigraph-8.1.1
Levi Tamasi 2 years ago committed by Facebook GitHub Bot
parent 6c65bf1743
commit 1d52438504
  1. 2
      HISTORY.md
  2. 4
      db/db_iter.cc
  3. 2
      db/memtable.cc
  4. 153
      db/perf_context_test.cc
  5. 7
      include/rocksdb/perf_context.h
  6. 5
      monitoring/perf_context.cc
  7. 2
      table/get_context.cc

@ -5,9 +5,11 @@
### Bug Fixes ### Bug Fixes
* Fixed an issue for backward iteration when user defined timestamp is enabled in combination with BlobDB. * Fixed an issue for backward iteration when user defined timestamp is enabled in combination with BlobDB.
* Fixed a couple of cases where a Merge operand encountered during iteration wasn't reflected in the `internal_merge_count` PerfContext counter.
### New Features ### New Features
* Add statistics rocksdb.secondary.cache.filter.hits, rocksdb.secondary.cache.index.hits, and rocksdb.secondary.cache.filter.hits * Add statistics rocksdb.secondary.cache.filter.hits, rocksdb.secondary.cache.index.hits, and rocksdb.secondary.cache.filter.hits
* Added a new PerfContext counter `internal_merge_count_point_lookups` which tracks the number of Merge operands applied while serving point lookup queries.
## 8.0.0 (02/19/2023) ## 8.0.0 (02/19/2023)
### Behavior changes ### Behavior changes

@ -521,6 +521,8 @@ bool DBIter::MergeValuesNewToOld() {
// Start the merge process by pushing the first operand // Start the merge process by pushing the first operand
merge_context_.PushOperand( merge_context_.PushOperand(
iter_.value(), iter_.iter()->IsValuePinned() /* operand_pinned */); iter_.value(), iter_.iter()->IsValuePinned() /* operand_pinned */);
PERF_COUNTER_ADD(internal_merge_count, 1);
TEST_SYNC_POINT("DBIter::MergeValuesNewToOld:PushedFirstOperand"); TEST_SYNC_POINT("DBIter::MergeValuesNewToOld:PushedFirstOperand");
ParsedInternalKey ikey; ParsedInternalKey ikey;
@ -1159,6 +1161,8 @@ bool DBIter::FindValueForCurrentKeyUsingSeek() {
merge_context_.Clear(); merge_context_.Clear();
merge_context_.PushOperand( merge_context_.PushOperand(
iter_.value(), iter_.iter()->IsValuePinned() /* operand_pinned */); iter_.value(), iter_.iter()->IsValuePinned() /* operand_pinned */);
PERF_COUNTER_ADD(internal_merge_count, 1);
while (true) { while (true) {
iter_.Next(); iter_.Next();

@ -1230,6 +1230,8 @@ static bool SaveValue(void* arg, const char* entry) {
*(s->merge_in_progress) = true; *(s->merge_in_progress) = true;
merge_context->PushOperand( merge_context->PushOperand(
v, s->inplace_update_support == false /* operand_pinned */); v, s->inplace_update_support == false /* operand_pinned */);
PERF_COUNTER_ADD(internal_merge_count_point_lookups, 1);
if (s->do_merge && merge_operator->ShouldMerge( if (s->do_merge && merge_operator->ShouldMerge(
merge_context->GetOperandsDirectionBackward())) { merge_context->GetOperandsDirectionBackward())) {
if (s->value || s->columns) { if (s->value || s->columns) {

@ -964,6 +964,159 @@ TEST_F(PerfContextTest, CPUTimer) {
ASSERT_EQ(count, get_perf_context()->iter_seek_cpu_nanos); ASSERT_EQ(count, get_perf_context()->iter_seek_cpu_nanos);
} }
} }
TEST_F(PerfContextTest, MergeOperandCount) {
ASSERT_OK(DestroyDB(kDbName, Options()));
DB* db = nullptr;
Options options;
options.create_if_missing = true;
options.merge_operator = MergeOperators::CreateStringAppendOperator();
ASSERT_OK(DB::Open(options, kDbName, &db));
std::unique_ptr<DB> db_guard(db);
constexpr size_t num_keys = 3;
const std::string key_prefix("key");
const std::string value_prefix("value");
std::vector<std::string> keys;
keys.reserve(num_keys);
for (size_t i = 0; i < num_keys; ++i) {
keys.emplace_back(key_prefix + std::to_string(i));
}
// Write three keys with one Put each followed by 1, 2, and 3
// Merge operations respectively.
constexpr size_t total_merges = num_keys * (num_keys + 1) / 2;
std::vector<ManagedSnapshot> snapshots;
snapshots.reserve(total_merges);
for (size_t i = 0; i < num_keys; ++i) {
const std::string suffix = std::to_string(i);
const std::string value = value_prefix + suffix;
ASSERT_OK(db->Put(WriteOptions(), keys[i], value));
for (size_t j = 0; j <= i; ++j) {
// Take a snapshot before each Merge so they are preserved and not
// collapsed during flush.
snapshots.emplace_back(db);
ASSERT_OK(db->Merge(WriteOptions(), keys[i], value + std::to_string(j)));
}
}
auto verify = [&]() {
get_perf_context()->Reset();
for (size_t i = 0; i < num_keys; ++i) {
// Get
{
PinnableSlice result;
ASSERT_OK(db->Get(ReadOptions(), db->DefaultColumnFamily(), keys[i],
&result));
ASSERT_EQ(get_perf_context()->internal_merge_count_point_lookups,
i + 1);
get_perf_context()->Reset();
}
// GetEntity
{
PinnableWideColumns result;
ASSERT_OK(db->GetEntity(ReadOptions(), db->DefaultColumnFamily(),
keys[i], &result));
ASSERT_EQ(get_perf_context()->internal_merge_count_point_lookups,
i + 1);
get_perf_context()->Reset();
}
}
{
std::vector<Slice> key_slices;
key_slices.reserve(num_keys);
for (size_t i = 0; i < num_keys; ++i) {
key_slices.emplace_back(keys[i]);
}
// MultiGet
{
std::vector<PinnableSlice> results(num_keys);
std::vector<Status> statuses(num_keys);
db->MultiGet(ReadOptions(), db->DefaultColumnFamily(), num_keys,
&key_slices[0], &results[0], &statuses[0]);
for (size_t i = 0; i < num_keys; ++i) {
ASSERT_OK(statuses[i]);
}
ASSERT_EQ(get_perf_context()->internal_merge_count_point_lookups,
total_merges);
get_perf_context()->Reset();
}
// MultiGetEntity
{
std::vector<PinnableWideColumns> results(num_keys);
std::vector<Status> statuses(num_keys);
db->MultiGetEntity(ReadOptions(), db->DefaultColumnFamily(), num_keys,
&key_slices[0], &results[0], &statuses[0]);
for (size_t i = 0; i < num_keys; ++i) {
ASSERT_OK(statuses[i]);
}
ASSERT_EQ(get_perf_context()->internal_merge_count_point_lookups,
total_merges);
get_perf_context()->Reset();
}
}
std::unique_ptr<Iterator> it(db->NewIterator(ReadOptions()));
// Forward iteration
{
size_t i = 0;
for (it->SeekToFirst(); it->Valid(); it->Next(), ++i) {
ASSERT_EQ(it->key(), keys[i]);
ASSERT_EQ(get_perf_context()->internal_merge_count, i + 1);
get_perf_context()->Reset();
}
}
// Backward iteration
{
size_t i = num_keys - 1;
for (it->SeekToLast(); it->Valid(); it->Prev(), --i) {
ASSERT_EQ(it->key(), keys[i]);
ASSERT_EQ(get_perf_context()->internal_merge_count, i + 1);
get_perf_context()->Reset();
}
}
};
// Verify counters when reading from memtable
verify();
// Verify counters when reading from table files
db->Flush(FlushOptions());
verify();
}
} // namespace ROCKSDB_NAMESPACE } // namespace ROCKSDB_NAMESPACE
int main(int argc, char** argv) { int main(int argc, char** argv) {

@ -135,9 +135,14 @@ struct PerfContext {
// than the snapshot that iterator is using. // than the snapshot that iterator is using.
// //
uint64_t internal_recent_skipped_count; uint64_t internal_recent_skipped_count;
// How many values were fed into merge operator by iterators. // How many merge operands were fed into the merge operator by iterators.
// Note: base values are not included in the count.
// //
uint64_t internal_merge_count; uint64_t internal_merge_count;
// How many merge operands were fed into the merge operator by point lookups.
// Note: base values are not included in the count.
//
uint64_t internal_merge_count_point_lookups;
// Number of times we reseeked inside a merging iterator, specifically to skip // Number of times we reseeked inside a merging iterator, specifically to skip
// after or before a range of keys covered by a range deletion in a newer LSM // after or before a range of keys covered by a range deletion in a newer LSM
// component. // component.

@ -69,6 +69,7 @@ PerfContext::PerfContext(const PerfContext& other) {
internal_delete_skipped_count = other.internal_delete_skipped_count; internal_delete_skipped_count = other.internal_delete_skipped_count;
internal_recent_skipped_count = other.internal_recent_skipped_count; internal_recent_skipped_count = other.internal_recent_skipped_count;
internal_merge_count = other.internal_merge_count; internal_merge_count = other.internal_merge_count;
internal_merge_count_point_lookups = other.internal_merge_count_point_lookups;
internal_range_del_reseek_count = other.internal_range_del_reseek_count; internal_range_del_reseek_count = other.internal_range_del_reseek_count;
write_wal_time = other.write_wal_time; write_wal_time = other.write_wal_time;
get_snapshot_time = other.get_snapshot_time; get_snapshot_time = other.get_snapshot_time;
@ -188,6 +189,7 @@ PerfContext::PerfContext(PerfContext&& other) noexcept {
internal_delete_skipped_count = other.internal_delete_skipped_count; internal_delete_skipped_count = other.internal_delete_skipped_count;
internal_recent_skipped_count = other.internal_recent_skipped_count; internal_recent_skipped_count = other.internal_recent_skipped_count;
internal_merge_count = other.internal_merge_count; internal_merge_count = other.internal_merge_count;
internal_merge_count_point_lookups = other.internal_merge_count_point_lookups;
internal_range_del_reseek_count = other.internal_range_del_reseek_count; internal_range_del_reseek_count = other.internal_range_del_reseek_count;
write_wal_time = other.write_wal_time; write_wal_time = other.write_wal_time;
get_snapshot_time = other.get_snapshot_time; get_snapshot_time = other.get_snapshot_time;
@ -309,6 +311,7 @@ PerfContext& PerfContext::operator=(const PerfContext& other) {
internal_delete_skipped_count = other.internal_delete_skipped_count; internal_delete_skipped_count = other.internal_delete_skipped_count;
internal_recent_skipped_count = other.internal_recent_skipped_count; internal_recent_skipped_count = other.internal_recent_skipped_count;
internal_merge_count = other.internal_merge_count; internal_merge_count = other.internal_merge_count;
internal_merge_count_point_lookups = other.internal_merge_count_point_lookups;
internal_range_del_reseek_count = other.internal_range_del_reseek_count; internal_range_del_reseek_count = other.internal_range_del_reseek_count;
write_wal_time = other.write_wal_time; write_wal_time = other.write_wal_time;
get_snapshot_time = other.get_snapshot_time; get_snapshot_time = other.get_snapshot_time;
@ -422,6 +425,7 @@ void PerfContext::Reset() {
internal_delete_skipped_count = 0; internal_delete_skipped_count = 0;
internal_recent_skipped_count = 0; internal_recent_skipped_count = 0;
internal_merge_count = 0; internal_merge_count = 0;
internal_merge_count_point_lookups = 0;
internal_range_del_reseek_count = 0; internal_range_del_reseek_count = 0;
write_wal_time = 0; write_wal_time = 0;
@ -556,6 +560,7 @@ std::string PerfContext::ToString(bool exclude_zero_counters) const {
PERF_CONTEXT_OUTPUT(internal_delete_skipped_count); PERF_CONTEXT_OUTPUT(internal_delete_skipped_count);
PERF_CONTEXT_OUTPUT(internal_recent_skipped_count); PERF_CONTEXT_OUTPUT(internal_recent_skipped_count);
PERF_CONTEXT_OUTPUT(internal_merge_count); PERF_CONTEXT_OUTPUT(internal_merge_count);
PERF_CONTEXT_OUTPUT(internal_merge_count_point_lookups);
PERF_CONTEXT_OUTPUT(internal_range_del_reseek_count); PERF_CONTEXT_OUTPUT(internal_range_del_reseek_count);
PERF_CONTEXT_OUTPUT(write_wal_time); PERF_CONTEXT_OUTPUT(write_wal_time);
PERF_CONTEXT_OUTPUT(get_snapshot_time); PERF_CONTEXT_OUTPUT(get_snapshot_time);

@ -442,6 +442,8 @@ bool GetContext::SaveValue(const ParsedInternalKey& parsed_key,
state_ = kMerge; state_ = kMerge;
// value_pinner is not set from plain_table_reader.cc for example. // value_pinner is not set from plain_table_reader.cc for example.
push_operand(value, value_pinner); push_operand(value, value_pinner);
PERF_COUNTER_ADD(internal_merge_count_point_lookups, 1);
if (do_merge_ && merge_operator_ != nullptr && if (do_merge_ && merge_operator_ != nullptr &&
merge_operator_->ShouldMerge( merge_operator_->ShouldMerge(
merge_context_->GetOperandsDirectionBackward())) { merge_context_->GetOperandsDirectionBackward())) {

Loading…
Cancel
Save