Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
milvus
milvus
提交
9577da9f
M
milvus
项目概览
milvus
/
milvus
大约 1 年 前同步成功
通知
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,发现更多精彩内容 >>
提交
9577da9f
编写于
12月 28, 2020
作者:
X
XuanYang-cn
提交者:
yefu.chen
12月 28, 2020
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Add writenode main
Signed-off-by:
N
XuanYang-cn
<
xuan.yang@zilliz.com
>
上级
eb871718
变更
24
显示空白变更内容
内联
并排
Showing
24 changed file
with
58 addition
and
546 deletion
+58
-546
Makefile
Makefile
+4
-0
internal/core/src/common/Types.cpp
internal/core/src/common/Types.cpp
+3
-10
internal/core/src/common/Types.h
internal/core/src/common/Types.h
+1
-3
internal/core/src/query/CMakeLists.txt
internal/core/src/query/CMakeLists.txt
+0
-1
internal/core/src/query/Plan.cpp
internal/core/src/query/Plan.cpp
+1
-5
internal/core/src/query/PlanNode.h
internal/core/src/query/PlanNode.h
+0
-1
internal/core/src/query/Search.cpp
internal/core/src/query/Search.cpp
+21
-0
internal/core/src/query/SearchOnSealed.cpp
internal/core/src/query/SearchOnSealed.cpp
+0
-94
internal/core/src/query/SearchOnSealed.h
internal/core/src/query/SearchOnSealed.h
+0
-29
internal/core/src/query/visitors/ExecPlanNodeVisitor.cpp
internal/core/src/query/visitors/ExecPlanNodeVisitor.cpp
+9
-24
internal/core/src/segcore/CMakeLists.txt
internal/core/src/segcore/CMakeLists.txt
+1
-3
internal/core/src/segcore/SealedIndexingRecord.cpp
internal/core/src/segcore/SealedIndexingRecord.cpp
+0
-15
internal/core/src/segcore/SealedIndexingRecord.h
internal/core/src/segcore/SealedIndexingRecord.h
+0
-57
internal/core/src/segcore/SegmentBase.h
internal/core/src/segcore/SegmentBase.h
+0
-4
internal/core/src/segcore/SegmentNaive.h
internal/core/src/segcore/SegmentNaive.h
+0
-5
internal/core/src/segcore/SegmentSmallIndex.cpp
internal/core/src/segcore/SegmentSmallIndex.cpp
+3
-30
internal/core/src/segcore/SegmentSmallIndex.h
internal/core/src/segcore/SegmentSmallIndex.h
+5
-12
internal/core/src/segcore/reduce_c.cpp
internal/core/src/segcore/reduce_c.cpp
+4
-0
internal/core/unittest/CMakeLists.txt
internal/core/unittest/CMakeLists.txt
+0
-1
internal/core/unittest/test_binary.cpp
internal/core/unittest/test_binary.cpp
+1
-1
internal/core/unittest/test_query.cpp
internal/core/unittest/test_query.cpp
+2
-4
internal/core/unittest/test_sealed.cpp
internal/core/unittest/test_sealed.cpp
+0
-216
internal/core/unittest/test_utils/DataGen.h
internal/core/unittest/test_utils/DataGen.h
+2
-30
internal/writenode/flow_graph_insert_buffer_node.go
internal/writenode/flow_graph_insert_buffer_node.go
+1
-1
未找到文件。
Makefile
浏览文件 @
9577da9f
...
@@ -71,6 +71,8 @@ build-go: build-cpp
...
@@ -71,6 +71,8 @@ build-go: build-cpp
@
mkdir
-p
$(INSTALL_PATH)
&&
go
env
-w
CGO_ENABLED
=
"1"
&&
GO111MODULE
=
on
$(GO)
build
-o
$(INSTALL_PATH)
/querynode
$(PWD)
/cmd/querynode/query_node.go 1>/dev/null
@
mkdir
-p
$(INSTALL_PATH)
&&
go
env
-w
CGO_ENABLED
=
"1"
&&
GO111MODULE
=
on
$(GO)
build
-o
$(INSTALL_PATH)
/querynode
$(PWD)
/cmd/querynode/query_node.go 1>/dev/null
@
echo
"Building indexbuilder ..."
@
echo
"Building indexbuilder ..."
@
mkdir
-p
$(INSTALL_PATH)
&&
go
env
-w
CGO_ENABLED
=
"1"
&&
GO111MODULE
=
on
$(GO)
build
-o
$(INSTALL_PATH)
/indexbuilder
$(PWD)
/cmd/indexbuilder/indexbuilder.go 1>/dev/null
@
mkdir
-p
$(INSTALL_PATH)
&&
go
env
-w
CGO_ENABLED
=
"1"
&&
GO111MODULE
=
on
$(GO)
build
-o
$(INSTALL_PATH)
/indexbuilder
$(PWD)
/cmd/indexbuilder/indexbuilder.go 1>/dev/null
@
echo
"Building write node ..."
@
mkdir
-p
$(INSTALL_PATH)
&&
go
env
-w
CGO_ENABLED
=
"1"
&&
GO111MODULE
=
on
$(GO)
build
-o
$(INSTALL_PATH)
/writenode
$(PWD)
/cmd/writenode/writenode.go 1>/dev/null
build-cpp
:
build-cpp
:
@
(
env
bash
$(PWD)
/scripts/core_build.sh
-f
"
$(CUSTOM_THIRDPARTY_PATH)
"
)
@
(
env
bash
$(PWD)
/scripts/core_build.sh
-f
"
$(CUSTOM_THIRDPARTY_PATH)
"
)
...
@@ -104,6 +106,7 @@ install: all
...
@@ -104,6 +106,7 @@ install: all
@
mkdir
-p
$(GOPATH)
/bin
&&
cp
-f
$(PWD)
/bin/querynode
$(GOPATH)
/bin/querynode
@
mkdir
-p
$(GOPATH)
/bin
&&
cp
-f
$(PWD)
/bin/querynode
$(GOPATH)
/bin/querynode
@
mkdir
-p
$(GOPATH)
/bin
&&
cp
-f
$(PWD)
/bin/master
$(GOPATH)
/bin/master
@
mkdir
-p
$(GOPATH)
/bin
&&
cp
-f
$(PWD)
/bin/master
$(GOPATH)
/bin/master
@
mkdir
-p
$(GOPATH)
/bin
&&
cp
-f
$(PWD)
/bin/proxy
$(GOPATH)
/bin/proxy
@
mkdir
-p
$(GOPATH)
/bin
&&
cp
-f
$(PWD)
/bin/proxy
$(GOPATH)
/bin/proxy
@
mkdir
-p
$(GOPATH)
/bin
&&
cp
-f
$(PWD)
/bin/writenode
$(GOPATH)
/bin/writenode
@
mkdir
-p
$(LIBRARY_PATH)
&&
cp
-f
$(PWD)
/internal/core/output/lib/
*
$(LIBRARY_PATH)
@
mkdir
-p
$(LIBRARY_PATH)
&&
cp
-f
$(PWD)
/internal/core/output/lib/
*
$(LIBRARY_PATH)
@
echo
"Installation successful."
@
echo
"Installation successful."
...
@@ -114,3 +117,4 @@ clean:
...
@@ -114,3 +117,4 @@ clean:
@
rm
-rvf
querynode
@
rm
-rvf
querynode
@
rm
-rvf
master
@
rm
-rvf
master
@
rm
-rvf
proxy
@
rm
-rvf
proxy
@
rm
-rvf
writenode
internal/core/src/common/Types.cpp
浏览文件 @
9577da9f
...
@@ -22,7 +22,7 @@ namespace milvus {
...
@@ -22,7 +22,7 @@ namespace milvus {
using
boost
::
algorithm
::
to_lower_copy
;
using
boost
::
algorithm
::
to_lower_copy
;
namespace
Metric
=
knowhere
::
Metric
;
namespace
Metric
=
knowhere
::
Metric
;
static
const
auto
metric_bi
map
=
[]
{
static
auto
map
=
[]
{
boost
::
bimap
<
std
::
string
,
MetricType
>
mapping
;
boost
::
bimap
<
std
::
string
,
MetricType
>
mapping
;
using
pos
=
boost
::
bimap
<
std
::
string
,
MetricType
>::
value_type
;
using
pos
=
boost
::
bimap
<
std
::
string
,
MetricType
>::
value_type
;
mapping
.
insert
(
pos
(
to_lower_copy
(
std
::
string
(
Metric
::
L2
)),
MetricType
::
METRIC_L2
));
mapping
.
insert
(
pos
(
to_lower_copy
(
std
::
string
(
Metric
::
L2
)),
MetricType
::
METRIC_L2
));
...
@@ -38,15 +38,8 @@ static const auto metric_bimap = [] {
...
@@ -38,15 +38,8 @@ static const auto metric_bimap = [] {
MetricType
MetricType
GetMetricType
(
const
std
::
string
&
type_name
)
{
GetMetricType
(
const
std
::
string
&
type_name
)
{
auto
real_name
=
to_lower_copy
(
type_name
);
auto
real_name
=
to_lower_copy
(
type_name
);
AssertInfo
(
metric_bimap
.
left
.
count
(
real_name
),
"metric type not found: ("
+
type_name
+
")"
);
AssertInfo
(
map
.
left
.
count
(
real_name
),
"metric type not found: ("
+
type_name
+
")"
);
return
metric_bimap
.
left
.
at
(
real_name
);
return
map
.
left
.
at
(
real_name
);
}
std
::
string
MetricTypeToName
(
MetricType
metric_type
)
{
AssertInfo
(
metric_bimap
.
right
.
count
(
metric_type
),
"metric_type enum("
+
std
::
to_string
((
int
)
metric_type
)
+
") not found"
);
return
metric_bimap
.
right
.
at
(
metric_type
);
}
}
}
// namespace milvus
}
// namespace milvus
internal/core/src/common/Types.h
浏览文件 @
9577da9f
...
@@ -23,10 +23,8 @@ using engine::FieldElementType;
...
@@ -23,10 +23,8 @@ using engine::FieldElementType;
using
engine
::
QueryResult
;
using
engine
::
QueryResult
;
using
MetricType
=
faiss
::
MetricType
;
using
MetricType
=
faiss
::
MetricType
;
MetricType
faiss
::
MetricType
GetMetricType
(
const
std
::
string
&
type
);
GetMetricType
(
const
std
::
string
&
type
);
std
::
string
MetricTypeToName
(
MetricType
metric_type
);
// NOTE: dependent type
// NOTE: dependent type
// used at meta-template programming
// used at meta-template programming
...
...
internal/core/src/query/CMakeLists.txt
浏览文件 @
9577da9f
...
@@ -9,7 +9,6 @@ set(MILVUS_QUERY_SRCS
...
@@ -9,7 +9,6 @@ set(MILVUS_QUERY_SRCS
visitors/ExecExprVisitor.cpp
visitors/ExecExprVisitor.cpp
Plan.cpp
Plan.cpp
Search.cpp
Search.cpp
SearchOnSealed.cpp
BruteForceSearch.cpp
BruteForceSearch.cpp
)
)
add_library
(
milvus_query
${
MILVUS_QUERY_SRCS
}
)
add_library
(
milvus_query
${
MILVUS_QUERY_SRCS
}
)
...
...
internal/core/src/query/Plan.cpp
浏览文件 @
9577da9f
...
@@ -194,12 +194,9 @@ Parser::ParseVecNode(const Json& out_body) {
...
@@ -194,12 +194,9 @@ Parser::ParseVecNode(const Json& out_body) {
auto
topK
=
vec_info
[
"topk"
];
auto
topK
=
vec_info
[
"topk"
];
AssertInfo
(
topK
>
0
,
"topK must greater than 0"
);
AssertInfo
(
topK
>
0
,
"topK must greater than 0"
);
AssertInfo
(
topK
<
16384
,
"topK is too large"
);
AssertInfo
(
topK
<
16384
,
"topK is too large"
);
auto
field_meta
=
schema
.
operator
[](
field_name
);
auto
field_offset_opt
=
schema
.
get_offset
(
field_name
);
AssertInfo
(
field_offset_opt
.
has_value
(),
"field_name("
+
field_name
+
") not found"
);
auto
vec_node
=
[
&
]()
->
std
::
unique_ptr
<
VectorPlanNode
>
{
auto
vec_node
=
[
&
]()
->
std
::
unique_ptr
<
VectorPlanNode
>
{
auto
field_meta
=
schema
.
operator
[](
field_name
);
auto
data_type
=
field_meta
.
get_data_type
();
auto
data_type
=
field_meta
.
get_data_type
();
if
(
data_type
==
DataType
::
VECTOR_FLOAT
)
{
if
(
data_type
==
DataType
::
VECTOR_FLOAT
)
{
return
std
::
make_unique
<
FloatVectorANNS
>
();
return
std
::
make_unique
<
FloatVectorANNS
>
();
...
@@ -211,7 +208,6 @@ Parser::ParseVecNode(const Json& out_body) {
...
@@ -211,7 +208,6 @@ Parser::ParseVecNode(const Json& out_body) {
vec_node
->
query_info_
.
metric_type_
=
vec_info
.
at
(
"metric_type"
);
vec_node
->
query_info_
.
metric_type_
=
vec_info
.
at
(
"metric_type"
);
vec_node
->
query_info_
.
search_params_
=
vec_info
.
at
(
"params"
);
vec_node
->
query_info_
.
search_params_
=
vec_info
.
at
(
"params"
);
vec_node
->
query_info_
.
field_id_
=
field_name
;
vec_node
->
query_info_
.
field_id_
=
field_name
;
vec_node
->
query_info_
.
field_offset_
=
field_offset_opt
.
value
();
vec_node
->
placeholder_tag_
=
vec_info
.
at
(
"query"
);
vec_node
->
placeholder_tag_
=
vec_info
.
at
(
"query"
);
auto
tag
=
vec_node
->
placeholder_tag_
;
auto
tag
=
vec_node
->
placeholder_tag_
;
AssertInfo
(
!
tag2field_
.
count
(
tag
),
"duplicated placeholder tag"
);
AssertInfo
(
!
tag2field_
.
count
(
tag
),
"duplicated placeholder tag"
);
...
...
internal/core/src/query/PlanNode.h
浏览文件 @
9577da9f
...
@@ -41,7 +41,6 @@ using PlanNodePtr = std::unique_ptr<PlanNode>;
...
@@ -41,7 +41,6 @@ using PlanNodePtr = std::unique_ptr<PlanNode>;
struct
QueryInfo
{
struct
QueryInfo
{
int64_t
topK_
;
int64_t
topK_
;
FieldId
field_id_
;
FieldId
field_id_
;
int64_t
field_offset_
;
std
::
string
metric_type_
;
// TODO: use enum
std
::
string
metric_type_
;
// TODO: use enum
nlohmann
::
json
search_params_
;
nlohmann
::
json
search_params_
;
};
};
...
...
internal/core/src/query/Search.cpp
浏览文件 @
9577da9f
...
@@ -29,6 +29,7 @@ create_bitmap_view(std::optional<const BitmapSimple*> bitmaps_opt, int64_t chunk
...
@@ -29,6 +29,7 @@ create_bitmap_view(std::optional<const BitmapSimple*> bitmaps_opt, int64_t chunk
auto
src_vec
=
~
bitmaps
.
at
(
chunk_id
);
auto
src_vec
=
~
bitmaps
.
at
(
chunk_id
);
auto
dst
=
std
::
make_shared
<
faiss
::
ConcurrentBitset
>
(
src_vec
.
size
());
auto
dst
=
std
::
make_shared
<
faiss
::
ConcurrentBitset
>
(
src_vec
.
size
());
auto
iter
=
reinterpret_cast
<
BitmapChunk
::
block_type
*>
(
dst
->
mutable_data
());
auto
iter
=
reinterpret_cast
<
BitmapChunk
::
block_type
*>
(
dst
->
mutable_data
());
boost
::
to_block_range
(
src_vec
,
iter
);
boost
::
to_block_range
(
src_vec
,
iter
);
return
dst
;
return
dst
;
}
}
...
@@ -130,6 +131,16 @@ QueryBruteForceImpl(const segcore::SegmentSmallIndex& segment,
...
@@ -130,6 +131,16 @@ QueryBruteForceImpl(const segcore::SegmentSmallIndex& segment,
results
.
topK_
=
topK
;
results
.
topK_
=
topK
;
results
.
num_queries_
=
num_queries
;
results
.
num_queries_
=
num_queries
;
// TODO: deprecated code begin
final_uids
=
results
.
internal_seg_offsets_
;
for
(
auto
&
id
:
final_uids
)
{
if
(
id
==
-
1
)
{
continue
;
}
id
=
record
.
uids_
[
id
];
}
results
.
result_ids_
=
std
::
move
(
final_uids
);
// TODO: deprecated code end
return
Status
::
OK
();
return
Status
::
OK
();
}
}
...
@@ -208,6 +219,16 @@ BinaryQueryBruteForceImpl(const segcore::SegmentSmallIndex& segment,
...
@@ -208,6 +219,16 @@ BinaryQueryBruteForceImpl(const segcore::SegmentSmallIndex& segment,
results
.
topK_
=
topK
;
results
.
topK_
=
topK
;
results
.
num_queries_
=
num_queries
;
results
.
num_queries_
=
num_queries
;
// TODO: deprecated code begin
final_uids
=
results
.
internal_seg_offsets_
;
for
(
auto
&
id
:
final_uids
)
{
if
(
id
==
-
1
)
{
continue
;
}
id
=
record
.
uids_
[
id
];
}
results
.
result_ids_
=
std
::
move
(
final_uids
);
// TODO: deprecated code end
return
Status
::
OK
();
return
Status
::
OK
();
}
}
...
...
internal/core/src/query/SearchOnSealed.cpp
已删除
100644 → 0
浏览文件 @
eb871718
// 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
//
// Created by mike on 12/26/20.
//
#include "query/SearchOnSealed.h"
#include <knowhere/index/vector_index/VecIndex.h>
#include "knowhere/index/vector_index/helpers/IndexParameter.h"
#include "knowhere/index/vector_index/adapter/VectorAdapter.h"
namespace
milvus
::
query
{
aligned_vector
<
uint8_t
>
AssembleBitmap
(
const
BitmapSimple
&
bitmap_simple
)
{
int64_t
N
=
0
;
for
(
auto
&
bitmap
:
bitmap_simple
)
{
N
+=
bitmap
.
size
();
}
aligned_vector
<
uint8_t
>
result
(
upper_align
(
upper_div
(
N
,
8
),
sizeof
(
BitmapChunk
::
block_type
)));
auto
acc_byte_count
=
0
;
for
(
auto
&
bitmap_raw
:
bitmap_simple
)
{
auto
bitmap
=
~
bitmap_raw
;
auto
size
=
bitmap
.
size
();
Assert
(
size
%
8
==
0
);
auto
byte_count
=
size
/
8
;
auto
iter
=
reinterpret_cast
<
BitmapChunk
::
block_type
*>
(
result
.
data
()
+
acc_byte_count
);
boost
::
to_block_range
(
bitmap
,
iter
);
acc_byte_count
+=
byte_count
;
}
return
result
;
}
void
SearchOnSealed
(
const
Schema
&
schema
,
const
segcore
::
SealedIndexingRecord
&
record
,
const
QueryInfo
&
query_info
,
const
float
*
query_data
,
int64_t
num_queries
,
Timestamp
timestamp
,
std
::
optional
<
const
BitmapSimple
*>
bitmaps_opt
,
QueryResult
&
result
)
{
auto
topK
=
query_info
.
topK_
;
auto
field_offset
=
query_info
.
field_offset_
;
auto
&
field
=
schema
[
field_offset
];
Assert
(
field
.
get_data_type
()
==
DataType
::
VECTOR_FLOAT
);
auto
dim
=
field
.
get_dim
();
Assert
(
record
.
test_readiness
(
field_offset
));
auto
indexing_entry
=
record
.
get_entry
(
field_offset
);
Assert
(
indexing_entry
->
metric_type_
==
GetMetricType
(
query_info
.
metric_type_
));
auto
final
=
[
&
]
{
auto
ds
=
knowhere
::
GenDataset
(
num_queries
,
dim
,
query_data
);
auto
conf
=
query_info
.
search_params_
;
conf
[
milvus
::
knowhere
::
meta
::
TOPK
]
=
query_info
.
topK_
;
conf
[
milvus
::
knowhere
::
Metric
::
TYPE
]
=
MetricTypeToName
(
indexing_entry
->
metric_type_
);
if
(
bitmaps_opt
.
has_value
())
{
auto
bitmap
=
AssembleBitmap
(
*
bitmaps_opt
.
value
());
return
indexing_entry
->
indexing_
->
Query
(
ds
,
conf
,
faiss
::
BitsetView
(
bitmap
.
data
(),
num_queries
));
}
else
{
return
indexing_entry
->
indexing_
->
Query
(
ds
,
conf
,
nullptr
);
}
}();
auto
ids
=
final
->
Get
<
idx_t
*>
(
knowhere
::
meta
::
IDS
);
auto
distances
=
final
->
Get
<
float
*>
(
knowhere
::
meta
::
DISTANCE
);
auto
total_num
=
num_queries
*
topK
;
result
.
internal_seg_offsets_
.
resize
(
total_num
);
result
.
result_distances_
.
resize
(
total_num
);
result
.
num_queries_
=
num_queries
;
result
.
topK_
=
topK
;
std
::
copy_n
(
ids
,
total_num
,
result
.
internal_seg_offsets_
.
data
());
std
::
copy_n
(
distances
,
total_num
,
result
.
result_distances_
.
data
());
}
}
// namespace milvus::query
internal/core/src/query/SearchOnSealed.h
已删除
100644 → 0
浏览文件 @
eb871718
// 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
#include "segcore/SealedIndexingRecord.h"
#include "query/PlanNode.h"
#include "query/Search.h"
namespace
milvus
::
query
{
void
SearchOnSealed
(
const
Schema
&
schema
,
const
segcore
::
SealedIndexingRecord
&
record
,
const
QueryInfo
&
query_info
,
const
float
*
query_data
,
int64_t
num_queries
,
Timestamp
timestamp
,
std
::
optional
<
const
BitmapSimple
*>
bitmaps_opt
,
QueryResult
&
result
);
}
// namespace milvus::query
internal/core/src/query/visitors/ExecPlanNodeVisitor.cpp
浏览文件 @
9577da9f
...
@@ -17,7 +17,6 @@
...
@@ -17,7 +17,6 @@
#include "segcore/SegmentSmallIndex.h"
#include "segcore/SegmentSmallIndex.h"
#include "query/generated/ExecExprVisitor.h"
#include "query/generated/ExecExprVisitor.h"
#include "query/Search.h"
#include "query/Search.h"
#include "query/SearchOnSealed.h"
namespace
milvus
::
query
{
namespace
milvus
::
query
{
...
@@ -64,24 +63,13 @@ ExecPlanNodeVisitor::visit(FloatVectorANNS& node) {
...
@@ -64,24 +63,13 @@ ExecPlanNodeVisitor::visit(FloatVectorANNS& node) {
auto
&
ph
=
placeholder_group_
.
at
(
0
);
auto
&
ph
=
placeholder_group_
.
at
(
0
);
auto
src_data
=
ph
.
get_blob
<
float
>
();
auto
src_data
=
ph
.
get_blob
<
float
>
();
auto
num_queries
=
ph
.
num_of_queries_
;
auto
num_queries
=
ph
.
num_of_queries_
;
ExecExprVisitor
::
RetType
bitmap_holder
;
std
::
optional
<
const
ExecExprVisitor
::
RetType
*>
bitset_pack
;
if
(
node
.
predicate_
.
has_value
())
{
if
(
node
.
predicate_
.
has_value
())
{
bitmap_holder
=
ExecExprVisitor
(
*
segment
).
call_child
(
*
node
.
predicate_
.
value
());
auto
bitmap
=
ExecExprVisitor
(
*
segment
).
call_child
(
*
node
.
predicate_
.
value
());
bitset_pack
=
&
bitmap_holder
;
auto
ptr
=
&
bitmap
;
}
QueryBruteForceImpl
(
*
segment
,
node
.
query_info_
,
src_data
,
num_queries
,
timestamp_
,
ptr
,
ret
);
auto
&
sealed_indexing
=
segment
->
get_sealed_indexing_record
();
if
(
sealed_indexing
.
test_readiness
(
node
.
query_info_
.
field_offset_
))
{
SearchOnSealed
(
segment
->
get_schema
(),
sealed_indexing
,
node
.
query_info_
,
src_data
,
num_queries
,
timestamp_
,
bitset_pack
,
ret
);
}
else
{
}
else
{
QueryBruteForceImpl
(
*
segment
,
node
.
query_info_
,
src_data
,
num_queries
,
timestamp_
,
bitset_pack
,
ret
);
QueryBruteForceImpl
(
*
segment
,
node
.
query_info_
,
src_data
,
num_queries
,
timestamp_
,
std
::
nullopt
,
ret
);
}
}
ret_
=
ret
;
ret_
=
ret
;
}
}
...
@@ -95,16 +83,13 @@ ExecPlanNodeVisitor::visit(BinaryVectorANNS& node) {
...
@@ -95,16 +83,13 @@ ExecPlanNodeVisitor::visit(BinaryVectorANNS& node) {
auto
&
ph
=
placeholder_group_
.
at
(
0
);
auto
&
ph
=
placeholder_group_
.
at
(
0
);
auto
src_data
=
ph
.
get_blob
<
uint8_t
>
();
auto
src_data
=
ph
.
get_blob
<
uint8_t
>
();
auto
num_queries
=
ph
.
num_of_queries_
;
auto
num_queries
=
ph
.
num_of_queries_
;
ExecExprVisitor
::
RetType
bitmap_holder
;
std
::
optional
<
const
ExecExprVisitor
::
RetType
*>
bitset_pack
;
if
(
node
.
predicate_
.
has_value
())
{
if
(
node
.
predicate_
.
has_value
())
{
bitmap_holder
=
ExecExprVisitor
(
*
segment
).
call_child
(
*
node
.
predicate_
.
value
());
auto
bitmap
=
ExecExprVisitor
(
*
segment
).
call_child
(
*
node
.
predicate_
.
value
());
bitset_pack
=
&
bitmap_holder
;
auto
ptr
=
&
bitmap
;
BinaryQueryBruteForceImpl
(
*
segment
,
node
.
query_info_
,
src_data
,
num_queries
,
timestamp_
,
ptr
,
ret
);
}
else
{
BinaryQueryBruteForceImpl
(
*
segment
,
node
.
query_info_
,
src_data
,
num_queries
,
timestamp_
,
std
::
nullopt
,
ret
);
}
}
BinaryQueryBruteForceImpl
(
*
segment
,
node
.
query_info_
,
src_data
,
num_queries
,
timestamp_
,
bitset_pack
,
ret
);
ret_
=
ret
;
ret_
=
ret
;
}
}
...
...
internal/core/src/segcore/CMakeLists.txt
浏览文件 @
9577da9f
...
@@ -12,9 +12,7 @@ set(SEGCORE_FILES
...
@@ -12,9 +12,7 @@ set(SEGCORE_FILES
Reduce.cpp
Reduce.cpp
plan_c.cpp
plan_c.cpp
reduce_c.cpp
reduce_c.cpp
load_index_c.cpp
load_index_c.cpp
)
SealedIndexingRecord.cpp
)
add_library
(
milvus_segcore SHARED
add_library
(
milvus_segcore SHARED
${
SEGCORE_FILES
}
${
SEGCORE_FILES
}
)
)
...
...
internal/core/src/segcore/SealedIndexingRecord.cpp
已删除
100644 → 0
浏览文件 @
eb871718
// 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
//
// Created by mike on 12/25/20.
//
#include "segcore/SealedIndexingRecord.h"
internal/core/src/segcore/SealedIndexingRecord.h
已删除
100644 → 0
浏览文件 @
eb871718
// 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
#include <mutex>
#include <map>
#include <shared_mutex>
#include <utility>
#include <memory>
#include <tbb/concurrent_hash_map.h>
#include "utils/EasyAssert.h"
#include "knowhere/index/vector_index/VecIndex.h"
#include "common/Types.h"
namespace
milvus
::
segcore
{
struct
SealedIndexingEntry
{
MetricType
metric_type_
;
knowhere
::
VecIndexPtr
indexing_
;
};
using
SealedIndexingEntryPtr
=
std
::
unique_ptr
<
SealedIndexingEntry
>
;
struct
SealedIndexingRecord
{
void
add_entry
(
int64_t
field_offset
,
SealedIndexingEntryPtr
&&
ptr
)
{
std
::
unique_lock
lck
(
mutex_
);
entries_
[
field_offset
]
=
std
::
move
(
ptr
);
}
const
SealedIndexingEntry
*
get_entry
(
int64_t
field_offset
)
const
{
std
::
shared_lock
lck
(
mutex_
);
AssertInfo
(
entries_
.
count
(
field_offset
),
"field_offset not found"
);
return
entries_
.
at
(
field_offset
).
get
();
}
bool
test_readiness
(
int64_t
field_offset
)
const
{
std
::
shared_lock
lck
(
mutex_
);
return
entries_
.
count
(
field_offset
);
}
private:
// field_offset -> SealedIndexingEntry
std
::
map
<
int64_t
,
SealedIndexingEntryPtr
>
entries_
;
mutable
std
::
shared_mutex
mutex_
;
};
}
// namespace milvus::segcore
internal/core/src/segcore/SegmentBase.h
浏览文件 @
9577da9f
...
@@ -19,7 +19,6 @@
...
@@ -19,7 +19,6 @@
#include "query/deprecated/GeneralQuery.h"
#include "query/deprecated/GeneralQuery.h"
#include "query/Plan.h"
#include "query/Plan.h"
#include "common/LoadIndex.h"
namespace
milvus
{
namespace
milvus
{
namespace
segcore
{
namespace
segcore
{
...
@@ -80,9 +79,6 @@ class SegmentBase {
...
@@ -80,9 +79,6 @@ class SegmentBase {
virtual
Status
virtual
Status
Close
()
=
0
;
Close
()
=
0
;
virtual
Status
LoadIndexing
(
const
LoadIndexInfo
&
info
)
=
0
;
// // to make all data inserted visible
// // to make all data inserted visible
// // maybe a no-op?
// // maybe a no-op?
// virtual Status
// virtual Status
...
...
internal/core/src/segcore/SegmentNaive.h
浏览文件 @
9577da9f
...
@@ -84,11 +84,6 @@ class SegmentNaive : public SegmentBase {
...
@@ -84,11 +84,6 @@ class SegmentNaive : public SegmentBase {
Status
Status
BuildIndex
(
IndexMetaPtr
index_meta
)
override
;
BuildIndex
(
IndexMetaPtr
index_meta
)
override
;
Status
LoadIndexing
(
const
LoadIndexInfo
&
info
)
override
{
PanicInfo
(
"unimplemented"
);
}
Status
Status
FillTargetEntry
(
const
query
::
Plan
*
Plan
,
QueryResult
&
results
)
override
{
FillTargetEntry
(
const
query
::
Plan
*
Plan
,
QueryResult
&
results
)
override
{
PanicInfo
(
"unimplemented"
);
PanicInfo
(
"unimplemented"
);
...
...
internal/core/src/segcore/SegmentSmallIndex.cpp
浏览文件 @
9577da9f
...
@@ -257,7 +257,6 @@ SegmentSmallIndex::BuildVecIndexImpl(const IndexMeta::Entry& entry) {
...
@@ -257,7 +257,6 @@ SegmentSmallIndex::BuildVecIndexImpl(const IndexMeta::Entry& entry) {
Status
Status
SegmentSmallIndex
::
BuildIndex
(
IndexMetaPtr
remote_index_meta
)
{
SegmentSmallIndex
::
BuildIndex
(
IndexMetaPtr
remote_index_meta
)
{
if
(
remote_index_meta
==
nullptr
)
{
if
(
remote_index_meta
==
nullptr
)
{
PanicInfo
(
"deprecated"
);
std
::
cout
<<
"WARN: Null index ptr is detected, use default index"
<<
std
::
endl
;
std
::
cout
<<
"WARN: Null index ptr is detected, use default index"
<<
std
::
endl
;
int
dim
=
0
;
int
dim
=
0
;
...
@@ -286,10 +285,12 @@ SegmentSmallIndex::BuildIndex(IndexMetaPtr remote_index_meta) {
...
@@ -286,10 +285,12 @@ SegmentSmallIndex::BuildIndex(IndexMetaPtr remote_index_meta) {
knowhere
::
IndexMode
::
MODE_CPU
,
conf
);
knowhere
::
IndexMode
::
MODE_CPU
,
conf
);
remote_index_meta
=
index_meta
;
remote_index_meta
=
index_meta
;
}
}
if
(
record_
.
ack_responder_
.
GetAck
()
<
1024
*
4
)
{
if
(
record_
.
ack_responder_
.
GetAck
()
<
1024
*
4
)
{
return
Status
(
SERVER_BUILD_INDEX_ERROR
,
"too few elements"
);
return
Status
(
SERVER_BUILD_INDEX_ERROR
,
"too few elements"
);
}
}
PanicInfo
(
"unimplemented"
);
AssertInfo
(
false
,
"unimplemented"
);
return
Status
::
OK
();
#if 0
#if 0
index_meta_ = remote_index_meta;
index_meta_ = remote_index_meta;
for (auto& [index_name, entry] : index_meta_->get_entries()) {
for (auto& [index_name, entry] : index_meta_->get_entries()) {
...
@@ -349,19 +350,11 @@ SegmentSmallIndex::FillTargetEntry(const query::Plan* plan, QueryResult& results
...
@@ -349,19 +350,11 @@ SegmentSmallIndex::FillTargetEntry(const query::Plan* plan, QueryResult& results
Assert
(
results
.
result_offsets_
.
size
()
==
size
);
Assert
(
results
.
result_offsets_
.
size
()
==
size
);
Assert
(
results
.
row_data_
.
size
()
==
0
);
Assert
(
results
.
row_data_
.
size
()
==
0
);
// TODO: deprecate
results
.
result_ids_
.
clear
();
results
.
result_ids_
.
resize
(
size
);
if
(
plan
->
schema_
.
get_is_auto_id
())
{
if
(
plan
->
schema_
.
get_is_auto_id
())
{
auto
&
uids
=
record_
.
uids_
;
auto
&
uids
=
record_
.
uids_
;
for
(
int64_t
i
=
0
;
i
<
size
;
++
i
)
{
for
(
int64_t
i
=
0
;
i
<
size
;
++
i
)
{
auto
seg_offset
=
results
.
internal_seg_offsets_
[
i
];
auto
seg_offset
=
results
.
internal_seg_offsets_
[
i
];
auto
row_id
=
seg_offset
==
-
1
?
-
1
:
uids
[
seg_offset
];
auto
row_id
=
seg_offset
==
-
1
?
-
1
:
uids
[
seg_offset
];
// TODO: deprecate
results
.
result_ids_
[
i
]
=
row_id
;
std
::
vector
<
char
>
blob
(
sizeof
(
row_id
));
std
::
vector
<
char
>
blob
(
sizeof
(
row_id
));
memcpy
(
blob
.
data
(),
&
row_id
,
sizeof
(
row_id
));
memcpy
(
blob
.
data
(),
&
row_id
,
sizeof
(
row_id
));
results
.
row_data_
.
emplace_back
(
std
::
move
(
blob
));
results
.
row_data_
.
emplace_back
(
std
::
move
(
blob
));
...
@@ -376,10 +369,6 @@ SegmentSmallIndex::FillTargetEntry(const query::Plan* plan, QueryResult& results
...
@@ -376,10 +369,6 @@ SegmentSmallIndex::FillTargetEntry(const query::Plan* plan, QueryResult& results
for
(
int64_t
i
=
0
;
i
<
size
;
++
i
)
{
for
(
int64_t
i
=
0
;
i
<
size
;
++
i
)
{
auto
seg_offset
=
results
.
internal_seg_offsets_
[
i
];
auto
seg_offset
=
results
.
internal_seg_offsets_
[
i
];
auto
row_id
=
seg_offset
==
-
1
?
-
1
:
uids
->
operator
[](
seg_offset
);
auto
row_id
=
seg_offset
==
-
1
?
-
1
:
uids
->
operator
[](
seg_offset
);
// TODO: deprecate
results
.
result_ids_
[
i
]
=
row_id
;
std
::
vector
<
char
>
blob
(
sizeof
(
row_id
));
std
::
vector
<
char
>
blob
(
sizeof
(
row_id
));
memcpy
(
blob
.
data
(),
&
row_id
,
sizeof
(
row_id
));
memcpy
(
blob
.
data
(),
&
row_id
,
sizeof
(
row_id
));
results
.
row_data_
.
emplace_back
(
std
::
move
(
blob
));
results
.
row_data_
.
emplace_back
(
std
::
move
(
blob
));
...
@@ -388,20 +377,4 @@ SegmentSmallIndex::FillTargetEntry(const query::Plan* plan, QueryResult& results
...
@@ -388,20 +377,4 @@ SegmentSmallIndex::FillTargetEntry(const query::Plan* plan, QueryResult& results
return
Status
::
OK
();
return
Status
::
OK
();
}
}
Status
SegmentSmallIndex
::
LoadIndexing
(
const
LoadIndexInfo
&
info
)
{
auto
field_offset_opt
=
schema_
->
get_offset
(
info
.
field_name
);
AssertInfo
(
field_offset_opt
.
has_value
(),
"field name("
+
info
.
field_name
+
") not found"
);
Assert
(
info
.
index_params
.
count
(
"metric_type"
));
auto
metric_type_str
=
info
.
index_params
.
at
(
"metric_type"
);
auto
entry
=
std
::
make_unique
<
SealedIndexingEntry
>
();
entry
->
metric_type_
=
GetMetricType
(
metric_type_str
);
entry
->
indexing_
=
info
.
index
;
sealed_indexing_record_
.
add_entry
(
field_offset_opt
.
value
(),
std
::
move
(
entry
));
return
Status
::
OK
();
}
}
// namespace milvus::segcore
}
// namespace milvus::segcore
internal/core/src/segcore/SegmentSmallIndex.h
浏览文件 @
9577da9f
...
@@ -20,9 +20,9 @@
...
@@ -20,9 +20,9 @@
#include <query/PlanNode.h>
#include <query/PlanNode.h>
#include "AckResponder.h"
#include "AckResponder.h"
#include "SealedIndexingRecord.h"
#include "ConcurrentVector.h"
#include "ConcurrentVector.h"
#include "segcore/SegmentBase.h"
#include "segcore/SegmentBase.h"
// #include "knowhere/index/structured_index/StructuredIndex.h"
#include "query/deprecated/GeneralQuery.h"
#include "query/deprecated/GeneralQuery.h"
#include "utils/Status.h"
#include "utils/Status.h"
#include "segcore/DeletedRecord.h"
#include "segcore/DeletedRecord.h"
...
@@ -79,12 +79,14 @@ class SegmentSmallIndex : public SegmentBase {
...
@@ -79,12 +79,14 @@ class SegmentSmallIndex : public SegmentBase {
Status
Status
DropRawData
(
std
::
string_view
field_name
)
override
{
DropRawData
(
std
::
string_view
field_name
)
override
{
PanicInfo
(
"unimplemented"
);
// TODO: NO-OP
return
Status
::
OK
();
}
}
Status
Status
LoadRawData
(
std
::
string_view
field_name
,
const
char
*
blob
,
int64_t
blob_size
)
override
{
LoadRawData
(
std
::
string_view
field_name
,
const
char
*
blob
,
int64_t
blob_size
)
override
{
PanicInfo
(
"unimplemented"
);
// TODO: NO-OP
return
Status
::
OK
();
}
}
int64_t
int64_t
...
@@ -106,11 +108,6 @@ class SegmentSmallIndex : public SegmentBase {
...
@@ -106,11 +108,6 @@ class SegmentSmallIndex : public SegmentBase {
return
deleted_record_
;
return
deleted_record_
;
}
}
const
SealedIndexingRecord
&
get_sealed_indexing_record
()
const
{
return
sealed_indexing_record_
;
}
const
Schema
&
const
Schema
&
get_schema
()
const
{
get_schema
()
const
{
return
*
schema_
;
return
*
schema_
;
...
@@ -132,9 +129,6 @@ class SegmentSmallIndex : public SegmentBase {
...
@@ -132,9 +129,6 @@ class SegmentSmallIndex : public SegmentBase {
return
0
;
return
0
;
}
}
Status
LoadIndexing
(
const
LoadIndexInfo
&
info
)
override
;
public:
public:
friend
std
::
unique_ptr
<
SegmentBase
>
friend
std
::
unique_ptr
<
SegmentBase
>
CreateSegment
(
SchemaPtr
schema
,
int64_t
chunk_size
);
CreateSegment
(
SchemaPtr
schema
,
int64_t
chunk_size
);
...
@@ -166,7 +160,6 @@ class SegmentSmallIndex : public SegmentBase {
...
@@ -166,7 +160,6 @@ class SegmentSmallIndex : public SegmentBase {
InsertRecord
record_
;
InsertRecord
record_
;
DeletedRecord
deleted_record_
;
DeletedRecord
deleted_record_
;
IndexingRecord
indexing_record_
;
IndexingRecord
indexing_record_
;
SealedIndexingRecord
sealed_indexing_record_
;
tbb
::
concurrent_unordered_multimap
<
idx_t
,
int64_t
>
uid2offset_
;
tbb
::
concurrent_unordered_multimap
<
idx_t
,
int64_t
>
uid2offset_
;
};
};
...
...
internal/core/src/segcore/reduce_c.cpp
浏览文件 @
9577da9f
...
@@ -118,17 +118,21 @@ ResetSearchResult(std::vector<std::vector<int64_t>>& search_records,
...
@@ -118,17 +118,21 @@ ResetSearchResult(std::vector<std::vector<int64_t>>& search_records,
std
::
vector
<
float
>
result_distances
;
std
::
vector
<
float
>
result_distances
;
std
::
vector
<
int64_t
>
internal_seg_offsets
;
std
::
vector
<
int64_t
>
internal_seg_offsets
;
std
::
vector
<
int64_t
>
result_ids
;
for
(
int
j
=
0
;
j
<
search_records
[
i
].
size
();
j
++
)
{
for
(
int
j
=
0
;
j
<
search_records
[
i
].
size
();
j
++
)
{
auto
&
offset
=
search_records
[
i
][
j
];
auto
&
offset
=
search_records
[
i
][
j
];
auto
distance
=
search_result
->
result_distances_
[
offset
];
auto
distance
=
search_result
->
result_distances_
[
offset
];
auto
internal_seg_offset
=
search_result
->
internal_seg_offsets_
[
offset
];
auto
internal_seg_offset
=
search_result
->
internal_seg_offsets_
[
offset
];
auto
id
=
search_result
->
result_ids_
[
offset
];
result_distances
.
push_back
(
distance
);
result_distances
.
push_back
(
distance
);
internal_seg_offsets
.
push_back
(
internal_seg_offset
);
internal_seg_offsets
.
push_back
(
internal_seg_offset
);
result_ids
.
push_back
(
id
);
}
}
search_result
->
result_distances_
=
result_distances
;
search_result
->
result_distances_
=
result_distances
;
search_result
->
internal_seg_offsets_
=
internal_seg_offsets
;
search_result
->
internal_seg_offsets_
=
internal_seg_offsets
;
search_result
->
result_ids_
=
result_ids
;
}
}
}
}
...
...
internal/core/unittest/CMakeLists.txt
浏览文件 @
9577da9f
...
@@ -13,7 +13,6 @@ set(MILVUS_TEST_FILES
...
@@ -13,7 +13,6 @@ set(MILVUS_TEST_FILES
test_bitmap.cpp
test_bitmap.cpp
test_binary.cpp
test_binary.cpp
test_index_wrapper.cpp
test_index_wrapper.cpp
test_sealed.cpp
)
)
add_executable
(
all_tests
add_executable
(
all_tests
${
MILVUS_TEST_FILES
}
${
MILVUS_TEST_FILES
}
...
...
internal/core/unittest/test_binary.cpp
浏览文件 @
9577da9f
...
@@ -22,7 +22,7 @@ TEST(Binary, Insert) {
...
@@ -22,7 +22,7 @@ TEST(Binary, Insert) {
int64_t
topK
=
5
;
int64_t
topK
=
5
;
auto
schema
=
std
::
make_shared
<
Schema
>
();
auto
schema
=
std
::
make_shared
<
Schema
>
();
schema
->
AddField
(
"vecbin"
,
DataType
::
VECTOR_BINARY
,
128
,
MetricType
::
METRIC_Jaccard
);
schema
->
AddField
(
"vecbin"
,
DataType
::
VECTOR_BINARY
,
128
,
MetricType
::
METRIC_Jaccard
);
schema
->
AddField
(
"age"
,
DataType
::
INT
32
);
schema
->
AddField
(
"age"
,
DataType
::
INT
64
);
auto
dataset
=
DataGen
(
schema
,
N
,
10
);
auto
dataset
=
DataGen
(
schema
,
N
,
10
);
auto
segment
=
CreateSegment
(
schema
);
auto
segment
=
CreateSegment
(
schema
);
segment
->
PreInsert
(
N
);
segment
->
PreInsert
(
N
);
...
...
internal/core/unittest/test_query.cpp
浏览文件 @
9577da9f
...
@@ -458,15 +458,13 @@ TEST(Query, FillSegment) {
...
@@ -458,15 +458,13 @@ TEST(Query, FillSegment) {
QueryResult
result
;
QueryResult
result
;
segment
->
Search
(
plan
.
get
(),
groups
.
data
(),
timestamps
.
data
(),
1
,
result
);
segment
->
Search
(
plan
.
get
(),
groups
.
data
(),
timestamps
.
data
(),
1
,
result
);
// TODO: deprecated result_ids_
ASSERT_EQ
(
result
.
result_ids_
,
result
.
internal_seg_offsets_
);
auto
topk
=
5
;
auto
topk
=
5
;
auto
num_queries
=
10
;
auto
num_queries
=
10
;
result
.
result_offsets_
.
resize
(
topk
*
num_queries
);
result
.
result_offsets_
.
resize
(
topk
*
num_queries
);
segment
->
FillTargetEntry
(
plan
.
get
(),
result
);
segment
->
FillTargetEntry
(
plan
.
get
(),
result
);
// TODO: deprecated result_ids_
ASSERT_EQ
(
result
.
result_ids_
,
result
.
internal_seg_offsets_
);
auto
ans
=
result
.
row_data_
;
auto
ans
=
result
.
row_data_
;
ASSERT_EQ
(
ans
.
size
(),
topk
*
num_queries
);
ASSERT_EQ
(
ans
.
size
(),
topk
*
num_queries
);
int64_t
std_index
=
0
;
int64_t
std_index
=
0
;
...
...
internal/core/unittest/test_sealed.cpp
已删除
100644 → 0
浏览文件 @
eb871718
// 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
//
// Created by mike on 12/28/20.
//
#include "test_utils/DataGen.h"
#include <gtest/gtest.h>
#include <knowhere/index/vector_index/VecIndex.h>
#include <knowhere/index/vector_index/adapter/VectorAdapter.h>
#include <knowhere/index/vector_index/VecIndexFactory.h>
#include <knowhere/index/vector_index/IndexIVF.h>
using
namespace
milvus
;
using
namespace
milvus
::
segcore
;
using
namespace
milvus
;
TEST
(
Sealed
,
without_predicate
)
{
using
namespace
milvus
::
query
;
using
namespace
milvus
::
segcore
;
auto
schema
=
std
::
make_shared
<
Schema
>
();
auto
dim
=
16
;
auto
topK
=
5
;
auto
metric_type
=
MetricType
::
METRIC_L2
;
schema
->
AddField
(
"fakevec"
,
DataType
::
VECTOR_FLOAT
,
dim
,
metric_type
);
schema
->
AddField
(
"age"
,
DataType
::
FLOAT
);
std
::
string
dsl
=
R"({
"bool": {
"must": [
{
"vector": {
"fakevec": {
"metric_type": "L2",
"params": {
"nprobe": 10
},
"query": "$0",
"topk": 5
}
}
}
]
}
})"
;
int64_t
N
=
1000
*
1000
;
auto
dataset
=
DataGen
(
schema
,
N
);
auto
vec_col
=
dataset
.
get_col
<
float
>
(
0
);
for
(
int64_t
i
=
0
;
i
<
1000
*
dim
;
++
i
)
{
vec_col
.
push_back
(
0
);
}
auto
query_ptr
=
vec_col
.
data
()
+
4200
*
dim
;
auto
segment
=
CreateSegment
(
schema
);
segment
->
PreInsert
(
N
);
segment
->
Insert
(
0
,
N
,
dataset
.
row_ids_
.
data
(),
dataset
.
timestamps_
.
data
(),
dataset
.
raw_
);
auto
plan
=
CreatePlan
(
*
schema
,
dsl
);
auto
num_queries
=
5
;
auto
ph_group_raw
=
CreatePlaceholderGroupFromBlob
(
num_queries
,
16
,
query_ptr
);
auto
ph_group
=
ParsePlaceholderGroup
(
plan
.
get
(),
ph_group_raw
.
SerializeAsString
());
QueryResult
qr
;
Timestamp
time
=
1000000
;
std
::
vector
<
const
PlaceholderGroup
*>
ph_group_arr
=
{
ph_group
.
get
()};
segment
->
Search
(
plan
.
get
(),
ph_group_arr
.
data
(),
&
time
,
1
,
qr
);
auto
pre_result
=
QueryResultToJson
(
qr
);
auto
indexing
=
std
::
make_shared
<
knowhere
::
IVF
>
();
auto
conf
=
knowhere
::
Config
{{
knowhere
::
meta
::
DIM
,
dim
},
{
knowhere
::
meta
::
TOPK
,
topK
},
{
knowhere
::
IndexParams
::
nlist
,
100
},
{
knowhere
::
IndexParams
::
nprobe
,
10
},
{
knowhere
::
Metric
::
TYPE
,
milvus
::
knowhere
::
Metric
::
L2
},
{
knowhere
::
meta
::
DEVICEID
,
0
}};
auto
database
=
knowhere
::
GenDataset
(
N
,
dim
,
vec_col
.
data
()
+
1000
*
dim
);
indexing
->
Train
(
database
,
conf
);
indexing
->
AddWithoutIds
(
database
,
conf
);
EXPECT_EQ
(
indexing
->
Count
(),
N
);
EXPECT_EQ
(
indexing
->
Dim
(),
dim
);
auto
query_dataset
=
knowhere
::
GenDataset
(
num_queries
,
dim
,
query_ptr
);
auto
result
=
indexing
->
Query
(
query_dataset
,
conf
,
nullptr
);
auto
ids
=
result
->
Get
<
int64_t
*>
(
milvus
::
knowhere
::
meta
::
IDS
);
// for comparison
auto
dis
=
result
->
Get
<
float
*>
(
milvus
::
knowhere
::
meta
::
DISTANCE
);
// for comparison
std
::
vector
<
int64_t
>
vec_ids
(
ids
,
ids
+
topK
*
num_queries
);
std
::
vector
<
float
>
vec_dis
(
dis
,
dis
+
topK
*
num_queries
);
qr
.
internal_seg_offsets_
=
vec_ids
;
qr
.
result_distances_
=
vec_dis
;
auto
ref_result
=
QueryResultToJson
(
qr
);
LoadIndexInfo
load_info
;
load_info
.
field_name
=
"fakevec"
;
load_info
.
field_id
=
42
;
load_info
.
index
=
indexing
;
load_info
.
index_params
[
"metric_type"
]
=
"L2"
;
segment
->
LoadIndexing
(
load_info
);
qr
=
QueryResult
();
segment
->
Search
(
plan
.
get
(),
ph_group_arr
.
data
(),
&
time
,
1
,
qr
);
auto
post_result
=
QueryResultToJson
(
qr
);
std
::
cout
<<
ref_result
.
dump
(
1
);
std
::
cout
<<
post_result
.
dump
(
1
);
ASSERT_EQ
(
ref_result
.
dump
(
2
),
post_result
.
dump
(
2
));
}
TEST
(
Sealed
,
with_predicate
)
{
using
namespace
milvus
::
query
;
using
namespace
milvus
::
segcore
;
auto
schema
=
std
::
make_shared
<
Schema
>
();
auto
dim
=
16
;
auto
topK
=
5
;
auto
metric_type
=
MetricType
::
METRIC_L2
;
schema
->
AddField
(
"fakevec"
,
DataType
::
VECTOR_FLOAT
,
dim
,
metric_type
);
schema
->
AddField
(
"counter"
,
DataType
::
INT64
);
std
::
string
dsl
=
R"({
"bool": {
"must": [
{
"range": {
"counter": {
"GE": 420000,
"LT": 420005
}
}
},
{
"vector": {
"fakevec": {
"metric_type": "L2",
"params": {
"nprobe": 10
},
"query": "$0",
"topk": 5
}
}
}
]
}
})"
;
int64_t
N
=
1000
*
1000
;
auto
dataset
=
DataGen
(
schema
,
N
);
auto
vec_col
=
dataset
.
get_col
<
float
>
(
0
);
auto
query_ptr
=
vec_col
.
data
()
+
420000
*
dim
;
auto
segment
=
CreateSegment
(
schema
);
segment
->
PreInsert
(
N
);
segment
->
Insert
(
0
,
N
,
dataset
.
row_ids_
.
data
(),
dataset
.
timestamps_
.
data
(),
dataset
.
raw_
);
auto
plan
=
CreatePlan
(
*
schema
,
dsl
);
auto
num_queries
=
5
;
auto
ph_group_raw
=
CreatePlaceholderGroupFromBlob
(
num_queries
,
16
,
query_ptr
);
auto
ph_group
=
ParsePlaceholderGroup
(
plan
.
get
(),
ph_group_raw
.
SerializeAsString
());
QueryResult
qr
;
Timestamp
time
=
10000000
;
std
::
vector
<
const
PlaceholderGroup
*>
ph_group_arr
=
{
ph_group
.
get
()};
segment
->
Search
(
plan
.
get
(),
ph_group_arr
.
data
(),
&
time
,
1
,
qr
);
auto
pre_qr
=
qr
;
auto
indexing
=
std
::
make_shared
<
knowhere
::
IVF
>
();
auto
conf
=
knowhere
::
Config
{{
knowhere
::
meta
::
DIM
,
dim
},
{
knowhere
::
meta
::
TOPK
,
topK
},
{
knowhere
::
IndexParams
::
nlist
,
100
},
{
knowhere
::
IndexParams
::
nprobe
,
10
},
{
knowhere
::
Metric
::
TYPE
,
milvus
::
knowhere
::
Metric
::
L2
},
{
knowhere
::
meta
::
DEVICEID
,
0
}};
auto
database
=
knowhere
::
GenDataset
(
N
,
dim
,
vec_col
.
data
());
indexing
->
Train
(
database
,
conf
);
indexing
->
AddWithoutIds
(
database
,
conf
);
EXPECT_EQ
(
indexing
->
Count
(),
N
);
EXPECT_EQ
(
indexing
->
Dim
(),
dim
);
auto
query_dataset
=
knowhere
::
GenDataset
(
num_queries
,
dim
,
query_ptr
);
auto
result
=
indexing
->
Query
(
query_dataset
,
conf
,
nullptr
);
LoadIndexInfo
load_info
;
load_info
.
field_name
=
"fakevec"
;
load_info
.
field_id
=
42
;
load_info
.
index
=
indexing
;
load_info
.
index_params
[
"metric_type"
]
=
"L2"
;
segment
->
LoadIndexing
(
load_info
);
qr
=
QueryResult
();
segment
->
Search
(
plan
.
get
(),
ph_group_arr
.
data
(),
&
time
,
1
,
qr
);
auto
post_qr
=
qr
;
for
(
int
i
=
0
;
i
<
num_queries
;
++
i
)
{
auto
offset
=
i
*
topK
;
ASSERT_EQ
(
post_qr
.
internal_seg_offsets_
[
offset
],
420000
+
i
);
ASSERT_EQ
(
post_qr
.
result_distances_
[
offset
],
0.0
);
}
}
\ No newline at end of file
internal/core/unittest/test_utils/DataGen.h
浏览文件 @
9577da9f
...
@@ -111,16 +111,8 @@ DataGen(SchemaPtr schema, int64_t N, uint64_t seed = 42) {
...
@@ -111,16 +111,8 @@ DataGen(SchemaPtr schema, int64_t N, uint64_t seed = 42) {
}
}
case
engine
::
DataType
::
INT64
:
{
case
engine
::
DataType
::
INT64
:
{
vector
<
int64_t
>
data
(
N
);
vector
<
int64_t
>
data
(
N
);
int64_t
index
=
0
;
// begin with counter
if
(
field
.
get_name
().
rfind
(
"counter"
,
0
)
==
0
)
{
for
(
auto
&
x
:
data
)
{
for
(
auto
&
x
:
data
)
{
x
=
index
++
;
x
=
er
();
}
}
else
{
for
(
auto
&
x
:
data
)
{
x
=
er
()
%
(
2
*
N
);
}
}
}
insert_cols
(
data
);
insert_cols
(
data
);
break
;
break
;
...
@@ -178,26 +170,6 @@ CreatePlaceholderGroup(int64_t num_queries, int dim, int64_t seed = 42) {
...
@@ -178,26 +170,6 @@ CreatePlaceholderGroup(int64_t num_queries, int dim, int64_t seed = 42) {
return
raw_group
;
return
raw_group
;
}
}
inline
auto
CreatePlaceholderGroupFromBlob
(
int64_t
num_queries
,
int
dim
,
const
float
*
src
)
{
namespace
ser
=
milvus
::
proto
::
service
;
ser
::
PlaceholderGroup
raw_group
;
auto
value
=
raw_group
.
add_placeholders
();
value
->
set_tag
(
"$0"
);
value
->
set_type
(
ser
::
PlaceholderType
::
VECTOR_FLOAT
);
int64_t
src_index
=
0
;
for
(
int
i
=
0
;
i
<
num_queries
;
++
i
)
{
std
::
vector
<
float
>
vec
;
for
(
int
d
=
0
;
d
<
dim
;
++
d
)
{
vec
.
push_back
(
src
[
src_index
++
]);
}
// std::string line((char*)vec.data(), (char*)vec.data() + vec.size() * sizeof(float));
value
->
add_values
(
vec
.
data
(),
vec
.
size
()
*
sizeof
(
float
));
}
return
raw_group
;
}
inline
auto
inline
auto
CreateBinaryPlaceholderGroup
(
int64_t
num_queries
,
int64_t
dim
,
int64_t
seed
=
42
)
{
CreateBinaryPlaceholderGroup
(
int64_t
num_queries
,
int64_t
dim
,
int64_t
seed
=
42
)
{
assert
(
dim
%
8
==
0
);
assert
(
dim
%
8
==
0
);
...
...
internal/writenode/flow_graph_insert_buffer_node.go
浏览文件 @
9577da9f
...
@@ -85,7 +85,7 @@ func (ibNode *insertBufferNode) Name() string {
...
@@ -85,7 +85,7 @@ func (ibNode *insertBufferNode) Name() string {
}
}
func
(
ibNode
*
insertBufferNode
)
Operate
(
in
[]
*
Msg
)
[]
*
Msg
{
func
(
ibNode
*
insertBufferNode
)
Operate
(
in
[]
*
Msg
)
[]
*
Msg
{
log
.
Println
(
"=========== insert buffer Node Operating"
)
//
log.Println("=========== insert buffer Node Operating")
if
len
(
in
)
!=
1
{
if
len
(
in
)
!=
1
{
log
.
Println
(
"Error: Invalid operate message input in insertBuffertNode, input length = "
,
len
(
in
))
log
.
Println
(
"Error: Invalid operate message input in insertBuffertNode, input length = "
,
len
(
in
))
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录