Details
-
Improvement
-
Status: Resolved
-
Major
-
Resolution: Fixed
-
None
Description
The storage should contain the following components:
- An elastic (but with possible hard-limit) in-memory storage for log entries. On this iteration it will be on-heap data structure (for instance, a skip list). Later, we'll build something better (like an off-heap implementation, maybe using pagemem).
- An algorithm for determining when the in-memory storage cannot accept new entries. On this iteration, the only supported algorithm will be simply limiting the store by the number of stored entries. Later we will add something smarter, like the total size of the stored entries and adaptive algorithms.
- Logic for spilling out to disk. This should not be implemented on this iteration, but it will be implemented later, in
IGNITE-17336
Attachments
Issue Links
- split from
-
IGNITE-16655 Volatile RAFT log for pure in-memory storages
- Open
- links to