2013-11-26 11:55:11 +00:00
|
|
|
#pragma once
|
|
|
|
|
2015-04-16 06:12:35 +00:00
|
|
|
#include <DB/Storages/MarkCache.h>
|
2015-06-24 11:03:53 +00:00
|
|
|
#include <DB/Storages/MergeTree/MarkRange.h>
|
2014-03-09 17:36:01 +00:00
|
|
|
#include <DB/Storages/MergeTree/MergeTreeData.h>
|
2013-11-26 11:55:11 +00:00
|
|
|
#include <DB/Core/NamesAndTypes.h>
|
|
|
|
|
|
|
|
|
|
|
|
namespace DB
|
|
|
|
{
|
|
|
|
|
2016-11-20 12:43:20 +00:00
|
|
|
class IDataType;
|
|
|
|
class CachedCompressedReadBuffer;
|
|
|
|
class CompressedReadBufferFromFile;
|
2016-01-11 21:46:36 +00:00
|
|
|
|
2017-01-24 17:25:47 +00:00
|
|
|
|
|
|
|
/// Reads the data between pairs of marks in the same part. When reading consecutive ranges, avoids unnecessary seeks.
|
|
|
|
/// When ranges are almost consecutive, seeks are fast because they are performed inside the buffer.
|
|
|
|
/// Avoids loading the marks file if it is not needed (e.g. when reading the whole part).
|
2016-12-10 04:51:36 +00:00
|
|
|
class MergeTreeReader : private boost::noncopyable
|
2013-11-26 11:55:11 +00:00
|
|
|
{
|
|
|
|
public:
|
2015-12-13 04:52:13 +00:00
|
|
|
using ValueSizeMap = std::map<std::string, double>;
|
|
|
|
|
2017-01-24 17:25:47 +00:00
|
|
|
MergeTreeReader(const String & path, /// Path to the directory containing the part
|
2015-09-16 17:49:08 +00:00
|
|
|
const MergeTreeData::DataPartPtr & data_part, const NamesAndTypesList & columns,
|
2016-07-21 16:22:24 +00:00
|
|
|
UncompressedCache * uncompressed_cache,
|
2016-08-10 19:12:29 +00:00
|
|
|
MarkCache * mark_cache,
|
2016-07-21 16:22:24 +00:00
|
|
|
bool save_marks_in_cache,
|
2015-09-16 17:49:08 +00:00
|
|
|
MergeTreeData & storage, const MarkRanges & all_mark_ranges,
|
2016-07-21 16:22:24 +00:00
|
|
|
size_t aio_threshold, size_t max_read_buffer_size,
|
|
|
|
const ValueSizeMap & avg_value_size_hints = ValueSizeMap{},
|
2015-12-13 04:52:13 +00:00
|
|
|
const ReadBufferFromFileBase::ProfileCallback & profile_callback = ReadBufferFromFileBase::ProfileCallback{},
|
2016-07-19 10:57:57 +00:00
|
|
|
clockid_t clock_type = CLOCK_MONOTONIC_COARSE);
|
2014-07-23 15:24:45 +00:00
|
|
|
|
2016-11-20 12:43:20 +00:00
|
|
|
~MergeTreeReader();
|
2013-11-26 11:55:11 +00:00
|
|
|
|
2016-07-19 10:57:57 +00:00
|
|
|
const ValueSizeMap & getAvgValueSizeHints() const;
|
2015-09-16 17:49:08 +00:00
|
|
|
|
2017-01-24 17:25:47 +00:00
|
|
|
/// If columns are not present in the block, adds them. If they are present - appends the values that have been read.
|
|
|
|
/// Do not adds columns, if the files are not present for them (to add them, call fillMissingColumns).
|
|
|
|
/// Block should contain either no columns from the columns field, or all columns for which files are present.
|
2016-07-19 10:57:57 +00:00
|
|
|
void readRange(size_t from_mark, size_t to_mark, Block & res);
|
2013-11-26 11:55:11 +00:00
|
|
|
|
2017-01-24 17:25:47 +00:00
|
|
|
/// Add columns from ordered_names that are not present in the block.
|
|
|
|
/// Missing columns are added in the order specified by ordered_names.
|
|
|
|
/// If at least one column was added, reorders all columns in the block according to ordered_names.
|
2016-07-19 10:57:57 +00:00
|
|
|
void fillMissingColumns(Block & res, const Names & ordered_names, const bool always_reorder = false);
|
2014-12-04 15:50:48 +00:00
|
|
|
|
2017-01-24 17:25:47 +00:00
|
|
|
/// The same as fillMissingColumns(), but always reorders columns according to ordered_names
|
|
|
|
/// (even if no columns were added).
|
2016-07-19 10:57:57 +00:00
|
|
|
void fillMissingColumnsAndReorder(Block & res, const Names & ordered_names);
|
2013-11-26 11:55:11 +00:00
|
|
|
|
2016-07-19 10:57:57 +00:00
|
|
|
private:
|
|
|
|
class Stream
|
|
|
|
{
|
2016-12-10 06:10:29 +00:00
|
|
|
public:
|
2015-07-08 17:59:44 +00:00
|
|
|
Stream(
|
2017-01-19 11:40:06 +00:00
|
|
|
const String & path_prefix_, const String & extension_, size_t marks_count_,
|
|
|
|
const MarkRanges & all_mark_ranges,
|
2015-12-26 00:59:09 +00:00
|
|
|
MarkCache * mark_cache, bool save_marks_in_cache,
|
2017-01-19 11:40:06 +00:00
|
|
|
UncompressedCache * uncompressed_cache,
|
|
|
|
size_t aio_threshold, size_t max_read_buffer_size,
|
2016-07-19 10:57:57 +00:00
|
|
|
const ReadBufferFromFileBase::ProfileCallback & profile_callback, clockid_t clock_type);
|
2013-11-26 11:55:11 +00:00
|
|
|
|
2016-11-03 12:00:44 +00:00
|
|
|
static std::unique_ptr<Stream> createEmptyPtr();
|
2014-02-11 13:30:42 +00:00
|
|
|
|
2016-07-19 10:57:57 +00:00
|
|
|
void seekToMark(size_t index);
|
2013-11-26 11:55:11 +00:00
|
|
|
|
2016-12-10 06:10:29 +00:00
|
|
|
bool isEmpty() const { return is_empty; }
|
|
|
|
|
2016-07-19 10:57:57 +00:00
|
|
|
ReadBuffer * data_buffer;
|
2016-05-04 18:04:36 +00:00
|
|
|
|
2016-07-19 10:57:57 +00:00
|
|
|
private:
|
2016-11-03 12:00:44 +00:00
|
|
|
Stream() = default;
|
2016-12-10 04:51:36 +00:00
|
|
|
|
2017-01-19 11:40:06 +00:00
|
|
|
/// NOTE: lazily loads marks from the marks cache.
|
|
|
|
const MarkInCompressedFile & getMark(size_t index);
|
|
|
|
|
|
|
|
void loadMarks();
|
|
|
|
|
|
|
|
std::string path_prefix;
|
|
|
|
std::string extension;
|
|
|
|
|
|
|
|
size_t marks_count;
|
|
|
|
|
|
|
|
MarkCache * mark_cache;
|
|
|
|
bool save_marks_in_cache;
|
2016-07-19 10:57:57 +00:00
|
|
|
MarkCache::MappedPtr marks;
|
2017-01-19 11:40:06 +00:00
|
|
|
|
2016-07-19 10:57:57 +00:00
|
|
|
std::unique_ptr<CachedCompressedReadBuffer> cached_buffer;
|
|
|
|
std::unique_ptr<CompressedReadBufferFromFile> non_cached_buffer;
|
2017-01-19 11:40:06 +00:00
|
|
|
|
2016-12-10 04:51:36 +00:00
|
|
|
bool is_empty = false;
|
2013-11-26 11:55:11 +00:00
|
|
|
};
|
|
|
|
|
2016-08-05 02:40:45 +00:00
|
|
|
using FileStreams = std::map<std::string, std::unique_ptr<Stream>>;
|
2013-11-26 11:55:11 +00:00
|
|
|
|
2017-01-24 17:25:47 +00:00
|
|
|
/// avg_value_size_hints are used to reduce the number of reallocations when creating columns of variable size.
|
2015-09-16 17:49:08 +00:00
|
|
|
ValueSizeMap avg_value_size_hints;
|
2013-11-26 11:55:11 +00:00
|
|
|
String path;
|
2015-07-08 17:59:44 +00:00
|
|
|
MergeTreeData::DataPartPtr data_part;
|
2017-01-24 20:44:12 +00:00
|
|
|
|
2013-11-26 11:55:11 +00:00
|
|
|
FileStreams streams;
|
2017-01-24 20:44:12 +00:00
|
|
|
size_t cur_mark_idx = 0; /// Mark index corresponding to the current position for all streams.
|
2015-04-09 00:37:08 +00:00
|
|
|
|
2017-01-24 17:25:47 +00:00
|
|
|
/// Columns that are read.
|
2014-07-17 13:41:47 +00:00
|
|
|
NamesAndTypesList columns;
|
2015-04-09 00:37:08 +00:00
|
|
|
|
2015-04-16 06:12:35 +00:00
|
|
|
UncompressedCache * uncompressed_cache;
|
|
|
|
MarkCache * mark_cache;
|
2017-01-24 17:25:47 +00:00
|
|
|
/// If save_marks_in_cache is false, then, if marks are not in cache, we will load them but won't save in the cache, to avoid evicting other data.
|
2015-12-26 00:59:09 +00:00
|
|
|
bool save_marks_in_cache;
|
2015-04-16 06:12:35 +00:00
|
|
|
|
2014-03-09 17:36:01 +00:00
|
|
|
MergeTreeData & storage;
|
2015-07-08 17:59:44 +00:00
|
|
|
MarkRanges all_mark_ranges;
|
2015-04-09 13:34:16 +00:00
|
|
|
size_t aio_threshold;
|
2015-04-12 04:39:20 +00:00
|
|
|
size_t max_read_buffer_size;
|
2013-11-26 11:55:11 +00:00
|
|
|
|
2015-12-13 04:52:13 +00:00
|
|
|
void addStream(const String & name, const IDataType & type, const MarkRanges & all_mark_ranges,
|
|
|
|
const ReadBufferFromFileBase::ProfileCallback & profile_callback, clockid_t clock_type,
|
2016-11-20 12:43:20 +00:00
|
|
|
size_t level = 0);
|
2015-04-09 00:37:08 +00:00
|
|
|
|
2017-01-19 11:40:06 +00:00
|
|
|
void readData(
|
|
|
|
const String & name, const IDataType & type, IColumn & column,
|
2017-01-24 20:44:12 +00:00
|
|
|
size_t from_mark, size_t max_rows_to_read,
|
2017-01-19 11:40:06 +00:00
|
|
|
size_t level = 0, bool read_offsets = true);
|
2015-04-02 03:08:43 +00:00
|
|
|
|
2016-11-20 12:43:20 +00:00
|
|
|
void fillMissingColumnsImpl(Block & res, const Names & ordered_names, bool always_reorder);
|
2013-11-26 11:55:11 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
}
|