milvus-io
/
milvus
mirror of https://github.com/milvus-io/milvus.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

[skip ci]Fix typo in doc of segcore search (#8667) 

Signed-off-by: Jael Gu <mengjia.gu@zilliz.com>
pull/8673/head
Jael Gu 2021-09-27 19:12:02 +08:00 committed by GitHub
parent 892991ee61
commit 746bcc8bc0
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 16 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -1,30 +1,30 @@
# Segcore search Deisgn
# Segcore Search Design
init: 7.23.2021, by [FluorineDog](https://github.com/FluorineDog)
update: 9.16.2021, by [xiaofan-luan](https://github.com/xiaofan-luan)
## Search
Search now support two mode, json DSL mode, and Boolean Expr mode. We will talk about the later one in detail because the former has been deprecated and only use in test.
Search now supports two modes: json DSL mode and Boolean Expr mode. We will talk about the later one in details because the former has been deprecated and is only used in test.
The execution mode of Boolean Expr works as follow:
The execution mode of Boolean Expr works as follows:
1. client packs search expr, topk and query vector into proto and sends to proxy node.
2. proxynode unmarshalls the proto, parses it to logical plan, makes static check, and generates protobuf IR.
3. querynode unmarshalls the plan, generates an executable plan AST, and query in the segcore.
2. proxynode unmarshals the proto, parses it to logical plan, makes static check, and generates protobuf IR.
3. querynode unmarshals the plan, generates an executable plan AST, and queries in the segcore.
See deatailed expression usage at [expr_grammar.md](https://milvus.io/docs/v2.0.0/expression.md)
See details of expression usage at [expr_grammar.md](https://milvus.io/docs/v2.0.0/expression.md)
## Segcore Search process
After obtaining the AST, excetion engine use the visitor mode to explain and execute the whole AST tree:
## Segcore Search Process
After obtaining the AST, execution engine uses the visitor mode to explain and executes the whole AST tree:
1. Each Node includes two steps, a must vector search and an optional predicate.
1. Each Node includes two steps, a mandatory vector search and an optional predicate.
1. If Predicate exist, execute predicate expression stage to generate bitset as the vector search bitmask.
2. If Predicate not exist, vector search bitmask will be empty .
3. Bitmask will be used as mark filtered out/deleted entities in the vector execution engine.
2. Currently, Milvus support following node on the AST, visitor mode is used to interpret and execute from top to bottom and generate the final bitmask.
1. LogicalUnaryExpr: not expression
2. If Predicate does not exist, vector search bitmask will be empty.
3. Bitmask will be used to mark filtered out / deleted entities in the vector execution engine.
2. Currently, Milvus supports following node on the AST, visitor mode is used to interpret and execute from top to bottom and generate the final bitmask.
1. LogicalUnaryExpr: not expression
2. LogicalBinaryExpr: and or expression
3. TermExpr: in expression `A in [1, 2, 3]`
4. CompareExpr: compare expression `A > 1` `B <= 1`
3. TermExpr and CompareExpr is the leaf node of execution
3. TermExpr and CompareExpr are leaf nodes of execution