Summary: This diff adds CompactOnDeletionCollector in utilities/table_properties_collectors, which applies a sliding window to a sst file and mark this file as need-compaction when it observe enough deletion entries within the consecutive keys covered by the sliding window. Test Plan: compact_on_deletion_collector_test Reviewers: igor, anthony, IslamAbdelRahman, kradhakrishnan, yoshinorim, sdong Reviewed By: sdong Subscribers: maykov, dhruba Differential Revision: https://reviews.facebook.net/D41175
94 lines
3.1 KiB
C++
94 lines
3.1 KiB
C++
// Copyright (c) 2015, Facebook, Inc. All rights reserved.
|
|
// This source code is licensed under the BSD-style license found in the
|
|
// LICENSE file in the root directory of this source tree. An additional grant
|
|
// of patent rights can be found in the PATENTS file in the same directory.
|
|
|
|
#ifndef ROCKSDB_LITE
|
|
#include <memory>
|
|
|
|
#include "rocksdb/utilities/table_properties_collectors.h"
|
|
#include "utilities/table_properties_collectors/compact_on_deletion_collector.h"
|
|
|
|
namespace rocksdb {
|
|
|
|
CompactOnDeletionCollector::CompactOnDeletionCollector(
|
|
size_t sliding_window_size,
|
|
size_t deletion_trigger) {
|
|
deletion_trigger_ = deletion_trigger;
|
|
|
|
// First, compute the number of keys in each bucket.
|
|
bucket_size_ =
|
|
(sliding_window_size + kNumBuckets - 1) / kNumBuckets;
|
|
assert(bucket_size_ > 0U);
|
|
|
|
Reset();
|
|
}
|
|
|
|
void CompactOnDeletionCollector::Reset() {
|
|
for (int i = 0; i < kNumBuckets; ++i) {
|
|
num_deletions_in_buckets_[i] = 0;
|
|
}
|
|
current_bucket_ = 0;
|
|
num_keys_in_current_bucket_ = 0;
|
|
num_deletions_in_observation_window_ = 0;
|
|
need_compaction_ = false;
|
|
}
|
|
|
|
// AddUserKey() will be called when a new key/value pair is inserted into the
|
|
// table.
|
|
// @params key the user key that is inserted into the table.
|
|
// @params value the value that is inserted into the table.
|
|
// @params file_size file size up to now
|
|
Status CompactOnDeletionCollector::AddUserKey(
|
|
const Slice& key, const Slice& value,
|
|
EntryType type, SequenceNumber seq,
|
|
uint64_t file_size) {
|
|
if (need_compaction_) {
|
|
// If the output file already needs to be compacted, skip the check.
|
|
return Status::OK();
|
|
}
|
|
|
|
if (num_keys_in_current_bucket_ == bucket_size_) {
|
|
// When the current bucket is full, advance the cursor of the
|
|
// ring buffer to the next bucket.
|
|
current_bucket_ = (current_bucket_ + 1) % kNumBuckets;
|
|
|
|
// Update the current count of observed deletion keys by excluding
|
|
// the number of deletion keys in the oldest bucket in the
|
|
// observation window.
|
|
assert(num_deletions_in_observation_window_ >=
|
|
num_deletions_in_buckets_[current_bucket_]);
|
|
num_deletions_in_observation_window_ -=
|
|
num_deletions_in_buckets_[current_bucket_];
|
|
num_deletions_in_buckets_[current_bucket_] = 0;
|
|
num_keys_in_current_bucket_ = 0;
|
|
}
|
|
|
|
num_keys_in_current_bucket_++;
|
|
if (type == kEntryDelete) {
|
|
num_deletions_in_observation_window_++;
|
|
num_deletions_in_buckets_[current_bucket_]++;
|
|
if (num_deletions_in_observation_window_ >= deletion_trigger_) {
|
|
need_compaction_ = true;
|
|
}
|
|
}
|
|
return Status::OK();
|
|
}
|
|
|
|
TablePropertiesCollector* CompactOnDeletionCollectorFactory::
|
|
CreateTablePropertiesCollector() {
|
|
return new CompactOnDeletionCollector(
|
|
sliding_window_size_, deletion_trigger_);
|
|
}
|
|
|
|
std::shared_ptr<TablePropertiesCollectorFactory>
|
|
NewCompactOnDeletionCollectorFactory(
|
|
size_t sliding_window_size,
|
|
size_t deletion_trigger) {
|
|
return std::shared_ptr<TablePropertiesCollectorFactory>(
|
|
new CompactOnDeletionCollectorFactory(
|
|
sliding_window_size, deletion_trigger));
|
|
}
|
|
} // namespace rocksdb
|
|
#endif // !ROCKSDB_LITE
|