test/milvus
1
0
Fork 0
mirror of https://gitee.com/milvus-io/milvus.git synced 2024-12-04 04:49:08 +08:00
Code Issues Actions 14 Packages Projects Releases Wiki Activity

[skip ci] Fix typo in design doc (#11232)

Browse Source 
Signed-off-by: Binbin Lv <binbin.lv@zilliz.com>
This commit is contained in:
binbin 2021-11-04 15:28:36 +08:00 committed by GitHub
parent f0075cf204
commit 849f4c6f0d
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
docs/design_docs/segcore/timetravel.md
View File

@ -8,7 +8,7 @@ Currently，There are two paths to implement time travel:
1. When inserting, ensure that the inserted data is in ascending time order 1. When inserting, ensure that the inserted data is in ascending time order
2. Find the location of timestamp with binary search and record it as vec_count 2. Find the location of timestamp with binary search and record it as vec_count
3. Call vector_serch interface and rest is handled inside sement, no need to handle bitmask generated by DSL 3. Call vector_search interface and rest is handled inside segment, no need to handle bitmask generated by DSL
## SealedSegment Time Travel ## SealedSegment Time Travel
@ -20,4 +20,4 @@ Currently，There are two paths to implement time travel:
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 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 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 conbined and sent to vectorsearch interface 3. the calculated results of Bitset and DSL are combined and sent to vector search interface