Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
milvus
milvus
提交
ec33f3b4
M
milvus
项目概览
milvus
/
milvus
12 个月 前同步成功
通知
261
Star
22476
Fork
2472
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
M
milvus
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
未验证
提交
ec33f3b4
编写于
12月 17, 2021
作者:
G
godchen
提交者:
GitHub
12月 17, 2021
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[skip e2e]Fix datanode compaction policy typo (#13635)
Signed-off-by:
N
godchen0212
<
qingxiang.chen@zilliz.com
>
上级
e36f7287
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
17 addition
and
17 deletion
+17
-17
internal/datacoord/compaction_policy.go
internal/datacoord/compaction_policy.go
+17
-17
未找到文件。
internal/datacoord/compaction_policy.go
浏览文件 @
ec33f3b4
...
...
@@ -7,25 +7,25 @@ import (
)
type
singleCompactionPolicy
interface
{
// generatePlan generates a compaction plan for single com
ap
ction, return nil if no plan can be generated.
generatePlan
(
segment
*
SegmentInfo
,
time
t
ravel
*
timetravel
)
*
datapb
.
CompactionPlan
// generatePlan generates a compaction plan for single com
pa
ction, return nil if no plan can be generated.
generatePlan
(
segment
*
SegmentInfo
,
time
T
ravel
*
timetravel
)
*
datapb
.
CompactionPlan
}
type
mergeCompactionPolicy
interface
{
// generatePlan generates a compaction plan for merge compaction, return nil if no plan can be generated.
generatePlan
(
segments
[]
*
SegmentInfo
,
time
t
ravel
*
timetravel
)
[]
*
datapb
.
CompactionPlan
generatePlan
(
segments
[]
*
SegmentInfo
,
time
T
ravel
*
timetravel
)
[]
*
datapb
.
CompactionPlan
}
type
singleCompactionFunc
func
(
segment
*
SegmentInfo
,
time
t
ravel
*
timetravel
)
*
datapb
.
CompactionPlan
type
singleCompactionFunc
func
(
segment
*
SegmentInfo
,
time
T
ravel
*
timetravel
)
*
datapb
.
CompactionPlan
func
(
f
singleCompactionFunc
)
generatePlan
(
segment
*
SegmentInfo
,
time
t
ravel
*
timetravel
)
*
datapb
.
CompactionPlan
{
return
f
(
segment
,
time
t
ravel
)
func
(
f
singleCompactionFunc
)
generatePlan
(
segment
*
SegmentInfo
,
time
T
ravel
*
timetravel
)
*
datapb
.
CompactionPlan
{
return
f
(
segment
,
time
T
ravel
)
}
func
chooseAllBinlogs
(
segment
*
SegmentInfo
,
time
t
ravel
*
timetravel
)
*
datapb
.
CompactionPlan
{
func
chooseAllBinlogs
(
segment
*
SegmentInfo
,
time
T
ravel
*
timetravel
)
*
datapb
.
CompactionPlan
{
var
deltaLogs
[]
*
datapb
.
DeltaLogInfo
for
_
,
l
:=
range
segment
.
GetDeltalogs
()
{
if
l
.
TimestampTo
<
time
t
ravel
.
time
{
if
l
.
TimestampTo
<
time
T
ravel
.
time
{
deltaLogs
=
append
(
deltaLogs
,
l
)
}
}
...
...
@@ -44,18 +44,18 @@ func chooseAllBinlogs(segment *SegmentInfo, timetravel *timetravel) *datapb.Comp
},
},
Type
:
datapb
.
CompactionType_InnerCompaction
,
Timetravel
:
time
t
ravel
.
time
,
Timetravel
:
time
T
ravel
.
time
,
Channel
:
segment
.
GetInsertChannel
(),
}
}
type
mergeCompactionFunc
func
(
segments
[]
*
SegmentInfo
,
time
t
ravel
*
timetravel
)
[]
*
datapb
.
CompactionPlan
type
mergeCompactionFunc
func
(
segments
[]
*
SegmentInfo
,
time
T
ravel
*
timetravel
)
[]
*
datapb
.
CompactionPlan
func
(
f
mergeCompactionFunc
)
generatePlan
(
segments
[]
*
SegmentInfo
,
time
t
ravel
*
timetravel
)
[]
*
datapb
.
CompactionPlan
{
return
f
(
segments
,
time
t
ravel
)
func
(
f
mergeCompactionFunc
)
generatePlan
(
segments
[]
*
SegmentInfo
,
time
T
ravel
*
timetravel
)
[]
*
datapb
.
CompactionPlan
{
return
f
(
segments
,
time
T
ravel
)
}
func
greedyMergeCompaction
(
segments
[]
*
SegmentInfo
,
time
t
ravel
*
timetravel
)
[]
*
datapb
.
CompactionPlan
{
func
greedyMergeCompaction
(
segments
[]
*
SegmentInfo
,
time
T
ravel
*
timetravel
)
[]
*
datapb
.
CompactionPlan
{
if
len
(
segments
)
==
0
{
return
nil
}
...
...
@@ -64,16 +64,16 @@ func greedyMergeCompaction(segments []*SegmentInfo, timetravel *timetravel) []*d
return
segments
[
i
]
.
NumOfRows
<
segments
[
j
]
.
NumOfRows
})
return
greedyGeneratePlans
(
segments
,
time
t
ravel
)
return
greedyGeneratePlans
(
segments
,
time
T
ravel
)
}
func
greedyGeneratePlans
(
sortedSegments
[]
*
SegmentInfo
,
time
t
ravel
*
timetravel
)
[]
*
datapb
.
CompactionPlan
{
func
greedyGeneratePlans
(
sortedSegments
[]
*
SegmentInfo
,
time
T
ravel
*
timetravel
)
[]
*
datapb
.
CompactionPlan
{
maxRowNumPerSegment
:=
sortedSegments
[
0
]
.
MaxRowNum
plans
:=
make
([]
*
datapb
.
CompactionPlan
,
0
)
free
:=
maxRowNumPerSegment
plan
:=
&
datapb
.
CompactionPlan
{
Timetravel
:
time
t
ravel
.
time
,
Timetravel
:
time
T
ravel
.
time
,
Type
:
datapb
.
CompactionType_MergeCompaction
,
Channel
:
sortedSegments
[
0
]
.
GetInsertChannel
(),
}
...
...
@@ -94,7 +94,7 @@ func greedyGeneratePlans(sortedSegments []*SegmentInfo, timetravel *timetravel)
}
plans
=
append
(
plans
,
plan
)
plan
=
&
datapb
.
CompactionPlan
{
Timetravel
:
time
t
ravel
.
time
,
Timetravel
:
time
T
ravel
.
time
,
Type
:
datapb
.
CompactionType_MergeCompaction
,
Channel
:
sortedSegments
[
0
]
.
GetInsertChannel
(),
}
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录