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]Update docs about index design (#11625) 

Signed-off-by: shiyu22 <shiyu.chen@zilliz.com>
pull/11643/head
shiyu22 2021-11-11 15:12:43 +08:00 committed by GitHub
parent 2a01321b27
commit 7970c341a5
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
docs/design_docs/index_design.md
View File

@ -67,14 +67,7 @@ IndexNode is a node that executes index building tasks.
### 8.3.2 NodeManager
NodeManager is responsible for managing the node information of IndexNode, and contains a priority queue to save the
load information of each IndexNode. The load information of IndexNode is based on the number of tasks executed.
When the IndexCoord service starts, it first obtains the node information of all
current IndexNodes from etcd, and then adds the node information to the NodeManager. After that, the online and offline
information of IndexNode node is obtained from watchNodeLoop. Then it will traverse the entire MetaTable, get the load
information corresponding to each IndexNode node, and update the priority queue in the NodeManager. When an index building
task needs to be allocated, the IndexNode with the lowest load will be selected according to the
priority queue to execute the task.
NodeManager is responsible for managing the node information of IndexNode, and contains a priority queue to save the load information of each IndexNode. The load information of IndexNode is based on the number of tasks executed. When the IndexCoord service starts, it first obtains the node information of all current IndexNodes from etcd, and then adds the node information to the NodeManager. After that, the online and offline information of IndexNode node is obtained from watchNodeLoop. Then it will traverse the entire MetaTable, get the load information corresponding to each IndexNode node, and update the priority queue in the NodeManager. When an index building task needs to be allocated, the IndexNode with the lowest load will be selected according to the priority queue to execute the task.
### 8.3.3 MetaTable