Book Image

Mastering Redis

By : Jeremy Nelson
Book Image

Mastering Redis

By: Jeremy Nelson

Overview of this book

Redis is the most popular, open-source, key value data structure server that provides a wide range of capabilities on which multiple platforms can be be built. Its fast and flexible data structures give your existing applications an edge in the development environment. This book is a practical guide which aims to help you deep dive into the world of Redis data structure to exploit its excellent features. We start our journey by understanding the need of Redis in brief, followed by an explanation of Advanced key management. Next, you will learn about design patterns, best practices for using Redis in DevOps environment and Docker containerization paradigm in detail. After this, you will understand the concept of scaling with Redis cluster and Redis Sentinel , followed by a through explanation of incorporating Redis with NoSQL technologies such as Elasticsearch and MongoDB. At the end of this section, you will be able to develop competent applications using these technologies. You will then explore the message queuing and task management features of Redis and will be able to implement them in your applications. Finally, you will learn how Redis can be used to build real-time data analytic dashboards, for different disparate data streams.
Table of Contents (18 chapters)
Mastering Redis
About the Author
About the Reviewers

Bitstrings and bit operations

Specialized uses of Redis strings with the corresponding commands allow for the use of memory-efficient data structures in Redis for a comparatively small number of bits, and depending on your use case and data, using sets or hashes would offer better performance. In bitstrings, 8 bits are stored per byte, with the first bit at position 0 being the significant one that is set to either 0 or 1. The maximum size for Redis bitstrings is 512 MB, the same limitation for all Redis keys and values.

One reason that makes a bitstring so efficient and fast is that most of its commands are the O(1) or O(n) operations. With SETBIT and GETBIT, bits are either set to 0 or 1 or the value retrieved by both O(1) operations and the use of a bitstring to store the binary information across a range of sequential values is extremely fast. For the BITOP, BITPOS, and BITCOUNT commands, the time complexity is O(n) but offers power semantics for using bitstrings.

A common use case for...