test/milvus
1
0
Fork 0
mirror of https://gitee.com/milvus-io/milvus.git synced 2024-11-29 18:38:44 +08:00
Code Issues Actions 11 Packages Projects Releases Wiki Activity

[skip e2e] Check the grammar of segcore/Search.md (#15047)

Browse Source 
Signed-off-by: min.tian <min.tian.cn@gmail.com>
This commit is contained in:
min.tian 2022-01-10 09:47:36 +08:00 committed by GitHub
parent 7efb02a4c5
commit 0c621fa314
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
docs/design_docs/segcore/Search.md
View File

@ -23,7 +23,7 @@ After obtaining the AST, the execution engine uses the visitor mode to explain a
1. Each node includes two steps, a mandatory vector search and an optional predicate. 1. Each node includes two steps, a mandatory vector search and an optional predicate.
1. If Predicate exists, execute predicate expression stage to generate bitset as the vector search bitmask. 1. If Predicate exists, execute predicate expression stage to generate bitset as the vector search bitmask.
2. If Predicate does not exist, vector search bitmask will be empty. 2. If Predicate does not exist, the vector search bitmask will be empty.
3. Bitmask will be used to mark filtered out / deleted entities in the vector execution engine. 3. Bitmask will be used to mark filtered out / deleted entities in the vector execution engine.
2. Currently, Milvus supports the following node on the AST, visitor mode is used to interpret and execute from top to bottom and generate the final bitmask. 2. Currently, Milvus supports the following node on the AST, visitor mode is used to interpret and execute from top to bottom and generate the final bitmask.