Sorted-Set based implementation

[paulbellamy]

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