Mastering Redis

Summary

This chapter started with some memory-related directives that can be set and then we looked at the various policies for key eviction when Redis reaches the limits of its available memory. Different memory-efficient encoding for small hashes, lists, sorted sets, and sets under special conditions, sets were examined next. We then looked at using bitmap strings as random access arrays followed by using hashes more effectively as a high-level key-value store that is more memory efficient. Finally, we took a look at how to use the Redis latency monitor mode to track problematic and long-running Redis commands followed by a couple of tips for improving running Redis on Linux. The next chapter switches the focus to software development and starting ...