Sorted-Set based implementation #1
Open
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.
I read through your library, and found it really interesting. We do a lot of work with time-series data, and would love to use redis for it. However, we need to be able to insert data into the past, so I added a basic implementation based on sorted-sets. Hopefully it would be a useful example for other people.
I've 'bucketed' the data into 'timestep' keys, to keep inserts quicker, and help break data across a redis-cluster. I'm curious what your thoughts on this implementation are. Is it possible to do it more efficiently?
Thanks,
Paul