Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
milvus
milvus
提交
62341cfd
M
milvus
项目概览
milvus
/
milvus
11 个月 前同步成功
通知
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,发现更多精彩内容 >>
未验证
提交
62341cfd
编写于
12月 15, 2021
作者:
Y
yanliang567
提交者:
GitHub
12月 15, 2021
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[skip ci]Update typo in search md (#13389)
Signed-off-by:
N
yanliang567
<
yanliang.qiao@zilliz.com
>
上级
3a816fec
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
4 addition
and
4 deletion
+4
-4
docs/design_docs/segcore/Search.md
docs/design_docs/segcore/Search.md
+4
-4
未找到文件。
docs/design_docs/segcore/Search.md
浏览文件 @
62341cfd
...
...
@@ -10,9 +10,9 @@ Search now supports two modes: json DSL mode and Boolean Expr mode. We will talk
The execution mode of Boolean Expr works as follows:
1.
client packs search expr, topk and query vector into proto and sends to
p
roxy node.
2.
proxy n
ode unmarshals the proto, parses it to logical plan, makes static check, and generates protobuf IR.
3.
query n
ode unmarshals the plan, generates an executable plan AST, and queries in the segcore.
1.
client packs search expr, topk and query vector into proto and sends to
P
roxy node.
2.
Proxy N
ode unmarshals the proto, parses it to logical plan, makes static check, and generates protobuf IR.
3.
Query N
ode unmarshals the plan, generates an executable plan AST, and queries in the segcore.
See details of expression usage at
[
expr_grammar.md
](
https://milvus.io/docs/v2.0.0/expression.md
)
...
...
@@ -20,7 +20,7 @@ See details of expression usage at [expr_grammar.md](https://milvus.io/docs/v2.0
After obtaining the AST, execution engine uses the visitor mode to explain and executes the whole AST tree:
1.
Each
N
ode includes two steps, a mandatory vector search and an optional predicate.
1.
Each
n
ode 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.
2.
If Predicate does not exist, vector search bitmask will be empty.
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录