Bloom filter loading and saving is slow with single-bit access to the bitmap, causing latency spikes of ~100ms for 20MB sstables. Larger sstables will be much worse. Fix by using the newly introduced large_bitmap bulk load/save methods. With this, the maximum observed task latency was 16ms. Fixes #299 (partially at least; larger bitmaps may require more work still).
51 lines
1.5 KiB
C++
51 lines
1.5 KiB
C++
/*
|
|
* Copyright (C) 2015 Cloudius Systems, Ltd.
|
|
*
|
|
*/
|
|
#include "core/future.hh"
|
|
#include "core/future-util.hh"
|
|
#include "core/shared_ptr.hh"
|
|
#include "core/do_with.hh"
|
|
#include <seastar/core/align.hh>
|
|
|
|
#include "types.hh"
|
|
#include "sstables.hh"
|
|
#include "utils/bloom_filter.hh"
|
|
|
|
namespace sstables {
|
|
|
|
future<> sstable::read_filter() {
|
|
if (!has_component(sstable::component_type::Filter)) {
|
|
_filter = std::make_unique<utils::filter::always_present_filter>();
|
|
return make_ready_future<>();
|
|
}
|
|
|
|
return do_with(sstables::filter(), [this] (auto& filter) {
|
|
return this->read_simple<sstable::component_type::Filter>(filter).then([this, &filter] {
|
|
large_bitset bs(filter.buckets.elements.size() * 64);
|
|
bs.load(filter.buckets.elements.begin(), filter.buckets.elements.end());
|
|
_filter = utils::filter::create_filter(filter.hashes, std::move(bs));
|
|
}).then([this] {
|
|
return engine().file_size(this->filename(sstable::component_type::Filter));
|
|
});
|
|
}).then([this] (auto size) {
|
|
_filter_file_size = size;
|
|
});
|
|
}
|
|
|
|
void sstable::write_filter() {
|
|
if (!has_component(sstable::component_type::Filter)) {
|
|
return;
|
|
}
|
|
|
|
auto f = static_cast<utils::filter::murmur3_bloom_filter *>(_filter.get());
|
|
|
|
auto&& bs = f->bits();
|
|
std::deque<uint64_t> v(align_up(bs.size(), size_t(64)) / 64);
|
|
bs.save(v.begin());
|
|
auto filter = sstables::filter(f->num_hashes(), std::move(v));
|
|
write_simple<sstable::component_type::Filter>(filter);
|
|
}
|
|
|
|
}
|