Big O notation
As you may already know and fully appreciate, Salvatore Sanfilippo intentionally documents the worst-case algorithmic performance of each Redis command on Redis's website at http://redis.io/commands/. This focus on an algorithmic measure of performance as a core actionable metric differentiates Redis from the other data storage technologies. A mathematical definition of Big O is that it "symbolically expresses the asymptotic behavior of a given function.2. Within computer science and more pertinent to our understanding of the big O notation within Redis, with this notation and understanding, we can classify the performance of a Redis command by how the commands perform with increasing inputs to the command over time.
Graphing Big O Notation
In the Redis documentation for each command, the time complexity of each Redis command is given in these big O cases:
- The O(1) case in the big O notation is shorthand for increasing the number of inputs that do not change the time...
