On-disk storage & single stride size #48
Open
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
* lsm_tree dep * persistence_key calculation * weave PREFIX_SIZE and KEY_SIZE into CustomAllocStorage * PersisTree
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This is a very large PR, you'd better look at the resulting code in the source
devbranch, than at the diffed code from the PR.Major changes are:
MemoryOnly: current records are stored in memory only. New records replace existing records.PersistOnly: current records are persisted to disk only. New records replace existing records.PersistHistory: current records are stored in memory only. Existing records are stored on disk, when a newer record is written.WriteAhead: current records are stored both in memory and persisted to disk. Existing records are stored on disk, when a newer record is written.src/lib.rshas more details, that's also a good starting point to get a grip on the whole repo.Rotonda-store 0.2resulted in this number being the best performing size for all data structures involved, in both memory consumption and speed. This also vastly simplified the code, and reduces the amount of indirections needed to go from stride to stride.