From c5f3f7627fc6fc4b2fab33e53d6a80fcc77aa159 Mon Sep 17 00:00:00 2001 From: groot Date: Thu, 23 Dec 2021 10:45:36 +0800 Subject: [PATCH] [skip e2e] Add note for design doc (#14034) Signed-off-by: yhmo --- 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 ab7bc76df6..876cade808 100644 --- a/docs/design_docs/segcore/timetravel.md +++ b/docs/design_docs/segcore/timetravel.md @@ -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