2019-09-09 19:43:37 +00:00
|
|
|
#include <Core/NamesAndTypes.h>
|
2019-09-13 16:17:37 +00:00
|
|
|
#include <Core/SortCursor.h>
|
2019-09-09 19:43:37 +00:00
|
|
|
#include <Interpreters/MergeJoin.h>
|
|
|
|
#include <Interpreters/AnalyzedJoin.h>
|
2019-09-12 18:06:25 +00:00
|
|
|
#include <Interpreters/sortBlock.h>
|
2019-09-09 19:43:37 +00:00
|
|
|
#include <DataStreams/materializeBlock.h>
|
2019-09-12 18:06:25 +00:00
|
|
|
#include <DataStreams/MergeSortingBlockInputStream.h>
|
2019-09-09 19:43:37 +00:00
|
|
|
|
|
|
|
namespace DB
|
|
|
|
{
|
|
|
|
|
2019-09-10 14:51:28 +00:00
|
|
|
namespace ErrorCodes
|
|
|
|
{
|
|
|
|
extern const int SET_SIZE_LIMIT_EXCEEDED;
|
2019-09-13 16:17:37 +00:00
|
|
|
extern const int NOT_IMPLEMENTED;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct MergeJoinEqualRange
|
|
|
|
{
|
|
|
|
size_t left_start = 0;
|
|
|
|
size_t right_start = 0;
|
|
|
|
size_t left_length = 0;
|
|
|
|
size_t right_length = 0;
|
|
|
|
|
|
|
|
bool empty() const { return !left_length && !right_length; }
|
|
|
|
};
|
|
|
|
|
|
|
|
using Range = MergeJoinEqualRange;
|
|
|
|
|
|
|
|
|
|
|
|
class MergeJoinCursor
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
MergeJoinCursor(const Block & block, const SortDescription & desc_)
|
|
|
|
: impl(SortCursorImpl(block, desc_))
|
|
|
|
{}
|
|
|
|
|
|
|
|
size_t position() const { return impl.pos; }
|
|
|
|
bool atEnd() const { return impl.pos >= impl.rows; }
|
|
|
|
void nextN(size_t num) { impl.pos += num; }
|
|
|
|
|
|
|
|
int compareAt(const MergeJoinCursor & rhs, size_t lhs_pos, size_t rhs_pos) const
|
|
|
|
{
|
|
|
|
int res = 0;
|
|
|
|
for (size_t i = 0; i < impl.sort_columns_size; ++i)
|
|
|
|
{
|
|
|
|
res = impl.sort_columns[i]->compareAt(lhs_pos, rhs_pos, *(rhs.impl.sort_columns[i]), 1);
|
|
|
|
if (res)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool sameNext(size_t lhs_pos) const
|
|
|
|
{
|
|
|
|
if (impl.isLast())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
for (size_t i = 0; i < impl.sort_columns_size; ++i)
|
|
|
|
if (impl.sort_columns[i]->compareAt(lhs_pos, lhs_pos + 1, *(impl.sort_columns[i]), 1) != 0)
|
|
|
|
return false;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t getEqualLength()
|
|
|
|
{
|
|
|
|
if (atEnd())
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
size_t pos = impl.pos;
|
|
|
|
for (; pos < impl.rows; ++pos)
|
|
|
|
if (!sameNext(pos))
|
|
|
|
break;
|
|
|
|
|
|
|
|
return pos - impl.pos + 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
Range getNextEqualRange(MergeJoinCursor & rhs)
|
|
|
|
{
|
|
|
|
while (!atEnd() && !rhs.atEnd())
|
|
|
|
{
|
|
|
|
int cmp = compareAt(rhs, impl.pos, rhs.impl.pos);
|
|
|
|
if (cmp < 0)
|
|
|
|
impl.next();
|
|
|
|
if (cmp > 0)
|
|
|
|
rhs.impl.next();
|
|
|
|
if (!cmp)
|
|
|
|
{
|
|
|
|
Range range{impl.pos, rhs.impl.pos, 0, 0};
|
|
|
|
range.left_length = getEqualLength();
|
|
|
|
range.right_length = rhs.getEqualLength();
|
|
|
|
return range;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return Range{impl.pos, rhs.impl.pos, 0, 0};
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
SortCursorImpl impl;
|
|
|
|
};
|
|
|
|
|
|
|
|
static void makeSortAndMerge(const Names & keys, SortDescription & sort, SortDescription & merge)
|
|
|
|
{
|
|
|
|
NameSet unique_keys;
|
|
|
|
for (auto & key_name : keys)
|
|
|
|
{
|
|
|
|
merge.emplace_back(SortColumnDescription(key_name, 1, 1));
|
|
|
|
|
|
|
|
if (!unique_keys.count(key_name))
|
|
|
|
{
|
|
|
|
unique_keys.insert(key_name);
|
|
|
|
sort.emplace_back(SortColumnDescription(key_name, 1, 1));
|
|
|
|
}
|
|
|
|
}
|
2019-09-10 14:51:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2019-09-09 19:43:37 +00:00
|
|
|
MergeJoin::MergeJoin(const AnalyzedJoin & table_join_, const Block & right_sample_block)
|
|
|
|
: table_join(table_join_)
|
2019-09-12 14:09:05 +00:00
|
|
|
, nullable_right_side(table_join_.forceNullabelRight())
|
2019-09-09 19:43:37 +00:00
|
|
|
{
|
2019-09-13 16:17:37 +00:00
|
|
|
if (!isLeft(table_join.kind()) && !isInner(table_join.kind()))
|
|
|
|
throw Exception("Partial merge supported for LEFT and INNER JOINs only", ErrorCodes::NOT_IMPLEMENTED);
|
|
|
|
#if 0
|
|
|
|
if (table_join.strictness() != ASTTableJoin::Strictness::Any)
|
|
|
|
throw Exception("Partial merge supported for ANY JOIN variant only", ErrorCodes::NOT_IMPLEMENTED);
|
|
|
|
#endif
|
|
|
|
|
2019-09-12 14:09:05 +00:00
|
|
|
JoinCommon::extractKeysForJoin(table_join.keyNamesRight(), right_sample_block, right_table_keys, right_columns_to_add);
|
|
|
|
|
|
|
|
const NameSet required_right_keys = table_join.requiredRightKeys();
|
|
|
|
for (const auto & column : right_table_keys)
|
|
|
|
if (required_right_keys.count(column.name))
|
|
|
|
right_columns_to_add.insert(ColumnWithTypeAndName{nullptr, column.type, column.name});
|
|
|
|
|
|
|
|
JoinCommon::createMissedColumns(right_columns_to_add);
|
|
|
|
|
|
|
|
if (nullable_right_side)
|
|
|
|
JoinCommon::convertColumnsToNullable(right_columns_to_add);
|
2019-09-12 18:06:25 +00:00
|
|
|
|
2019-09-13 16:17:37 +00:00
|
|
|
makeSortAndMerge(table_join.keyNamesLeft(), left_sort_description, left_merge_description);
|
|
|
|
makeSortAndMerge(table_join.keyNamesRight(), right_sort_description, right_merge_description);
|
2019-09-12 18:06:25 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void MergeJoin::setTotals(const Block & totals_block)
|
|
|
|
{
|
|
|
|
totals = totals_block;
|
|
|
|
mergeRightBlocks();
|
2019-09-09 19:43:37 +00:00
|
|
|
}
|
|
|
|
|
2019-09-13 16:17:37 +00:00
|
|
|
void MergeJoin::mergeRightBlocks()
|
|
|
|
{
|
|
|
|
const size_t max_merged_block_size = 128 * 1024 * 1024;
|
|
|
|
|
|
|
|
Blocks unsorted_blocks;
|
|
|
|
unsorted_blocks.reserve(right_blocks.size());
|
|
|
|
for (const auto & block : right_blocks)
|
|
|
|
unsorted_blocks.push_back(block);
|
|
|
|
|
|
|
|
/// TODO: there should be no splitted keys by blocks for RIGHT|FULL JOIN
|
|
|
|
MergeSortingBlocksBlockInputStream stream(unsorted_blocks, right_sort_description, max_merged_block_size);
|
|
|
|
|
|
|
|
right_blocks.clear();
|
|
|
|
while (Block block = stream.read())
|
|
|
|
right_blocks.push_back(block);
|
|
|
|
}
|
|
|
|
|
2019-09-12 18:06:25 +00:00
|
|
|
bool MergeJoin::addJoinedBlock(const Block & src_block)
|
2019-09-09 19:43:37 +00:00
|
|
|
{
|
2019-09-12 18:06:25 +00:00
|
|
|
Block block = src_block;
|
|
|
|
sortBlock(block, right_sort_description);
|
|
|
|
|
2019-09-10 14:51:28 +00:00
|
|
|
std::unique_lock lock(rwlock);
|
|
|
|
|
|
|
|
right_blocks.push_back(block);
|
|
|
|
right_blocks_row_count += block.rows();
|
|
|
|
right_blocks_bytes += block.bytes();
|
|
|
|
|
|
|
|
return table_join.sizeLimits().check(right_blocks_row_count, right_blocks_bytes, "JOIN", ErrorCodes::SET_SIZE_LIMIT_EXCEEDED);
|
2019-09-09 19:43:37 +00:00
|
|
|
}
|
|
|
|
|
2019-09-10 14:51:28 +00:00
|
|
|
void MergeJoin::joinBlock(Block & block)
|
2019-09-09 19:43:37 +00:00
|
|
|
{
|
2019-09-11 18:03:21 +00:00
|
|
|
JoinCommon::checkTypesOfKeys(block, table_join.keyNamesLeft(), right_table_keys, table_join.keyNamesRight());
|
2019-09-12 18:06:25 +00:00
|
|
|
sortBlock(block, left_sort_description);
|
|
|
|
|
|
|
|
std::shared_lock lock(rwlock);
|
2019-09-11 18:03:21 +00:00
|
|
|
|
2019-09-13 16:17:37 +00:00
|
|
|
if (isLeft(table_join.kind()))
|
|
|
|
{
|
|
|
|
MutableColumns right_columns = makeRightColumns(0);
|
|
|
|
|
|
|
|
MergeJoinCursor left_cursor(block, left_merge_description);
|
|
|
|
for (auto it = right_blocks.begin(); it != right_blocks.end(); ++it)
|
|
|
|
{
|
|
|
|
if (left_cursor.atEnd())
|
|
|
|
break;
|
|
|
|
leftJoin(left_cursor, *it, right_columns);
|
|
|
|
}
|
2019-09-11 18:03:21 +00:00
|
|
|
|
2019-09-13 16:17:37 +00:00
|
|
|
appendRightColumns(block, std::move(right_columns));
|
|
|
|
}
|
|
|
|
else if (isInner(table_join.kind()))
|
|
|
|
{
|
|
|
|
/// TODO
|
|
|
|
MutableColumns right_columns = makeRightColumns(block.rows());
|
|
|
|
appendRightColumns(block, std::move(right_columns));
|
|
|
|
}
|
2019-09-10 14:51:28 +00:00
|
|
|
}
|
|
|
|
|
2019-09-13 16:17:37 +00:00
|
|
|
void MergeJoin::leftJoin(MergeJoinCursor & left_cursor, const Block & right_block, MutableColumns & right_columns)
|
2019-09-10 14:51:28 +00:00
|
|
|
{
|
2019-09-13 16:17:37 +00:00
|
|
|
MergeJoinCursor right_cursor(right_block, right_merge_description);
|
|
|
|
|
|
|
|
while (!left_cursor.atEnd() && !right_cursor.atEnd())
|
|
|
|
{
|
|
|
|
size_t left_position = left_cursor.position();
|
|
|
|
Range range = left_cursor.getNextEqualRange(right_cursor);
|
|
|
|
|
|
|
|
if (left_position < range.left_start)
|
|
|
|
appendRightNulls(right_columns, range.left_start - left_position);
|
|
|
|
|
|
|
|
if (range.empty())
|
|
|
|
break;
|
|
|
|
|
|
|
|
anyLeftJoinEquals(right_block, right_columns, range);
|
|
|
|
right_cursor.nextN(range.right_length);
|
|
|
|
|
|
|
|
/// TODO: Do not run over last left keys for ALL JOIN (cause of possible duplicates in next right block)
|
|
|
|
//if (!right_cursor.atEnd())
|
|
|
|
left_cursor.nextN(range.left_length);
|
|
|
|
}
|
2019-09-10 14:51:28 +00:00
|
|
|
}
|
2019-09-09 19:43:37 +00:00
|
|
|
|
2019-09-13 16:17:37 +00:00
|
|
|
MutableColumns MergeJoin::makeRightColumns(size_t rows)
|
2019-09-12 18:06:25 +00:00
|
|
|
{
|
2019-09-13 16:17:37 +00:00
|
|
|
MutableColumns columns;
|
|
|
|
columns.reserve(right_columns_to_add.columns());
|
2019-09-12 18:06:25 +00:00
|
|
|
|
2019-09-13 16:17:37 +00:00
|
|
|
for (const auto & src_column : right_columns_to_add)
|
|
|
|
columns.push_back(src_column.column->cloneResized(rows));
|
|
|
|
return columns;
|
|
|
|
}
|
2019-09-12 18:06:25 +00:00
|
|
|
|
2019-09-13 16:17:37 +00:00
|
|
|
void MergeJoin::appendRightColumns(Block & block, MutableColumns && right_columns)
|
|
|
|
{
|
|
|
|
for (size_t i = 0; i < right_columns_to_add.columns(); ++i)
|
|
|
|
{
|
|
|
|
const auto & column = right_columns_to_add.getByPosition(i);
|
|
|
|
block.insert(ColumnWithTypeAndName{std::move(right_columns[i]), column.type, column.name});
|
|
|
|
}
|
|
|
|
}
|
2019-09-12 18:06:25 +00:00
|
|
|
|
2019-09-13 16:17:37 +00:00
|
|
|
void MergeJoin::appendRightNulls(MutableColumns & right_columns, size_t rows_to_add)
|
|
|
|
{
|
|
|
|
for (auto & column : right_columns)
|
|
|
|
for (size_t i = 0; i < rows_to_add; ++i)
|
|
|
|
column->insertDefault();
|
2019-09-12 18:06:25 +00:00
|
|
|
}
|
|
|
|
|
2019-09-13 16:17:37 +00:00
|
|
|
void MergeJoin::anyLeftJoinEquals(const Block & right_block, MutableColumns & right_columns, const Range & range)
|
2019-09-10 14:51:28 +00:00
|
|
|
{
|
2019-09-13 16:17:37 +00:00
|
|
|
size_t rows_to_insert = range.left_length;
|
|
|
|
size_t any_row_position = range.right_start;
|
|
|
|
|
|
|
|
for (size_t i = 0; i < right_columns_to_add.columns(); ++i)
|
|
|
|
{
|
|
|
|
const auto & src_column = right_block.getByName(right_columns_to_add.getByPosition(i).name);
|
|
|
|
auto & dst_column = right_columns[i];
|
|
|
|
|
|
|
|
for (size_t row = 0; row < rows_to_insert; ++row)
|
|
|
|
dst_column->insertFrom(*src_column.column, any_row_position);
|
|
|
|
}
|
2019-09-09 19:43:37 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
}
|