mirror of
https://gitee.com/milvus-io/milvus.git
synced 2026-01-07 19:31:51 +08:00
5b1430f27e
fix: #39755 The following shows a simple benchmark where insert 1M docs where all rows are "hello", the latency is segcore level, CPU is 9900K: master: 2.62ms this PR: 2.11ms bench mark code: ``` TEST(TextMatch, TestPerf) { auto schema = GenTestSchema({}, true); auto seg = CreateSealedSegment(schema, empty_index_meta); int64_t N = 1000000; uint64_t seed = 19190504; auto raw_data = DataGen(schema, N, seed); auto str_col = raw_data.raw_->mutable_fields_data() ->at(1) .mutable_scalars() ->mutable_string_data() ->mutable_data(); for (int64_t i = 0; i < N - 1; i++) { str_col->at(i) = "hello"; } SealedLoadFieldData(raw_data, *seg); seg->CreateTextIndex(FieldId(101)); auto now = std::chrono::high_resolution_clock::now(); auto expr = GetMatchExpr(schema, "hello", OpType::TextMatch); auto final = ExecuteQueryExpr(expr, seg.get(), N, MAX_TIMESTAMP); auto end = std::chrono::high_resolution_clock::now(); auto duration = std::chrono::duration_cast<std::chrono::microseconds>(end - now); std::cout << "TextMatch query time: " << duration.count() << "ms" << std::endl; } ``` --------- Signed-off-by: SpadeA <tangchenjie1210@gmail.com>
38 lines
1.3 KiB
C++
38 lines
1.3 KiB
C++
// Copyright (C) 2019-2020 Zilliz. All rights reserved.
|
|
//
|
|
// Licensed 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
|
|
|
|
namespace milvus::index {
|
|
inline void
|
|
apply_hits_with_filter(milvus::TargetBitmap& bitset,
|
|
const std::function<bool(size_t /* offset */)>& filter) {
|
|
std::optional<size_t> result = bitset.find_first();
|
|
while (result.has_value()) {
|
|
size_t offset = result.value();
|
|
bitset[offset] = filter(offset);
|
|
result = bitset.find_next(offset);
|
|
}
|
|
}
|
|
|
|
inline void
|
|
apply_hits_with_callback(
|
|
milvus::TargetBitmap& bitset,
|
|
const std::function<void(size_t /* offset */)>& callback) {
|
|
std::optional<size_t> result = bitset.find_first();
|
|
while (result.has_value()) {
|
|
size_t offset = result.value();
|
|
callback(offset);
|
|
result = bitset.find_next(offset);
|
|
}
|
|
}
|
|
} // namespace milvus::index
|