Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
2dot5
ClickHouse
提交
ee5dcd50
C
ClickHouse
项目概览
2dot5
/
ClickHouse
通知
3
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
C
ClickHouse
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
ee5dcd50
编写于
6月 16, 2019
作者:
A
Alexey Milovidov
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Lowered CPU overhead for small data parts
上级
c6e83f68
变更
3
隐藏空白更改
内联
并排
Showing
3 changed file
with
6 addition
and
6 deletion
+6
-6
dbms/src/Storages/MergeTree/MergeTreeReadPool.cpp
dbms/src/Storages/MergeTree/MergeTreeReadPool.cpp
+3
-3
dbms/src/Storages/MergeTree/MergeTreeReadPool.h
dbms/src/Storages/MergeTree/MergeTreeReadPool.h
+1
-1
dbms/src/Storages/MergeTree/MergeTreeThreadSelectBlockInputStream.cpp
...rages/MergeTree/MergeTreeThreadSelectBlockInputStream.cpp
+2
-2
未找到文件。
dbms/src/Storages/MergeTree/MergeTreeReadPool.cpp
浏览文件 @
ee5dcd50
...
...
@@ -129,12 +129,12 @@ MergeTreeReadTaskPtr MergeTreeReadPool::getTask(const size_t min_marks_to_read,
prewhere_info
&&
prewhere_info
->
remove_prewhere_column
,
per_part_should_reorder
[
part_idx
],
std
::
move
(
curr_task_size_predictor
));
}
MarkRanges
MergeTreeReadPool
::
getRestMarks
(
const
std
::
string
&
part_path
,
const
MarkRange
&
from
)
const
MarkRanges
MergeTreeReadPool
::
getRestMarks
(
const
MergeTreeDataPart
&
part
,
const
MarkRange
&
from
)
const
{
MarkRanges
all_part_ranges
;
for
(
const
auto
&
part_ranges
:
parts_ranges
)
{
if
(
part_ranges
.
data_part
->
getFullPath
()
==
part_path
)
if
(
part_ranges
.
data_part
.
get
()
==
&
part
)
{
all_part_ranges
=
part_ranges
.
ranges
;
break
;
...
...
@@ -142,7 +142,7 @@ MarkRanges MergeTreeReadPool::getRestMarks(const std::string & part_path, const
}
if
(
all_part_ranges
.
empty
())
throw
Exception
(
"Trying to read marks range ["
+
std
::
to_string
(
from
.
begin
)
+
", "
+
std
::
to_string
(
from
.
end
)
+
"] from part '"
+
part_path
+
"' which has no ranges in this query"
,
ErrorCodes
::
LOGICAL_ERROR
);
+
part
.
getFullPath
()
+
"' which has no ranges in this query"
,
ErrorCodes
::
LOGICAL_ERROR
);
auto
begin
=
std
::
lower_bound
(
all_part_ranges
.
begin
(),
all_part_ranges
.
end
(),
from
,
[]
(
const
auto
&
f
,
const
auto
&
s
)
{
return
f
.
begin
<
s
.
begin
;
});
if
(
begin
==
all_part_ranges
.
end
())
...
...
dbms/src/Storages/MergeTree/MergeTreeReadPool.h
浏览文件 @
ee5dcd50
...
...
@@ -81,7 +81,7 @@ public:
void
profileFeedback
(
const
ReadBufferFromFileBase
::
ProfileInfo
info
);
/// This method tells which mark ranges we have to read if we start from @from mark range
MarkRanges
getRestMarks
(
const
std
::
string
&
part_path
,
const
MarkRange
&
from
)
const
;
MarkRanges
getRestMarks
(
const
MergeTreeDataPart
&
part
,
const
MarkRange
&
from
)
const
;
Block
getHeader
()
const
;
...
...
dbms/src/Storages/MergeTree/MergeTreeThreadSelectBlockInputStream.cpp
浏览文件 @
ee5dcd50
...
...
@@ -74,7 +74,7 @@ bool MergeTreeThreadSelectBlockInputStream::getNewTask()
if
(
!
reader
)
{
auto
rest_mark_ranges
=
pool
->
getRestMarks
(
path
,
task
->
mark_ranges
[
0
]);
auto
rest_mark_ranges
=
pool
->
getRestMarks
(
*
task
->
data_part
,
task
->
mark_ranges
[
0
]);
if
(
use_uncompressed_cache
)
owned_uncompressed_cache
=
storage
.
global_context
.
getUncompressedCache
();
...
...
@@ -95,7 +95,7 @@ bool MergeTreeThreadSelectBlockInputStream::getNewTask()
/// in other case we can reuse readers, anyway they will be "seeked" to required mark
if
(
path
!=
last_readed_part_path
)
{
auto
rest_mark_ranges
=
pool
->
getRestMarks
(
path
,
task
->
mark_ranges
[
0
]);
auto
rest_mark_ranges
=
pool
->
getRestMarks
(
*
task
->
data_part
,
task
->
mark_ranges
[
0
]);
/// retain avg_value_size_hints
reader
=
std
::
make_unique
<
MergeTreeReader
>
(
path
,
task
->
data_part
,
task
->
columns
,
owned_uncompressed_cache
.
get
(),
owned_mark_cache
.
get
(),
save_marks_in_cache
,
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录