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

[skip e2e] Fix typo for design doc (#14742) 

Signed-off-by: yhmo <yihua.mo@zilliz.com>
pull/14543/head
groot 2022-01-04 14:00:18 +08:00 committed by GitHub
parent c3f24e8d92
commit e7c1f57f35
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/timetravel.md
View File

@ -19,5 +19,5 @@ Currently，there are two paths to implement time travel:
2. The Algorithm for time travel is:
1. Use get_active_count interface, find the last segment containing a legal ts, and return the last element position of this segment as vec_count
2. Calculate the bitset mask with timestamp. Due to the above properties, all the entities of the previous segment meet the conditions, and all the subsequent segments do not meet the conditions. Only the "last segment" needs to be calculated.
2. Calculate the bitset mask with a timestamp. Due to the above properties, all the entities of the previous segment meet the conditions, and all the subsequent segments do not meet the conditions. Only the "last segment" needs to be calculated.
3. the calculated results of Bitset and DSL are combined and sent to vector search interface