milvus/internal/core/src/exec/expression/LogicalBinaryExpr.h
zhagnlu 6c55db44f1
enhance: reorder sub expr for conjunct expr (#39872)
two point:
 (1) reoder conjucts expr's subexpr, postpone heavy operations
sequence: int(column) -> index(column) -> string(column) -> light
conjuct
...... -> json(column) -> heavy conjuct -> two_column_compare
(2) support pre filter for expr execute, skip scan raw data that had
been skipped
     because of preceding expr result.

#39869

Signed-off-by: luzhang <luzhang@zilliz.com>
Co-authored-by: luzhang <luzhang@zilliz.com>
2025-03-19 14:50:14 +08:00

111 lines
3.2 KiB
C++

// 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.
#pragma once
#include <fmt/core.h>
#include "common/EasyAssert.h"
#include "common/Types.h"
#include "common/Vector.h"
#include "exec/expression/Expr.h"
#include "segcore/SegmentInterface.h"
namespace milvus {
namespace exec {
enum class LogicalOpType { Invalid = 0, And = 1, Or = 2, Xor = 3, Minus = 4 };
template <LogicalOpType op>
struct LogicalElementFunc {
void
operator()(TargetBitmapView left, TargetBitmapView right, int n) {
/*
// This is the original code, kept here for the documentation purposes
for (size_t i = 0; i < n; ++i) {
if constexpr (op == LogicalOpType::And) {
left[i] &= right[i];
} else if constexpr (op == LogicalOpType::Or) {
left[i] |= right[i];
} else {
PanicInfo(
OpTypeInvalid, "unsupported logical operator: {}", op);
}
}
*/
if constexpr (op == LogicalOpType::And) {
left.inplace_and(right, n);
} else if constexpr (op == LogicalOpType::Or) {
left.inplace_or(right, n);
} else if constexpr (op == LogicalOpType::Xor) {
left.inplace_xor(right, n);
} else if constexpr (op == LogicalOpType::Minus) {
left.inplace_sub(right, n);
} else {
PanicInfo(OpTypeInvalid, "unsupported logical operator: {}", op);
}
}
};
class PhyLogicalBinaryExpr : public Expr {
public:
PhyLogicalBinaryExpr(
const std::vector<std::shared_ptr<Expr>>& input,
const std::shared_ptr<const milvus::expr::LogicalBinaryExpr>& expr,
const std::string& name)
: Expr(DataType::BOOL, std::move(input), name), expr_(expr) {
}
void
Eval(EvalCtx& context, VectorPtr& result) override;
void
MoveCursor() override {
if (!has_offset_input_) {
inputs_[0]->MoveCursor();
inputs_[1]->MoveCursor();
}
}
bool
SupportOffsetInput() override {
return inputs_[0]->SupportOffsetInput() &&
inputs_[1]->SupportOffsetInput();
}
std::string
ToString() const {
return fmt::format("{}", expr_->ToString());
}
bool
IsSource() const override {
return false;
}
std::optional<milvus::expr::ColumnInfo>
GetColumnInfo() const override {
return std::nullopt;
}
private:
std::shared_ptr<const milvus::expr::LogicalBinaryExpr> expr_;
};
} //namespace exec
} // namespace milvus