"complexity":"O(N+M) where N is the number of clients subscribed to the receiving channel and M is the total number of subscribed patterns (by any client).",
"summary":"Stop listening for messages posted to channels matching the given patterns",
"summary":"Stops listening to messages published to channels that match one or more patterns.",
"complexity":"O(N+M) where N is the number of patterns the client is already subscribed and M is the number of total patterns subscribed in the system (by any client).",
"summary":"An internal command for migrating keys in a cluster",
"summary":"An internal command for migrating keys in a cluster.",
"complexity":"O(1) to create the new key and additional O(N*M) to reconstruct the serialized value, where N is the number of Redis objects composing the value and M their average size. For small string values the time complexity is thus O(1)+O(1*M) where M is small, so simply O(1). However for sorted set values the complexity is O(N*M*log(N)) because inserting values into sorted sets is O(log(N)).",
"summary":"Create a key using the provided serialized value, previously obtained using DUMP.",
"summary":"Creates a key from the serialized representation of a value.",
"complexity":"O(1) to create the new key and additional O(N*M) to reconstruct the serialized value, where N is the number of Redis objects composing the value and M their average size. For small string values the time complexity is thus O(1)+O(1*M) where M is small, so simply O(1). However for sorted set values the complexity is O(N*M*log(N)) because inserting values into sorted sets is O(log(N)).",