Skip to content

Sorted-Set based implementation #1

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 2 commits into
base: master
Choose a base branch
from

Conversation

paulbellamy
Copy link

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

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant