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 some grammar issues (#8756) 

Signed-off-by: min.tian <min.tian.cn@gmail.com>
pull/8791/head
min.tian 2021-09-28 19:08:04 +08:00 committed by GitHub
parent 0f1467c1c2
commit ddf13c6d83
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/developer_guides/chap01_system_overview.md
View File

@ -40,7 +40,7 @@ The query nodes hold all the indexes in memory. Since building an index is time-
The write nodes are stateless. They simply transform the newly arrived WALs to binlog format, then append the binlog to the store engine.
Note that not all the components are necessarily replicated. The system provides failure tolerance by maintaining multiple copies of WAL and binlog. When there is no in-memory index replica and there occurs a query node failure, other query nodes will take over its indexes by loading the dumped index files, or rebuilding them from binlog and WALs. The links from query nodes to the hash ring will also be adjusted such that the failure node's input WAL stream can be properly handled by its neighbors.
Note that not all the components are necessarily replicated. The system provides failure tolerance by maintaining multiple copies of WAL and binlog. When there is no in-memory index replica and there occurs a query node failure, other query nodes will take over its indexes by loading the dumped index files, or rebuilding them from binlog and WALs. The links from query nodes to the hash ring will also be adjusted such that the failed node's input WAL stream can be properly handled by its neighbors.
#### 1.4 State Synchronization