RESTORE-ASKING

RESTORE-ASKING key ttl serialized-value [REPLACE] [ABSTTL] [IDLETIME] [FREQ]

Available since

3.0.0

Time complexity

O(1) to create the new key and additional O(N*M) to reconstruct the serialized value, where N is the number of Redict 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)).

ACL categories

@keyspace, @write, @slow, @dangerous

History #

3.0.0

Added the `REPLACE` modifier.

5.0.0

Added the `ABSTTL` modifier.

5.0.0

Added the `IDLETIME` and `FREQ` options.