4 ms·
It's no authoritative source, but I'm obviously not the only one that thinks this: http://www.webdevelopment-blog.com/2011/07/puma-on-redis/ http://www.webdevel
by dickeytk 15y ago
It's no authoritative source, but I'm obviously not the only one that thinks this: http://www.webdevelopment-blog.com/2011/07/puma-on-redis/ http://www.webdevelopment-blog.com/2011/07/puma-on-redis/
- tabbyjabby 15y agoWhy is it more efficient to store everything in individual k-v pairs? Hash tables are certainly more memory efficient, and the difference in CPU efficiency is so slight as to be inconsequential.
- dickeytk 15y agodoh! I got it backwards. You are right that hashes are more efficient: http://redis.io/topics/memory-optimization http://redis.io/topics/memory-optimization However, for this particular problem, the docs do say: Don't use KEYS in your regular application code. If you're looking for a way to find keys in a subset of your keyspace, consider using sets. I wonder why they don't suggest hashes?
- tabbyjabby 15y agoBecause you might want to use sets to group any type of keys, including hashes.