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] Modify design docs (#14157) 

Signed-off-by: groot <yihua.mo@zilliz.com>
pull/14160/head
groot 2021-12-24 12:09:36 +08:00 committed by GitHub
parent 3a591068b0
commit cd745e972f
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

@ -17,7 +17,7 @@ Currently，There are two paths to implement time travel:
2. Data in one segment is ordered by primary key
3. Data between Segments is in timestamp order. That is, the timestamp of every entity in the previous segment must be less than the timestamp of the first entity in the next segment
2. The Algorithm for time travel is
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.
3. the calculated results of Bitset and DSL are combined and sent to vector search interface