From cd745e972f3b712bb3e723b7b4e2c2be44a0714c Mon Sep 17 00:00:00 2001 From: groot Date: Fri, 24 Dec 2021 12:09:36 +0800 Subject: [PATCH] [skip e2e] Modify design docs (#14157) Signed-off-by: groot --- docs/design_docs/segcore/timetravel.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/design_docs/segcore/timetravel.md b/docs/design_docs/segcore/timetravel.md index 876cade808..dab3a78735 100644 --- a/docs/design_docs/segcore/timetravel.md +++ b/docs/design_docs/segcore/timetravel.md @@ -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