0f0076ed5a
Summary: Currently, the in-memory hash index of blockbased table uses a precise hash map to track the prefix to block range mapping. In some use cases, especially when prefix itself is big, the memory overhead becomes a problem. This diff introduces a fixed hash bucket array that does not store the prefix and allows prefix collision, which is similar to the plaintable hash index, in order to reduce the memory consumption. Just a quick draft, still testing and refining. Test Plan: unit test and shadow testing Reviewers: dhruba, kailiu, sdong Reviewed By: sdong Subscribers: leveldb Differential Revision: https://reviews.facebook.net/D19047
68 lines
2.2 KiB
C++
68 lines
2.2 KiB
C++
// 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.
|
|
#pragma once
|
|
|
|
#include "rocksdb/status.h"
|
|
|
|
namespace rocksdb {
|
|
|
|
class Comparator;
|
|
class Iterator;
|
|
class Slice;
|
|
class SliceTransform;
|
|
|
|
// Build a hash-based index to speed up the lookup for "index block".
|
|
// BlockHashIndex accepts a key and, if found, returns its restart index within
|
|
// that index block.
|
|
class BlockPrefixIndex {
|
|
public:
|
|
|
|
// Maps a key to a list of data blocks that could potentially contain
|
|
// the key, based on the prefix.
|
|
// Returns the total number of relevant blocks, 0 means the key does
|
|
// not exist.
|
|
const uint32_t GetBlocks(const Slice& key, uint32_t** blocks);
|
|
|
|
size_t ApproximateMemoryUsage() const {
|
|
return sizeof(BlockPrefixIndex) +
|
|
(num_block_array_buffer_entries_ + num_buckets_) * sizeof(uint32_t);
|
|
}
|
|
|
|
// Create hash index by reading from the metadata blocks.
|
|
// @params prefixes: a sequence of prefixes.
|
|
// @params prefix_meta: contains the "metadata" to of the prefixes.
|
|
static Status Create(const SliceTransform* hash_key_extractor,
|
|
const Slice& prefixes, const Slice& prefix_meta,
|
|
BlockPrefixIndex** prefix_index);
|
|
|
|
~BlockPrefixIndex() {
|
|
delete[] buckets_;
|
|
delete[] block_array_buffer_;
|
|
}
|
|
|
|
private:
|
|
class Builder;
|
|
friend Builder;
|
|
|
|
BlockPrefixIndex(const SliceTransform* internal_prefix_extractor,
|
|
uint32_t num_buckets,
|
|
uint32_t* buckets,
|
|
uint32_t num_block_array_buffer_entries,
|
|
uint32_t* block_array_buffer)
|
|
: internal_prefix_extractor_(internal_prefix_extractor),
|
|
num_buckets_(num_buckets),
|
|
num_block_array_buffer_entries_(num_block_array_buffer_entries),
|
|
buckets_(buckets),
|
|
block_array_buffer_(block_array_buffer) {}
|
|
|
|
const SliceTransform* internal_prefix_extractor_;
|
|
uint32_t num_buckets_;
|
|
uint32_t num_block_array_buffer_entries_;
|
|
uint32_t* buckets_;
|
|
uint32_t* block_array_buffer_;
|
|
};
|
|
|
|
} // namespace rocksdb
|