Add OpenAndTrimHistory API to support trimming data with specified timestamp (#9410)
Summary: As disscussed in (https://github.com/facebook/rocksdb/issues/9223), Here added a new API named DB::OpenAndTrimHistory, this API will open DB and trim data to the timestamp specofied by **trim_ts** (The data with newer timestamp than specified trim bound will be removed). This API should only be used at a timestamp-enabled db instance recovery. And this PR implemented a new iterator named HistoryTrimmingIterator to support trimming history with a new API named DB::OpenAndTrimHistory. HistoryTrimmingIterator wrapped around the underlying InternalITerator such that keys whose timestamps newer than **trim_ts** should not be returned to the compaction iterator while **trim_ts** is not null. Pull Request resolved: https://github.com/facebook/rocksdb/pull/9410 Reviewed By: ltamasi Differential Revision: D34410207 Pulled By: riversand963 fbshipit-source-id: e54049dc234eccd673244c566b15df58df5a6236main
slk
3 years ago
committed by
Facebook GitHub Bot
parent
e4c87773e1
commit
95305c44a1
@ -0,0 +1,91 @@ |
|||||||
|
// Copyright (c) 2011-present, Facebook, Inc. All rights reserved.
|
||||||
|
// This source code is licensed under both the GPLv2 (found in the
|
||||||
|
// COPYING file in the root directory) and Apache 2.0 License
|
||||||
|
// (found in the LICENSE.Apache file in the root directory).
|
||||||
|
#pragma once |
||||||
|
|
||||||
|
#include <string> |
||||||
|
#include <vector> |
||||||
|
|
||||||
|
#include "db/dbformat.h" |
||||||
|
#include "rocksdb/iterator.h" |
||||||
|
#include "rocksdb/slice.h" |
||||||
|
#include "table/internal_iterator.h" |
||||||
|
|
||||||
|
namespace ROCKSDB_NAMESPACE { |
||||||
|
|
||||||
|
class HistoryTrimmingIterator : public InternalIterator { |
||||||
|
public: |
||||||
|
explicit HistoryTrimmingIterator(InternalIterator* input, |
||||||
|
const Comparator* cmp, const std::string& ts) |
||||||
|
: input_(input), filter_ts_(ts), cmp_(cmp) { |
||||||
|
assert(cmp_->timestamp_size() > 0 && !ts.empty()); |
||||||
|
} |
||||||
|
|
||||||
|
bool filter() const { |
||||||
|
if (!input_->Valid()) { |
||||||
|
return true; |
||||||
|
} |
||||||
|
Slice current_ts = ExtractTimestampFromKey(key(), cmp_->timestamp_size()); |
||||||
|
return cmp_->CompareTimestamp(current_ts, Slice(filter_ts_)) <= 0; |
||||||
|
} |
||||||
|
|
||||||
|
bool Valid() const override { return input_->Valid(); } |
||||||
|
|
||||||
|
void SeekToFirst() override { |
||||||
|
input_->SeekToFirst(); |
||||||
|
while (!filter()) { |
||||||
|
input_->Next(); |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
void SeekToLast() override { |
||||||
|
input_->SeekToLast(); |
||||||
|
while (!filter()) { |
||||||
|
input_->Prev(); |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
void Seek(const Slice& target) override { |
||||||
|
input_->Seek(target); |
||||||
|
while (!filter()) { |
||||||
|
input_->Next(); |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
void SeekForPrev(const Slice& target) override { |
||||||
|
input_->SeekForPrev(target); |
||||||
|
while (!filter()) { |
||||||
|
input_->Prev(); |
||||||
|
} |
||||||
|
} |
||||||
|
|
||||||
|
void Next() override { |
||||||
|
do { |
||||||
|
input_->Next(); |
||||||
|
} while (!filter()); |
||||||
|
} |
||||||
|
|
||||||
|
void Prev() override { |
||||||
|
do { |
||||||
|
input_->Prev(); |
||||||
|
} while (!filter()); |
||||||
|
} |
||||||
|
|
||||||
|
Slice key() const override { return input_->key(); } |
||||||
|
|
||||||
|
Slice value() const override { return input_->value(); } |
||||||
|
|
||||||
|
Status status() const override { return input_->status(); } |
||||||
|
|
||||||
|
bool IsKeyPinned() const override { return input_->IsKeyPinned(); } |
||||||
|
|
||||||
|
bool IsValuePinned() const override { return input_->IsValuePinned(); } |
||||||
|
|
||||||
|
private: |
||||||
|
InternalIterator* input_; |
||||||
|
const std::string filter_ts_; |
||||||
|
const Comparator* const cmp_; |
||||||
|
}; |
||||||
|
|
||||||
|
} // namespace ROCKSDB_NAMESPACE
|
||||||
Loading…
Reference in new issue