mirror of
https://gitee.com/milvus-io/milvus.git
synced 2024-12-05 05:18:52 +08:00
891c202b73
Signed-off-by: yudong.cai <yudong.cai@zilliz.com>
158 lines
4.6 KiB
Go
158 lines
4.6 KiB
Go
// Licensed to the LF AI & Data foundation 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.
|
|
|
|
package querynode
|
|
|
|
import (
|
|
"sync"
|
|
|
|
"github.com/milvus-io/milvus/internal/log"
|
|
"github.com/milvus-io/milvus/internal/util/flowgraph"
|
|
"github.com/milvus-io/milvus/internal/util/trace"
|
|
"github.com/opentracing/opentracing-go"
|
|
"go.uber.org/zap"
|
|
)
|
|
|
|
// deleteNode is the one of nodes in delta flow graph
|
|
type deleteNode struct {
|
|
baseNode
|
|
replica ReplicaInterface // historical
|
|
}
|
|
|
|
// Name returns the name of deleteNode
|
|
func (dNode *deleteNode) Name() string {
|
|
return "dNode"
|
|
}
|
|
|
|
// Operate handles input messages, do delete operations
|
|
func (dNode *deleteNode) Operate(in []flowgraph.Msg) []flowgraph.Msg {
|
|
if len(in) != 1 {
|
|
log.Error("Invalid operate message input in deleteNode", zap.Int("input length", len(in)))
|
|
// TODO: add error handling
|
|
}
|
|
|
|
dMsg, ok := in[0].(*deleteMsg)
|
|
if !ok {
|
|
log.Warn("type assertion failed for deleteMsg")
|
|
// TODO: add error handling
|
|
}
|
|
|
|
delData := &deleteData{
|
|
deleteIDs: map[UniqueID][]int64{},
|
|
deleteTimestamps: map[UniqueID][]Timestamp{},
|
|
deleteOffset: map[UniqueID]int64{},
|
|
}
|
|
|
|
if dMsg == nil {
|
|
return []Msg{}
|
|
}
|
|
|
|
var spans []opentracing.Span
|
|
for _, msg := range dMsg.deleteMessages {
|
|
sp, ctx := trace.StartSpanFromContext(msg.TraceCtx())
|
|
spans = append(spans, sp)
|
|
msg.SetTraceCtx(ctx)
|
|
}
|
|
|
|
// 1. filter segment by bloom filter
|
|
for i, delMsg := range dMsg.deleteMessages {
|
|
traceID, _, _ := trace.InfoFromSpan(spans[i])
|
|
log.Info("Process delete request in QueryNode", zap.String("traceID", traceID))
|
|
|
|
if dNode.replica.getSegmentNum() != 0 {
|
|
log.Debug("delete in historical replica",
|
|
zap.Any("collectionID", delMsg.CollectionID),
|
|
zap.Any("collectionName", delMsg.CollectionName),
|
|
zap.Any("pks", delMsg.PrimaryKeys),
|
|
zap.Any("timestamp", delMsg.Timestamps),
|
|
zap.Any("timestampBegin", delMsg.BeginTs()),
|
|
zap.Any("timestampEnd", delMsg.EndTs()),
|
|
)
|
|
processDeleteMessages(dNode.replica, delMsg, delData)
|
|
}
|
|
}
|
|
|
|
// 2. do preDelete
|
|
for segmentID, pks := range delData.deleteIDs {
|
|
segment, err := dNode.replica.getSegmentByID(segmentID)
|
|
if err != nil {
|
|
log.Debug(err.Error())
|
|
continue
|
|
}
|
|
offset := segment.segmentPreDelete(len(pks))
|
|
delData.deleteOffset[segmentID] = offset
|
|
}
|
|
|
|
// 3. do delete
|
|
wg := sync.WaitGroup{}
|
|
for segmentID := range delData.deleteOffset {
|
|
wg.Add(1)
|
|
go dNode.delete(delData, segmentID, &wg)
|
|
}
|
|
wg.Wait()
|
|
|
|
var res Msg = &serviceTimeMsg{
|
|
timeRange: dMsg.timeRange,
|
|
}
|
|
for _, sp := range spans {
|
|
sp.Finish()
|
|
}
|
|
|
|
return []Msg{res}
|
|
}
|
|
|
|
// delete will do delete operation at segment which id is segmentID
|
|
func (dNode *deleteNode) delete(deleteData *deleteData, segmentID UniqueID, wg *sync.WaitGroup) {
|
|
defer wg.Done()
|
|
log.Debug("QueryNode::dNode::delete", zap.Any("SegmentID", segmentID))
|
|
targetSegment, err := dNode.replica.getSegmentByID(segmentID)
|
|
if err != nil {
|
|
log.Error(err.Error())
|
|
return
|
|
}
|
|
|
|
if targetSegment.segmentType != segmentTypeSealed && targetSegment.segmentType != segmentTypeIndexing {
|
|
return
|
|
}
|
|
|
|
ids := deleteData.deleteIDs[segmentID]
|
|
timestamps := deleteData.deleteTimestamps[segmentID]
|
|
offset := deleteData.deleteOffset[segmentID]
|
|
|
|
err = targetSegment.segmentDelete(offset, &ids, ×tamps)
|
|
if err != nil {
|
|
log.Warn("QueryNode: targetSegmentDelete failed", zap.Error(err))
|
|
return
|
|
}
|
|
|
|
log.Debug("Do delete done", zap.Int("len", len(deleteData.deleteIDs[segmentID])), zap.Int64("segmentID", segmentID), zap.Any("SegmentType", targetSegment.segmentType))
|
|
}
|
|
|
|
// newDeleteNode returns a new deleteNode
|
|
func newDeleteNode(historicalReplica ReplicaInterface) *deleteNode {
|
|
maxQueueLength := Params.QueryNodeCfg.FlowGraphMaxQueueLength
|
|
maxParallelism := Params.QueryNodeCfg.FlowGraphMaxParallelism
|
|
|
|
baseNode := baseNode{}
|
|
baseNode.SetMaxQueueLength(maxQueueLength)
|
|
baseNode.SetMaxParallelism(maxParallelism)
|
|
|
|
return &deleteNode{
|
|
baseNode: baseNode,
|
|
replica: historicalReplica,
|
|
}
|
|
}
|