Summary: This patch fixes #7460559. It introduces SingleDelete as a new database operation. This operation can be used to delete keys that were never overwritten (no put following another put of the same key). If an overwritten key is single deleted the behavior is undefined. Single deletion of a non-existent key has no effect but multiple consecutive single deletions are not allowed (see limitations). In contrast to the conventional Delete() operation, the deletion entry is removed along with the value when the two are lined up in a compaction. Note: The semantics are similar to @igor's prototype that allowed to have this behavior on the granularity of a column family ( https://reviews.facebook.net/D42093 ). This new patch, however, is more aggressive when it comes to removing tombstones: It removes the SingleDelete together with the value whenever there is no snapshot between them while the older patch only did this when the sequence number of the deletion was older than the earliest snapshot. Most of the complex additions are in the Compaction Iterator, all other changes should be relatively straightforward. The patch also includes basic support for single deletions in db_stress and db_bench. Limitations: - Not compatible with cuckoo hash tables - Single deletions cannot be used in combination with merges and normal deletions on the same key (other keys are not affected by this) - Consecutive single deletions are currently not allowed (and older version of this patch supported this so it could be resurrected if needed) Test Plan: make all check Reviewers: yhchiang, sdong, rven, anthony, yoshinorim, igor Reviewed By: igor Subscribers: maykov, dhruba, leveldb Differential Revision: https://reviews.facebook.net/D43179main
parent
f35560d00d
commit
014fd55adc
@ -0,0 +1,70 @@ |
||||
// Copyright (c) 2013, 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.
|
||||
|
||||
#include "db/compaction_iterator.h" |
||||
#include "util/testharness.h" |
||||
#include "util/testutil.h" |
||||
|
||||
namespace rocksdb { |
||||
|
||||
class CompactionIteratorTest : public testing::Test { |
||||
public: |
||||
CompactionIteratorTest() : cmp_(BytewiseComparator()), snapshots_({}) {} |
||||
|
||||
void InitIterator(const std::vector<std::string>& ks, |
||||
const std::vector<std::string>& vs, |
||||
SequenceNumber last_sequence) { |
||||
merge_helper_.reset(new MergeHelper(cmp_, nullptr, nullptr, 0U, false)); |
||||
iter_.reset(new test::VectorIterator(ks, vs)); |
||||
iter_->SeekToFirst(); |
||||
c_iter_.reset(new CompactionIterator(iter_.get(), cmp_, merge_helper_.get(), |
||||
last_sequence, &snapshots_, |
||||
Env::Default(), false)); |
||||
} |
||||
|
||||
const Comparator* cmp_; |
||||
std::vector<SequenceNumber> snapshots_; |
||||
std::unique_ptr<MergeHelper> merge_helper_; |
||||
std::unique_ptr<test::VectorIterator> iter_; |
||||
std::unique_ptr<CompactionIterator> c_iter_; |
||||
}; |
||||
|
||||
// It is possible that the output of the compaction iterator is empty even if
|
||||
// the input is not.
|
||||
TEST_F(CompactionIteratorTest, EmptyResult) { |
||||
InitIterator({test::KeyStr("a", 5, kTypeSingleDeletion), |
||||
test::KeyStr("a", 3, kTypeValue)}, |
||||
{"", "val"}, 5); |
||||
c_iter_->SeekToFirst(); |
||||
ASSERT_FALSE(c_iter_->Valid()); |
||||
} |
||||
|
||||
// If there is a corruption after a single deletion, the corrupted key should
|
||||
// be preserved.
|
||||
TEST_F(CompactionIteratorTest, CorruptionAfterSingleDeletion) { |
||||
InitIterator({test::KeyStr("a", 5, kTypeSingleDeletion), |
||||
test::KeyStr("a", 3, kTypeValue, true), |
||||
test::KeyStr("b", 10, kTypeValue)}, |
||||
{"", "val", "val2"}, 10); |
||||
c_iter_->SeekToFirst(); |
||||
ASSERT_TRUE(c_iter_->Valid()); |
||||
ASSERT_EQ(test::KeyStr("a", 5, kTypeSingleDeletion), |
||||
c_iter_->key().ToString()); |
||||
c_iter_->Next(); |
||||
ASSERT_TRUE(c_iter_->Valid()); |
||||
ASSERT_EQ(test::KeyStr("a", 3, kTypeValue, true), c_iter_->key().ToString()); |
||||
c_iter_->Next(); |
||||
ASSERT_TRUE(c_iter_->Valid()); |
||||
ASSERT_EQ(test::KeyStr("b", 10, kTypeValue), c_iter_->key().ToString()); |
||||
c_iter_->Next(); |
||||
ASSERT_FALSE(c_iter_->Valid()); |
||||
} |
||||
|
||||
} // namespace rocksdb
|
||||
|
||||
int main(int argc, char** argv) { |
||||
::testing::InitGoogleTest(&argc, argv); |
||||
return RUN_ALL_TESTS(); |
||||
} |
Loading…
Reference in new issue