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

[skip e2e] Add note for design doc (#14034)

Browse Source 
Signed-off-by: yhmo <yihua.mo@zilliz.com>
This commit is contained in:
groot 2021-12-23 10:45:36 +08:00 committed by GitHub
parent 1dca18d3d3
commit c5f3f7627f
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

@ -15,7 +15,7 @@ Currently，There are two paths to implement time travel:
1. During load, data is placed in a continuous memory area named chunk, with following properties:
1. Data is divided into multiple segments
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 next segment
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
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