The TTL map is a regular B+Tree-based map with the key being a pair (expire
time + key). It is obviously stored in memory when there is no persistence.
When persistence is enabled, it is handled as any other index tree - the
page replacement algorithm is applied. No heap is consumed for this tree.


2018-03-13 15:30 GMT+03:00 Dmitriy Setrakyan <>:

> On Tue, Mar 13, 2018 at 3:50 AM, Alexey Goncharuk <
>> wrote:
>> Denis,
>> What do you mean by 'current behavior when data is evicted from the memory
>> only'? TTL expiration effectively means that the corresponding key-value
>> pairs are destroyed.
> AG, can you please explain how this is implemented? Are we really keeping
> the whole TTL map in memory?

Reply via email to