Time Based Key-Value Store

operations=[set(foo,bar,1), get(foo,1), get(foo,3), set(foo,bar2,4), get(foo,4), get(foo,5)]

algomaster.io

Step:Start: each key keeps its (timestamp, value) pairs in append order, so timestamps are sorted. get() binary searches for the newest timestamp <= t.

0 / 23

operations=[set(foo,bar,1), get(foo,1), get(foo,3), set(foo,bar2,4), get(foo,4), get(foo,5)]

0 / 23

algomaster.io

Step:Start: each key keeps its (timestamp, value) pairs in append order, so timestamps are sorted. get() binary searches for the newest timestamp <= t.