# Proposed changes Issue Number: close #6238 Co-authored-by: HappenLee <happenlee@hotmail.com> Co-authored-by: stdpain <34912776+stdpain@users.noreply.github.com> Co-authored-by: Zhengguo Yang <yangzhgg@gmail.com> Co-authored-by: wangbo <506340561@qq.com> Co-authored-by: emmymiao87 <522274284@qq.com> Co-authored-by: Pxl <952130278@qq.com> Co-authored-by: zhangstar333 <87313068+zhangstar333@users.noreply.github.com> Co-authored-by: thinker <zchw100@qq.com> Co-authored-by: Zeno Yang <1521564989@qq.com> Co-authored-by: Wang Shuo <wangshuo128@gmail.com> Co-authored-by: zhoubintao <35688959+zbtzbtzbt@users.noreply.github.com> Co-authored-by: Gabriel <gabrielleebuaa@gmail.com> Co-authored-by: xinghuayu007 <1450306854@qq.com> Co-authored-by: weizuo93 <weizuo@apache.org> Co-authored-by: yiguolei <guoleiyi@tencent.com> Co-authored-by: anneji-dev <85534151+anneji-dev@users.noreply.github.com> Co-authored-by: awakeljw <993007281@qq.com> Co-authored-by: taberylyang <95272637+taberylyang@users.noreply.github.com> Co-authored-by: Cui Kaifeng <48012748+azurenake@users.noreply.github.com> ## Problem Summary: ### 1. Some code from clickhouse **ClickHouse is an excellent implementation of the vectorized execution engine database, so here we have referenced and learned a lot from its excellent implementation in terms of data structure and function implementation. We are based on ClickHouse v19.16.2.2 and would like to thank the ClickHouse community and developers.** The following comment has been added to the code from Clickhouse, eg: // This file is copied from // https://github.com/ClickHouse/ClickHouse/blob/master/src/Interpreters/AggregationCommon.h // and modified by Doris ### 2. Support exec node and query: * vaggregation_node * vanalytic_eval_node * vassert_num_rows_node * vblocking_join_node * vcross_join_node * vempty_set_node * ves_http_scan_node * vexcept_node * vexchange_node * vintersect_node * vmysql_scan_node * vodbc_scan_node * volap_scan_node * vrepeat_node * vschema_scan_node * vselect_node * vset_operation_node * vsort_node * vunion_node * vhash_join_node You can run exec engine of SSB/TPCH and 70% TPCDS stand query test set. ### 3. Data Model Vec Exec Engine Support **Dup/Agg/Unq** table, Support Block Reader Vectorized. Segment Vec is working in process. ### 4. How to use 1. Set the environment variable `set enable_vectorized_engine = true; `(required) 2. Set the environment variable `set batch_size = 4096; ` (recommended) ### 5. Some diff from origin exec engine https://github.com/doris-vectorized/doris-vectorized/issues/294 ## Checklist(Required) 1. Does it affect the original behavior: (No) 2. Has unit tests been added: (Yes) 3. Has document been added or modified: (No) 4. Does it need to update dependencies: (No) 5. Are there any changes that cannot be rolled back: (Yes)
208 lines
6.0 KiB
C++
208 lines
6.0 KiB
C++
|
|
// Licensed to the Apache Software Foundation (ASF) under one
|
|
// or more contributor license agreements. See the NOTICE file
|
|
// distributed with this work for additional information
|
|
// regarding copyright ownership. The ASF licenses this file
|
|
// to you under the Apache License, Version 2.0 (the
|
|
// "License"); you may not use this file except in compliance
|
|
// with the License. You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing,
|
|
// software distributed under the License is distributed on an
|
|
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
|
|
// KIND, either express or implied. See the License for the
|
|
// specific language governing permissions and limitations
|
|
// under the License.
|
|
|
|
#include "vec/olap/vgeneric_iterators.h"
|
|
|
|
#include <gtest/gtest.h>
|
|
|
|
#include <vector>
|
|
|
|
#include "olap/olap_common.h"
|
|
#include "olap/row_block2.h"
|
|
#include "olap/schema.h"
|
|
#include "util/slice.h"
|
|
|
|
namespace doris {
|
|
|
|
namespace vectorized {
|
|
|
|
class VGenericIteratorsTest : public testing::Test {
|
|
public:
|
|
VGenericIteratorsTest() {}
|
|
virtual ~VGenericIteratorsTest() {}
|
|
};
|
|
|
|
Schema create_schema() {
|
|
std::vector<TabletColumn> col_schemas;
|
|
col_schemas.emplace_back(OLAP_FIELD_AGGREGATION_NONE, OLAP_FIELD_TYPE_SMALLINT, true);
|
|
// c2: int
|
|
col_schemas.emplace_back(OLAP_FIELD_AGGREGATION_NONE, OLAP_FIELD_TYPE_INT, true);
|
|
// c3: big int
|
|
col_schemas.emplace_back(OLAP_FIELD_AGGREGATION_SUM, OLAP_FIELD_TYPE_BIGINT, true);
|
|
|
|
Schema schema(col_schemas, 2);
|
|
return schema;
|
|
}
|
|
|
|
static void create_block(Schema& schema, vectorized::Block& block)
|
|
{
|
|
for (auto &column_desc : schema.columns()) {
|
|
ASSERT_TRUE(column_desc);
|
|
auto data_type = Schema::get_data_type_ptr(column_desc->type());
|
|
ASSERT_NE(data_type, nullptr);
|
|
vectorized::ColumnWithTypeAndName ctn(data_type->create_column(), data_type, column_desc->name());
|
|
block.insert(ctn);
|
|
}
|
|
}
|
|
|
|
TEST(VGenericIteratorsTest, AutoIncrement) {
|
|
auto schema = create_schema();
|
|
auto iter = vectorized::new_auto_increment_iterator(schema, 10);
|
|
|
|
StorageReadOptions opts;
|
|
auto st = iter->init(opts);
|
|
ASSERT_TRUE(st.ok());
|
|
|
|
vectorized::Block block;
|
|
create_block(schema, block);
|
|
|
|
auto ret = iter->next_batch(&block);
|
|
ASSERT_TRUE(ret.ok());
|
|
ASSERT_EQ(block.rows(), 10);
|
|
|
|
auto c0 = block.get_by_position(0).column;
|
|
auto c1 = block.get_by_position(1).column;
|
|
auto c2 = block.get_by_position(2).column;
|
|
|
|
ASSERT_TRUE(c0->is_numeric());
|
|
ASSERT_TRUE(c1->is_numeric());
|
|
ASSERT_TRUE(c2->is_numeric());
|
|
|
|
int row_count = 0;
|
|
size_t rows = block.rows();
|
|
for (size_t i = 0; i < rows; ++i) {
|
|
ASSERT_EQ(row_count, c0->get_int(i));
|
|
ASSERT_EQ(row_count + 1, c1->get_int(i));
|
|
ASSERT_EQ(row_count + 2, c2->get_int(i));
|
|
row_count++;
|
|
}
|
|
|
|
delete iter;
|
|
}
|
|
|
|
TEST(VGenericIteratorsTest, Union) {
|
|
auto schema = create_schema();
|
|
std::vector<RowwiseIterator*> inputs;
|
|
|
|
inputs.push_back(vectorized::new_auto_increment_iterator(schema, 100));
|
|
inputs.push_back(vectorized::new_auto_increment_iterator(schema, 200));
|
|
inputs.push_back(vectorized::new_auto_increment_iterator(schema, 300));
|
|
|
|
auto iter = vectorized::new_union_iterator(inputs, MemTracker::CreateTracker(-1, "VUnionIterator", nullptr, false));
|
|
StorageReadOptions opts;
|
|
auto st = iter->init(opts);
|
|
ASSERT_TRUE(st.ok());
|
|
|
|
vectorized::Block block;
|
|
create_block(schema, block);
|
|
|
|
do {
|
|
st = iter->next_batch(&block);
|
|
} while (st.ok());
|
|
|
|
ASSERT_TRUE(st.is_end_of_file());
|
|
ASSERT_EQ(block.rows(), 600);
|
|
|
|
auto c0 = block.get_by_position(0).column;
|
|
auto c1 = block.get_by_position(1).column;
|
|
auto c2 = block.get_by_position(2).column;
|
|
|
|
ASSERT_TRUE(c0->is_numeric());
|
|
ASSERT_TRUE(c1->is_numeric());
|
|
ASSERT_TRUE(c2->is_numeric());
|
|
|
|
size_t row_count = 0;
|
|
for (size_t i = 0; i < block.rows(); ++i) {
|
|
size_t base_value = row_count;
|
|
if (row_count >= 300) {
|
|
base_value -= 300;
|
|
} else if (row_count >= 100) {
|
|
base_value -= 100;
|
|
}
|
|
|
|
ASSERT_EQ(base_value, c0->get_int(i));
|
|
ASSERT_EQ(base_value + 1, c1->get_int(i));
|
|
ASSERT_EQ(base_value + 2, c2->get_int(i));
|
|
row_count++;
|
|
}
|
|
|
|
delete iter;
|
|
}
|
|
|
|
TEST(VGenericIteratorsTest, Merge) {
|
|
ASSERT_TRUE(1);
|
|
auto schema = create_schema();
|
|
std::vector<RowwiseIterator*> inputs;
|
|
|
|
inputs.push_back(vectorized::new_auto_increment_iterator(schema, 100));
|
|
inputs.push_back(vectorized::new_auto_increment_iterator(schema, 200));
|
|
inputs.push_back(vectorized::new_auto_increment_iterator(schema, 300));
|
|
|
|
auto iter = vectorized::new_merge_iterator(inputs, MemTracker::CreateTracker(-1, "VMergeIterator", nullptr, false));
|
|
StorageReadOptions opts;
|
|
auto st = iter->init(opts);
|
|
ASSERT_TRUE(st.ok());
|
|
|
|
vectorized::Block block;
|
|
create_block(schema, block);
|
|
|
|
do {
|
|
st = iter->next_batch(&block);
|
|
} while (st.ok());
|
|
|
|
ASSERT_TRUE(st.is_end_of_file());
|
|
ASSERT_EQ(block.rows(), 600);
|
|
|
|
auto c0 = block.get_by_position(0).column;
|
|
auto c1 = block.get_by_position(1).column;
|
|
auto c2 = block.get_by_position(2).column;
|
|
|
|
ASSERT_TRUE(c0->is_numeric());
|
|
ASSERT_TRUE(c1->is_numeric());
|
|
ASSERT_TRUE(c2->is_numeric());
|
|
|
|
size_t row_count = 0;
|
|
for (size_t i = 0; i < block.rows(); ++i) {
|
|
size_t base_value = row_count;
|
|
// 100 * 3, 200 * 2, 300
|
|
if (row_count < 300) {
|
|
base_value = row_count / 3;
|
|
} else if (row_count < 500) {
|
|
base_value = (row_count - 300) / 2 + 100;
|
|
} else {
|
|
base_value = row_count - 300;
|
|
}
|
|
|
|
ASSERT_EQ(base_value, c0->get_int(i));
|
|
ASSERT_EQ(base_value + 1, c1->get_int(i));
|
|
ASSERT_EQ(base_value + 2, c2->get_int(i));
|
|
row_count++;
|
|
}
|
|
|
|
delete iter;
|
|
}
|
|
|
|
} // namespace vectorized
|
|
|
|
} // namespace doris
|
|
|
|
int main(int argc, char** argv) {
|
|
testing::InitGoogleTest(&argc, argv);
|
|
return RUN_ALL_TESTS();
|
|
}
|