mirror of
https://codeberg.org/redict/redict.git
synced 2025-01-23 08:38:27 -05:00
42 lines
1.3 KiB
JSON
42 lines
1.3 KiB
JSON
|
{
|
||
|
"RESTORE-ASKING": {
|
||
|
"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)).",
|
||
|
"group": "server",
|
||
|
"since": "3.0.0",
|
||
|
"arity": -4,
|
||
|
"function": "restoreCommand",
|
||
|
"doc_flags": [
|
||
|
"SYSCMD"
|
||
|
],
|
||
|
"command_flags": [
|
||
|
"WRITE",
|
||
|
"DENYOOM",
|
||
|
"ASKING"
|
||
|
],
|
||
|
"acl_categories": [
|
||
|
"KEYSPACE",
|
||
|
"DANGEROUS"
|
||
|
],
|
||
|
"key_specs": [
|
||
|
{
|
||
|
"flags": [
|
||
|
"WRITE"
|
||
|
],
|
||
|
"begin_search": {
|
||
|
"index": {
|
||
|
"pos": 1
|
||
|
}
|
||
|
},
|
||
|
"find_keys": {
|
||
|
"range": {
|
||
|
"lastkey": 0,
|
||
|
"step": 1,
|
||
|
"limit": 0
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
]
|
||
|
}
|
||
|
}
|