{"acl_categories":["@keyspace","@write","@slow","@dangerous"],"arguments":[{"display_text":"key","key_spec_index":0,"name":"key","type":"key"},{"display_text":"ttl","name":"ttl","type":"integer"},{"display_text":"serialized-value","name":"serialized-value","type":"string"},{"display_text":"replace","name":"replace","optional":true,"since":"3.0.0","token":"REPLACE","type":"pure-token"},{"display_text":"absttl","name":"absttl","optional":true,"since":"5.0.0","token":"ABSTTL","type":"pure-token"},{"display_text":"seconds","name":"seconds","optional":true,"since":"5.0.0","token":"IDLETIME","type":"integer"},{"display_text":"frequency","name":"frequency","optional":true,"since":"5.0.0","token":"FREQ","type":"integer"}],"arity":-4,"categories":["docs","develop","stack","oss","rs","rc","oss","kubernetes","clients"],"command_flags":["write","denyoom","asking"],"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)).","description":"An internal command for migrating keys in a cluster.","duplicateOf":"head:data-ai-metadata","group":"server","key_specs":[{"OW":true,"begin_search":{"spec":{"index":1},"type":"index"},"find_keys":{"spec":{"keystep":1,"lastkey":0,"limit":0},"type":"range"},"update":true}],"location":"body","since":"3.0.0","syntax_fmt":"RESTORE-ASKING key ttl serialized-value [REPLACE] [ABSTTL]\n [IDLETIME seconds] [FREQ frequency]","title":"RESTORE-ASKING","tableOfContents":{"sections":[{"id":"required-arguments","title":"Required arguments"},{"id":"optional-arguments","title":"Optional arguments"},{"id":"redis-software-and-redis-cloud-compatibility","title":"Redis Software and Redis Cloud compatibility"},{"id":"return-information","title":"Return information"}]},"codeExamples":[]}

AI agent builder

Redis install Data types

Tools Community Docs

Login Sign up

RESTORE-ASKING

Syntax text Syntax diagram API methods

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

Client:

No method signature available for this client.

Available since:: Redis Open Source 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 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)).
ACL categories:: @keyspace, @write, @slow, @dangerous,
Compatibility:: Redis Software and Redis Cloud compatibility

The RESTORE-ASKING command is an internal command. It is used by a Redis cluster master during slot migration.

Required arguments

key

The name of the key to create.

ttl

The time to live for the key, in milliseconds. 0 means no expiration. With ABSTTL, this is an absolute Unix timestamp in milliseconds.

serialized-value

The serialized value, as produced by DUMP.

Optional arguments

REPLACE

Replace the key if it already exists.

ABSTTL

Interpret ttl as an absolute Unix timestamp in milliseconds rather than a relative time.

IDLETIME seconds

Set the key's idle time (for LRU eviction) to this many seconds.

FREQ frequency

Set the key's access-frequency counter (for LFU eviction) to this value.

Redis Software and Redis Cloud compatibility

Redis Software	Redis Cloud	Notes
❌ Standard ❌ Active-Active	❌ Standard ❌ Active-Active

Return information

RESP2 RESP3

Simple string reply: OK.

Simple string reply: OK.

History

Starting with Redis version 3.0.0: Added the REPLACE modifier.
Starting with Redis version 5.0.0: Added the ABSTTL modifier.
Starting with Redis version 5.0.0: Added the IDLETIME and FREQ options.