kevy-cli 7.0.0

kevy operations CLI: redis-cli-style REPL plus the migration toolchain (import/export/verify/diff/inspect/digest).
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
2597
2598
2599
2600
2601
2602
2603
2604
2605
2606
2607
2608
2609
2610
2611
2612
2613
2614
2615
2616
2617
2618
2619
2620
2621
2622
2623
2624
2625
2626
2627
2628
2629
2630
2631
2632
2633
2634
2635
2636
2637
2638
2639
2640
2641
2642
2643
2644
2645
2646
2647
2648
2649
2650
2651
2652
2653
2654
2655
2656
2657
2658
2659
2660
2661
2662
2663
2664
2665
2666
2667
2668
2669
2670
2671
2672
2673
2674
2675
2676
2677
2678
2679
2680
2681
2682
2683
2684
2685
2686
2687
2688
2689
2690
2691
2692
2693
2694
2695
2696
2697
2698
2699
2700
2701
2702
2703
2704
2705
2706
2707
2708
2709
2710
2711
2712
2713
2714
2715
2716
2717
2718
2719
2720
2721
2722
2723
2724
2725
2726
2727
2728
2729
2730
2731
2732
2733
2734
2735
2736
2737
2738
2739
2740
2741
2742
2743
2744
2745
2746
2747
2748
2749
2750
2751
2752
2753
2754
2755
2756
2757
2758
2759
2760
2761
2762
2763
2764
2765
2766
2767
2768
2769
2770
2771
2772
2773
2774
2775
2776
2777
2778
2779
2780
2781
2782
2783
2784
2785
2786
2787
2788
2789
2790
2791
2792
2793
2794
2795
2796
2797
2798
2799
2800
2801
2802
2803
2804
2805
2806
2807
2808
2809
2810
2811
2812
2813
2814
2815
2816
2817
2818
2819
2820
2821
2822
2823
2824
2825
2826
2827
2828
2829
2830
2831
2832
2833
2834
2835
2836
2837
2838
2839
2840
2841
2842
2843
2844
2845
2846
2847
2848
2849
2850
2851
2852
2853
2854
2855
2856
2857
2858
2859
2860
2861
2862
2863
2864
2865
2866
2867
2868
2869
2870
2871
2872
2873
2874
2875
2876
2877
2878
2879
2880
2881
2882
2883
2884
2885
2886
2887
2888
2889
2890
2891
2892
2893
2894
2895
2896
2897
2898
2899
2900
2901
2902
2903
2904
2905
2906
2907
2908
2909
2910
2911
2912
2913
2914
2915
2916
2917
2918
2919
2920
2921
2922
2923
2924
2925
2926
2927
2928
2929
2930
2931
2932
2933
2934
2935
2936
2937
2938
2939
2940
2941
2942
2943
2944
2945
2946
2947
2948
2949
2950
2951
2952
2953
2954
2955
2956
2957
2958
2959
2960
2961
2962
2963
2964
2965
2966
2967
2968
2969
2970
2971
2972
2973
2974
2975
2976
2977
2978
2979
2980
2981
2982
2983
2984
2985
2986
2987
2988
2989
2990
2991
2992
2993
2994
2995
2996
2997
2998
2999
3000
3001
3002
3003
3004
3005
3006
3007
3008
3009
3010
3011
3012
3013
3014
3015
3016
3017
3018
3019
3020
3021
3022
3023
3024
3025
3026
3027
3028
3029
3030
3031
3032
3033
3034
3035
3036
3037
3038
3039
3040
3041
3042
3043
3044
3045
3046
3047
3048
3049
3050
3051
3052
3053
3054
3055
3056
3057
3058
3059
3060
3061
3062
3063
3064
3065
3066
3067
3068
3069
3070
3071
3072
3073
3074
3075
3076
3077
3078
3079
3080
3081
3082
3083
3084
3085
3086
3087
3088
3089
3090
3091
3092
3093
3094
3095
3096
3097
3098
3099
3100
3101
3102
3103
3104
3105
3106
3107
3108
3109
3110
3111
3112
3113
3114
3115
3116
3117
3118
3119
3120
3121
3122
3123
3124
3125
3126
3127
3128
3129
3130
3131
3132
3133
3134
3135
3136
3137
3138
3139
3140
3141
3142
3143
3144
3145
3146
3147
3148
3149
3150
3151
3152
3153
3154
3155
3156
3157
3158
3159
3160
3161
3162
3163
3164
3165
3166
3167
3168
3169
3170
3171
3172
3173
3174
3175
3176
3177
3178
3179
3180
3181
3182
3183
3184
3185
3186
3187
3188
3189
3190
3191
3192
3193
3194
3195
3196
3197
3198
3199
3200
3201
3202
3203
3204
3205
3206
3207
3208
3209
3210
3211
3212
3213
3214
3215
3216
3217
3218
3219
3220
3221
3222
3223
3224
3225
3226
3227
3228
3229
3230
3231
3232
3233
3234
3235
3236
3237
3238
3239
3240
3241
3242
3243
3244
3245
3246
3247
3248
3249
3250
3251
3252
3253
3254
3255
3256
3257
3258
3259
3260
3261
3262
3263
3264
3265
3266
3267
3268
3269
3270
3271
3272
3273
3274
3275
3276
3277
3278
3279
3280
3281
3282
3283
3284
3285
3286
3287
3288
3289
3290
3291
3292
3293
3294
3295
3296
3297
3298
3299
3300
3301
3302
3303
3304
3305
3306
3307
3308
3309
3310
3311
3312
3313
3314
3315
3316
3317
3318
3319
3320
3321
3322
3323
3324
3325
3326
3327
3328
3329
3330
3331
3332
3333
3334
3335
3336
3337
3338
3339
3340
3341
3342
3343
3344
3345
3346
3347
3348
3349
3350
3351
3352
3353
3354
3355
3356
3357
3358
3359
3360
3361
3362
3363
3364
3365
3366
3367
3368
3369
3370
3371
3372
3373
3374
3375
3376
3377
3378
3379
3380
3381
3382
3383
3384
3385
3386
3387
3388
3389
3390
3391
3392
3393
3394
3395
3396
3397
3398
3399
3400
3401
3402
3403
3404
3405
3406
3407
3408
3409
3410
3411
3412
3413
3414
3415
3416
3417
3418
3419
3420
3421
3422
3423
3424
3425
3426
3427
3428
3429
3430
3431
3432
3433
3434
3435
3436
3437
3438
3439
3440
3441
3442
3443
3444
3445
3446
3447
3448
3449
3450
3451
3452
3453
3454
3455
3456
3457
3458
3459
3460
3461
3462
3463
3464
3465
3466
3467
3468
3469
3470
3471
3472
3473
3474
3475
3476
3477
3478
3479
3480
3481
3482
3483
3484
3485
3486
3487
3488
3489
3490
3491
3492
3493
3494
3495
3496
3497
3498
3499
3500
3501
3502
3503
3504
3505
3506
3507
3508
3509
3510
3511
3512
3513
3514
3515
3516
3517
3518
3519
3520
3521
3522
3523
3524
3525
3526
3527
3528
3529
3530
3531
3532
3533
3534
3535
3536
3537
3538
3539
3540
3541
3542
3543
3544
3545
3546
3547
3548
3549
3550
3551
3552
3553
3554
3555
3556
3557
3558
3559
3560
3561
3562
3563
3564
3565
3566
3567
3568
3569
3570
3571
3572
3573
3574
3575
3576
3577
3578
3579
3580
3581
3582
3583
3584
3585
3586
3587
3588
3589
3590
3591
3592
3593
3594
3595
3596
3597
3598
3599
3600
3601
3602
3603
3604
3605
3606
3607
3608
3609
3610
3611
3612
3613
3614
3615
3616
3617
3618
3619
3620
3621
3622
3623
3624
3625
3626
3627
3628
3629
3630
3631
3632
3633
3634
3635
3636
3637
3638
3639
3640
3641
3642
3643
3644
3645
3646
3647
3648
3649
3650
3651
3652
3653
3654
3655
3656
3657
3658
3659
3660
3661
3662
3663
3664
3665
3666
3667
3668
3669
3670
3671
3672
3673
3674
3675
3676
3677
3678
3679
3680
3681
3682
3683
3684
3685
3686
3687
3688
3689
3690
3691
3692
3693
3694
3695
3696
3697
3698
3699
3700
3701
3702
3703
3704
3705
3706
3707
3708
3709
3710
3711
3712
3713
3714
3715
3716
3717
3718
3719
3720
3721
3722
3723
3724
3725
3726
3727
3728
3729
3730
3731
3732
3733
3734
3735
3736
3737
3738
3739
3740
3741
3742
3743
3744
3745
3746
3747
3748
3749
3750
3751
3752
3753
3754
3755
3756
3757
3758
3759
3760
3761
3762
3763
3764
3765
3766
3767
3768
3769
3770
3771
3772
3773
3774
3775
3776
3777
3778
3779
3780
3781
3782
3783
3784
3785
3786
3787
3788
3789
3790
3791
3792
3793
3794
3795
3796
3797
3798
3799
3800
3801
3802
3803
3804
3805
3806
3807
3808
3809
3810
3811
3812
3813
3814
3815
3816
3817
3818
3819
3820
3821
3822
3823
3824
3825
3826
3827
3828
3829
3830
3831
3832
3833
3834
3835
3836
3837
3838
3839
3840
3841
3842
3843
3844
3845
3846
3847
3848
3849
3850
3851
3852
3853
3854
3855
3856
3857
3858
3859
3860
3861
3862
3863
3864
3865
3866
3867
3868
3869
3870
3871
3872
3873
3874
3875
3876
3877
3878
3879
3880
3881
3882
3883
3884
3885
3886
3887
3888
3889
3890
3891
3892
3893
3894
3895
3896
3897
3898
3899
3900
3901
3902
3903
3904
3905
3906
3907
3908
3909
3910
3911
3912
3913
3914
3915
3916
3917
3918
3919
3920
3921
3922
3923
3924
3925
3926
3927
3928
3929
3930
3931
3932
3933
3934
3935
3936
3937
3938
3939
3940
3941
3942
3943
3944
3945
3946
3947
3948
3949
3950
3951
3952
3953
3954
3955
3956
3957
3958
3959
3960
3961
3962
3963
3964
3965
3966
3967
3968
3969
3970
3971
3972
3973
3974
3975
3976
3977
3978
3979
3980
3981
3982
3983
3984
3985
3986
3987
3988
3989
3990
3991
3992
3993
3994
3995
3996
3997
3998
3999
4000
4001
4002
4003
4004
4005
4006
4007
4008
4009
4010
4011
4012
4013
4014
4015
4016
4017
4018
4019
4020
4021
4022
4023
4024
4025
4026
4027
4028
4029
4030
4031
4032
4033
4034
4035
4036
4037
4038
4039
4040
4041
4042
4043
4044
4045
4046
4047
4048
4049
4050
4051
4052
4053
4054
4055
4056
4057
4058
4059
4060
4061
4062
4063
4064
4065
4066
4067
4068
4069
4070
4071
4072
4073
4074
4075
4076
4077
4078
4079
4080
4081
4082
4083
4084
4085
4086
4087
4088
4089
4090
4091
4092
4093
4094
4095
4096
4097
4098
4099
4100
4101
4102
4103
4104
4105
4106
4107
4108
4109
4110
4111
4112
4113
4114
4115
4116
4117
4118
4119
4120
4121
4122
4123
4124
4125
4126
4127
4128
4129
4130
4131
4132
4133
4134
4135
4136
4137
4138
4139
4140
4141
4142
4143
4144
4145
4146
4147
4148
4149
4150
4151
4152
4153
4154
4155
4156
4157
4158
4159
4160
4161
4162
4163
4164
4165
4166
4167
4168
4169
4170
4171
4172
4173
4174
4175
4176
4177
4178
4179
4180
4181
4182
4183
4184
4185
4186
4187
4188
4189
4190
4191
4192
4193
4194
4195
4196
4197
4198
4199
4200
4201
4202
4203
4204
4205
4206
4207
4208
4209
4210
4211
4212
4213
4214
4215
4216
4217
4218
4219
4220
4221
4222
4223
4224
4225
4226
4227
4228
4229
4230
4231
4232
4233
4234
4235
4236
4237
4238
4239
4240
4241
4242
4243
4244
4245
4246
4247
4248
4249
4250
4251
4252
4253
4254
4255
4256
4257
4258
4259
4260
4261
4262
4263
4264
4265
4266
4267
4268
4269
4270
4271
4272
4273
4274
4275
4276
4277
4278
4279
4280
4281
4282
4283
4284
4285
4286
4287
4288
4289
4290
4291
4292
4293
4294
4295
4296
4297
4298
4299
4300
4301
4302
4303
4304
4305
4306
4307
4308
4309
4310
4311
4312
4313
4314
4315
4316
4317
4318
4319
4320
4321
4322
4323
4324
4325
4326
4327
4328
4329
4330
4331
4332
4333
4334
4335
4336
4337
4338
4339
4340
4341
4342
4343
4344
4345
4346
4347
4348
4349
4350
4351
4352
4353
4354
4355
4356
4357
4358
4359
4360
4361
4362
4363
4364
4365
4366
4367
4368
4369
4370
4371
4372
4373
4374
4375
4376
4377
4378
4379
4380
4381
4382
4383
4384
4385
4386
4387
4388
4389
4390
4391
4392
4393
4394
4395
4396
4397
4398
4399
4400
4401
4402
4403
4404
4405
4406
4407
4408
4409
4410
4411
4412
4413
4414
4415
4416
4417
4418
4419
4420
4421
4422
4423
4424
4425
4426
4427
4428
4429
4430
4431
4432
4433
4434
4435
4436
4437
4438
4439
4440
4441
4442
4443
4444
4445
4446
4447
4448
4449
4450
4451
4452
4453
4454
4455
4456
4457
4458
4459
4460
4461
4462
4463
4464
4465
4466
4467
4468
4469
4470
4471
4472
4473
4474
4475
4476
4477
4478
4479
4480
4481
4482
4483
4484
4485
4486
4487
4488
4489
4490
4491
4492
4493
4494
4495
4496
4497
4498
4499
4500
4501
4502
4503
4504
4505
4506
4507
4508
4509
4510
4511
4512
4513
4514
4515
4516
4517
4518
4519
4520
4521
4522
4523
4524
4525
4526
4527
4528
4529
4530
4531
4532
4533
4534
4535
4536
4537
4538
4539
4540
4541
4542
4543
4544
4545
4546
4547
4548
4549
4550
4551
4552
4553
4554
4555
4556
4557
4558
4559
4560
4561
4562
4563
4564
4565
4566
4567
4568
4569
4570
4571
4572
4573
4574
4575
4576
4577
4578
4579
4580
4581
4582
4583
4584
4585
4586
4587
4588
4589
4590
4591
4592
4593
4594
4595
4596
4597
4598
4599
4600
4601
4602
4603
4604
4605
4606
4607
4608
4609
4610
4611
4612
4613
4614
4615
4616
4617
4618
4619
4620
4621
4622
4623
4624
4625
4626
4627
4628
4629
4630
4631
4632
4633
4634
4635
4636
4637
4638
4639
4640
4641
4642
4643
4644
4645
4646
4647
4648
4649
4650
4651
4652
4653
4654
4655
4656
4657
4658
4659
4660
4661
4662
4663
4664
4665
4666
4667
4668
4669
4670
4671
4672
4673
4674
4675
4676
4677
4678
4679
4680
4681
4682
4683
4684
4685
4686
4687
4688
4689
4690
4691
4692
4693
4694
4695
4696
4697
4698
4699
4700
4701
4702
4703
4704
4705
4706
4707
4708
4709
4710
4711
4712
4713
4714
4715
4716
4717
4718
4719
4720
4721
4722
4723
4724
4725
4726
4727
4728
4729
4730
4731
4732
4733
4734
4735
4736
4737
4738
4739
4740
4741
4742
4743
4744
4745
4746
4747
4748
4749
4750
4751
4752
4753
4754
4755
4756
4757
4758
4759
4760
4761
4762
4763
4764
4765
4766
4767
4768
4769
4770
4771
4772
4773
4774
4775
4776
4777
4778
4779
4780
4781
4782
4783
4784
4785
4786
4787
4788
4789
4790
4791
4792
4793
4794
4795
4796
4797
4798
4799
4800
4801
4802
4803
4804
4805
4806
4807
4808
4809
4810
4811
4812
4813
4814
4815
4816
4817
4818
4819
4820
4821
4822
4823
4824
4825
4826
4827
4828
4829
4830
4831
4832
4833
4834
4835
4836
4837
4838
4839
4840
4841
4842
4843
4844
4845
4846
4847
4848
4849
4850
4851
4852
4853
4854
4855
4856
4857
4858
4859
4860
4861
4862
4863
4864
4865
4866
4867
4868
4869
4870
4871
4872
4873
4874
4875
4876
4877
4878
4879
4880
4881
4882
4883
4884
4885
4886
4887
4888
4889
4890
4891
4892
4893
4894
4895
4896
4897
4898
4899
4900
4901
4902
4903
4904
4905
4906
4907
4908
4909
4910
4911
4912
4913
4914
4915
4916
4917
4918
4919
4920
4921
4922
4923
4924
4925
4926
4927
4928
4929
4930
4931
4932
4933
4934
4935
4936
4937
4938
4939
4940
4941
4942
4943
4944
4945
4946
4947
4948
4949
4950
4951
4952
4953
4954
4955
4956
4957
4958
4959
4960
4961
4962
4963
4964
4965
4966
4967
4968
4969
4970
4971
4972
4973
4974
4975
4976
4977
4978
4979
4980
4981
4982
4983
4984
4985
4986
4987
4988
4989
4990
4991
4992
4993
4994
4995
4996
4997
4998
4999
5000
5001
5002
5003
5004
5005
5006
5007
5008
5009
5010
5011
5012
5013
5014
5015
5016
5017
5018
5019
5020
5021
5022
5023
5024
5025
5026
5027
5028
5029
5030
5031
5032
5033
5034
5035
5036
5037
5038
5039
5040
5041
5042
5043
5044
5045
5046
5047
5048
5049
5050
5051
5052
5053
5054
5055
5056
5057
5058
5059
5060
5061
5062
5063
5064
5065
5066
5067
5068
5069
5070
5071
5072
5073
5074
5075
5076
5077
5078
5079
5080
5081
5082
5083
5084
5085
5086
5087
5088
5089
5090
5091
5092
5093
5094
5095
5096
5097
5098
5099
5100
5101
5102
5103
5104
5105
5106
5107
5108
5109
5110
5111
5112
5113
5114
5115
5116
5117
5118
5119
5120
5121
5122
5123
5124
5125
5126
5127
5128
5129
5130
5131
5132
5133
5134
5135
5136
5137
5138
5139
5140
5141
5142
5143
5144
5145
5146
5147
5148
5149
5150
5151
5152
5153
5154
5155
5156
5157
5158
5159
5160
5161
5162
5163
5164
5165
5166
5167
5168
5169
5170
5171
5172
5173
5174
5175
5176
5177
5178
5179
5180
5181
5182
5183
5184
5185
5186
5187
5188
5189
5190
5191
5192
5193
5194
5195
5196
5197
5198
5199
5200
5201
5202
5203
5204
5205
5206
5207
5208
5209
5210
5211
5212
5213
5214
5215
5216
5217
5218
5219
5220
5221
5222
5223
5224
5225
5226
5227
5228
5229
5230
5231
5232
5233
5234
5235
5236
5237
5238
5239
5240
5241
5242
5243
5244
5245
5246
5247
5248
5249
5250
5251
5252
5253
5254
5255
5256
5257
5258
5259
5260
5261
5262
5263
5264
5265
5266
5267
5268
5269
5270
5271
5272
5273
5274
5275
5276
5277
5278
5279
5280
5281
5282
5283
5284
5285
5286
5287
5288
5289
5290
5291
5292
5293
5294
5295
5296
5297
5298
5299
5300
5301
5302
5303
5304
5305
5306
5307
5308
5309
5310
5311
5312
5313
5314
5315
5316
5317
5318
5319
5320
5321
5322
5323
5324
5325
5326
5327
5328
5329
5330
5331
5332
5333
5334
5335
5336
5337
5338
5339
5340
5341
5342
5343
5344
5345
5346
5347
5348
5349
5350
5351
5352
5353
5354
5355
5356
5357
5358
5359
5360
5361
5362
5363
5364
5365
5366
5367
5368
5369
5370
5371
5372
5373
5374
5375
5376
5377
5378
5379
5380
5381
5382
5383
5384
5385
5386
5387
5388
5389
5390
5391
5392
5393
5394
5395
5396
5397
5398
5399
5400
5401
5402
5403
5404
5405
5406
5407
5408
5409
5410
5411
5412
5413
5414
5415
5416
5417
5418
5419
5420
5421
5422
5423
5424
5425
5426
5427
5428
5429
5430
5431
5432
5433
5434
5435
5436
5437
5438
5439
5440
5441
5442
5443
5444
5445
5446
5447
5448
5449
5450
5451
5452
5453
5454
5455
5456
5457
5458
5459
5460
5461
5462
5463
5464
5465
5466
5467
5468
5469
5470
5471
5472
5473
5474
5475
5476
5477
5478
5479
5480
5481
5482
5483
5484
5485
5486
5487
5488
5489
5490
5491
5492
5493
5494
5495
5496
5497
5498
5499
5500
5501
5502
5503
5504
5505
5506
5507
5508
5509
5510
5511
5512
5513
5514
5515
5516
5517
5518
5519
5520
5521
5522
5523
5524
5525
5526
5527
5528
5529
5530
5531
5532
5533
5534
5535
5536
5537
5538
5539
5540
5541
5542
5543
5544
5545
5546
5547
5548
5549
5550
5551
5552
5553
5554
5555
5556
5557
5558
5559
5560
5561
5562
5563
5564
5565
5566
5567
5568
5569
5570
5571
5572
5573
5574
5575
5576
5577
5578
5579
5580
5581
5582
5583
5584
5585
5586
5587
5588
5589
5590
5591
5592
5593
5594
5595
5596
5597
5598
5599
5600
5601
5602
5603
5604
5605
5606
5607
5608
5609
5610
5611
5612
5613
5614
5615
5616
5617
5618
5619
5620
5621
5622
5623
5624
5625
5626
5627
5628
5629
5630
5631
5632
5633
5634
5635
5636
5637
5638
5639
5640
5641
5642
5643
5644
5645
5646
5647
5648
5649
5650
5651
5652
5653
5654
5655
5656
5657
5658
5659
5660
5661
5662
5663
5664
5665
5666
5667
5668
5669
5670
5671
5672
5673
5674
5675
5676
5677
5678
5679
5680
5681
5682
5683
5684
5685
5686
5687
5688
5689
5690
5691
5692
5693
5694
5695
5696
5697
5698
5699
5700
5701
5702
5703
5704
5705
5706
5707
5708
5709
5710
5711
5712
5713
5714
5715
5716
5717
5718
5719
5720
5721
5722
5723
5724
5725
5726
5727
5728
5729
5730
5731
5732
5733
5734
5735
5736
5737
5738
5739
5740
5741
5742
5743
5744
5745
5746
5747
5748
5749
5750
5751
5752
5753
5754
5755
5756
5757
5758
5759
5760
5761
5762
5763
5764
5765
5766
5767
5768
5769
5770
5771
5772
5773
5774
5775
5776
5777
5778
5779
5780
5781
5782
5783
5784
5785
5786
5787
5788
5789
5790
5791
5792
5793
5794
5795
5796
5797
5798
5799
5800
5801
5802
5803
5804
5805
5806
5807
5808
5809
5810
5811
5812
5813
5814
5815
5816
5817
5818
5819
5820
5821
5822
5823
5824
5825
5826
5827
5828
5829
5830
5831
5832
5833
5834
5835
5836
5837
5838
5839
5840
5841
5842
5843
5844
5845
5846
5847
5848
5849
5850
5851
5852
5853
5854
5855
5856
5857
5858
5859
5860
5861
5862
5863
5864
5865
5866
5867
5868
5869
5870
5871
5872
5873
5874
5875
5876
5877
5878
5879
5880
5881
5882
5883
5884
5885
5886
5887
5888
5889
5890
5891
5892
5893
5894
5895
5896
5897
5898
5899
5900
5901
5902
5903
5904
5905
5906
5907
5908
5909
5910
5911
5912
5913
5914
5915
5916
5917
5918
5919
5920
5921
5922
5923
5924
5925
5926
5927
5928
5929
5930
5931
5932
5933
5934
5935
5936
5937
5938
5939
5940
5941
5942
5943
5944
5945
5946
5947
5948
5949
5950
5951
5952
5953
5954
5955
5956
5957
5958
5959
5960
5961
5962
5963
5964
5965
5966
5967
5968
5969
5970
5971
5972
5973
5974
5975
5976
5977
5978
5979
5980
5981
5982
5983
5984
5985
5986
5987
5988
5989
5990
5991
5992
5993
5994
5995
5996
5997
5998
5999
6000
6001
6002
6003
6004
6005
6006
6007
6008
6009
6010
6011
6012
6013
6014
6015
6016
6017
6018
6019
6020
6021
6022
6023
6024
6025
6026
6027
6028
6029
6030
6031
6032
6033
6034
6035
6036
6037
6038
6039
6040
6041
6042
6043
6044
6045
6046
6047
6048
6049
6050
6051
6052
6053
6054
6055
6056
6057
6058
6059
6060
6061
6062
6063
6064
6065
6066
6067
6068
6069
6070
6071
6072
6073
6074
6075
6076
6077
6078
6079
6080
6081
6082
6083
6084
6085
6086
6087
6088
6089
6090
6091
6092
6093
6094
6095
6096
6097
6098
6099
6100
6101
6102
6103
6104
6105
6106
6107
6108
6109
6110
6111
6112
6113
6114
6115
6116
6117
6118
6119
6120
6121
6122
6123
6124
6125
6126
6127
6128
6129
6130
6131
6132
6133
6134
6135
6136
6137
6138
6139
6140
6141
6142
6143
6144
6145
6146
6147
6148
6149
6150
6151
6152
6153
6154
6155
6156
6157
6158
6159
6160
6161
6162
6163
6164
6165
6166
6167
6168
6169
6170
6171
6172
6173
6174
6175
6176
6177
6178
6179
6180
6181
6182
6183
6184
6185
6186
6187
6188
6189
6190
6191
6192
6193
6194
6195
6196
6197
6198
6199
6200
6201
6202
6203
6204
6205
6206
6207
6208
6209
6210
6211
6212
6213
6214
6215
6216
6217
6218
6219
6220
6221
6222
6223
6224
6225
6226
6227
6228
6229
6230
6231
6232
6233
6234
6235
6236
6237
6238
6239
6240
6241
6242
6243
6244
6245
6246
6247
6248
6249
6250
6251
6252
6253
6254
6255
6256
6257
6258
6259
6260
6261
6262
6263
6264
6265
6266
6267
6268
6269
6270
6271
6272
6273
6274
6275
6276
6277
6278
6279
6280
6281
6282
6283
6284
6285
6286
6287
6288
6289
6290
6291
6292
6293
6294
6295
6296
6297
6298
6299
6300
6301
6302
6303
6304
6305
6306
6307
6308
6309
6310
6311
6312
6313
6314
6315
6316
6317
6318
6319
6320
6321
6322
6323
6324
6325
6326
6327
6328
6329
6330
6331
6332
6333
6334
6335
6336
6337
6338
6339
6340
6341
6342
6343
6344
6345
6346
6347
6348
6349
6350
6351
6352
6353
6354
6355
6356
6357
6358
6359
6360
6361
6362
6363
6364
6365
6366
6367
6368
6369
6370
6371
6372
6373
6374
6375
6376
6377
6378
6379
6380
6381
6382
6383
6384
6385
6386
6387
6388
6389
6390
6391
6392
6393
6394
6395
6396
6397
6398
6399
6400
6401
6402
6403
6404
6405
6406
6407
6408
6409
6410
6411
6412
6413
6414
6415
6416
6417
6418
6419
6420
6421
6422
6423
6424
6425
6426
6427
6428
6429
6430
6431
6432
6433
6434
6435
6436
6437
6438
6439
6440
6441
6442
6443
6444
6445
6446
6447
6448
6449
6450
6451
6452
6453
6454
6455
6456
6457
6458
6459
6460
6461
6462
6463
6464
6465
6466
6467
6468
6469
6470
6471
6472
6473
6474
6475
6476
6477
6478
6479
6480
6481
6482
6483
6484
6485
6486
6487
6488
6489
6490
6491
6492
6493
6494
6495
6496
6497
6498
6499
6500
6501
6502
6503
6504
6505
6506
6507
6508
6509
6510
6511
6512
6513
6514
6515
6516
6517
6518
6519
6520
6521
6522
6523
6524
6525
6526
6527
6528
6529
6530
6531
6532
6533
6534
6535
6536
6537
6538
6539
6540
6541
6542
6543
6544
6545
6546
6547
6548
6549
6550
6551
6552
6553
6554
6555
6556
6557
6558
6559
6560
6561
6562
6563
6564
6565
6566
6567
6568
6569
6570
6571
6572
6573
6574
6575
6576
6577
6578
6579
6580
6581
6582
6583
6584
6585
6586
6587
6588
6589
6590
6591
6592
6593
6594
6595
6596
6597
6598
6599
6600
6601
6602
6603
6604
6605
6606
6607
6608
6609
6610
6611
6612
6613
6614
6615
6616
6617
6618
6619
6620
6621
6622
6623
6624
6625
6626
6627
6628
6629
6630
6631
6632
6633
6634
6635
6636
6637
6638
6639
6640
6641
6642
6643
6644
6645
6646
6647
6648
6649
6650
6651
6652
6653
6654
6655
6656
6657
6658
6659
6660
6661
6662
6663
6664
6665
6666
6667
6668
6669
6670
6671
6672
6673
6674
6675
6676
6677
6678
6679
6680
6681
6682
6683
6684
6685
6686
6687
6688
6689
6690
6691
6692
6693
6694
6695
6696
6697
6698
6699
6700
6701
6702
6703
6704
6705
6706
6707
6708
6709
6710
6711
6712
6713
6714
6715
6716
6717
6718
6719
6720
6721
6722
6723
6724
6725
6726
6727
6728
6729
6730
6731
6732
6733
6734
6735
6736
6737
6738
6739
6740
6741
6742
6743
6744
6745
6746
6747
6748
6749
6750
6751
6752
6753
6754
6755
6756
6757
6758
6759
6760
6761
6762
6763
6764
6765
6766
6767
6768
6769
6770
6771
6772
6773
6774
6775
6776
6777
6778
6779
6780
6781
6782
6783
6784
6785
6786
6787
6788
6789
6790
6791
6792
6793
6794
6795
6796
6797
6798
6799
6800
6801
6802
6803
6804
6805
6806
6807
6808
6809
6810
6811
6812
6813
6814
6815
*418
$4
KEYS
*14
$7
summary
$64
Return every key matching the glob pattern (cross-shard gather).
$5
since
$5
1.0.0
$5
group
$4
scan
$6
syntax
$12
KEYS pattern
$10
complexity
$103
O(N) keys in the whole keyspace — every shard walks its entire map, plus an O(P*K) glob match per key
$6
compat
$4
full
$5
flags
*1
$8
readonly
$9
RANDOMKEY
*14
$7
summary
$38
Return a random key from the keyspace.
$5
since
$5
1.0.0
$5
group
$4
scan
$6
syntax
$9
RANDOMKEY
$10
complexity
$167
O(1) expected — each shard probes a random slot, and the origin folds the candidates through a reservoir weighted by shard key counts, so every key is equally likely
$6
compat
$4
full
$5
flags
*1
$8
readonly
$4
SCAN
*14
$7
summary
$108
Iterate the keyspace incrementally: each call walks ~COUNT buckets of one shard and returns the next cursor.
$5
since
$5
4.0.0
$5
group
$4
scan
$6
syntax
$53
SCAN cursor [MATCH pattern] [COUNT count] [TYPE type]
$10
complexity
$188
O(COUNT) buckets per call, amortised O(N) for a full sweep — reverse-binary cursor, rehash-tolerant (a key present for the whole sweep is returned at least once even across table growth)
$6
compat
$268
differs: cursors encode (shard, position), so a cursor is only valid on the server and shard count that issued it — the same per-node property Redis Cluster cursors have. MATCH and TYPE filter after collection; COUNT bounds the buckets visited, not the keys returned
$5
flags
*1
$8
readonly
$3
DEL
*14
$7
summary
$24
Delete one or more keys.
$5
since
$5
1.0.0
$5
group
$7
generic
$6
syntax
$17
DEL key [key ...]
$10
complexity
$94
O(N) keys, plus O(M) per key holding a collection of M elements (the drop walks the container)
$6
compat
$131
differs: the multi-key form is split by shard and summed with no barrier, so it is not atomic across shards; the single-key form is
$5
flags
*1
$5
write
$6
EXISTS
*14
$7
summary
$39
Count how many of the given keys exist.
$5
since
$5
1.0.0
$5
group
$7
generic
$6
syntax
$20
EXISTS key [key ...]
$10
complexity
$30
O(N) keys, one O(1) probe each
$6
compat
$109
differs: the multi-key form is gathered per shard, so the count is not a point-in-time snapshot across shards
$5
flags
*1
$8
readonly
$6
EXPIRE
*14
$7
summary
$62
Set a key's TTL in seconds (non-positive TTL deletes the key).
$5
since
$5
1.0.0
$5
group
$7
generic
$6
syntax
$18
EXPIRE key seconds
$10
complexity
$4
O(1)
$6
compat
$134
differs: the NX / XX / GT / LT condition flags are not parsed — arity is fixed at 3, so EXPIRE key seconds NX is a wrong-arity error
$5
flags
*1
$5
write
$8
EXPIREAT
*14
$7
summary
$60
Set a key's expiry as an absolute Unix timestamp in seconds.
$5
since
$5
1.0.0
$5
group
$7
generic
$6
syntax
$30
EXPIREAT key unix-time-seconds
$10
complexity
$4
O(1)
$6
compat
$85
differs: the NX / XX / GT / LT condition flags are not parsed — arity is fixed at 3
$5
flags
*1
$5
write
$7
PERSIST
*14
$7
summary
$19
Remove a key's TTL.
$5
since
$5
1.0.0
$5
group
$7
generic
$6
syntax
$11
PERSIST key
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$5
write
$7
PEXPIRE
*14
$7
summary
$32
Set a key's TTL in milliseconds.
$5
since
$5
1.0.0
$5
group
$7
generic
$6
syntax
$24
PEXPIRE key milliseconds
$10
complexity
$4
O(1)
$6
compat
$85
differs: the NX / XX / GT / LT condition flags are not parsed — arity is fixed at 3
$5
flags
*1
$5
write
$9
PEXPIREAT
*14
$7
summary
$65
Set a key's expiry as an absolute Unix timestamp in milliseconds.
$5
since
$5
1.0.0
$5
group
$7
generic
$6
syntax
$36
PEXPIREAT key unix-time-milliseconds
$10
complexity
$4
O(1)
$6
compat
$85
differs: the NX / XX / GT / LT condition flags are not parsed — arity is fixed at 3
$5
flags
*1
$5
write
$4
PTTL
*14
$7
summary
$69
Return a key's remaining TTL in milliseconds (-1 no TTL, -2 missing).
$5
since
$5
1.0.0
$5
group
$7
generic
$6
syntax
$8
PTTL key
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$8
readonly
$6
RENAME
*14
$7
summary
$81
Rename a key, overwriting the destination (write routed at the runtime Op level).
$5
since
$5
1.0.0
$5
group
$7
generic
$6
syntax
$17
RENAME key newkey
$10
complexity
$116
O(1) for a string value; O(M) for a collection of M elements (the entry's weight is re-derived by walking the value)
$6
compat
$174
differs: a cross-shard rename is a non-atomic Take then Put — there is a window in which neither key is visible; co-locate the two keys with a {hashtag} for the atomic path
$5
flags
*1
$5
write
$8
RENAMENX
*14
$7
summary
$91
Rename a key only if the destination does not exist (write routed at the runtime Op level).
$5
since
$5
1.0.0
$5
group
$7
generic
$6
syntax
$19
RENAMENX key newkey
$10
complexity
$60
O(1) for a string value; O(M) for a collection of M elements
$6
compat
$154
differs: cross-shard RENAMENX is a non-atomic Take, Put, restore-on-refusal sequence — there is a window in which the source is absent from the keyspace
$5
flags
*1
$5
write
$3
TTL
*14
$7
summary
$64
Return a key's remaining TTL in seconds (-1 no TTL, -2 missing).
$5
since
$5
1.0.0
$5
group
$7
generic
$6
syntax
$7
TTL key
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$8
readonly
$4
TYPE
*14
$7
summary
$43
Return the type of the value stored at key.
$5
since
$5
1.0.0
$5
group
$7
generic
$6
syntax
$8
TYPE key
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$8
readonly
$4
COPY
*14
$7
summary
$58
Copy a key's value, and its remaining TTL, to another key.
$5
since
$5
1.0.0
$5
group
$7
generic
$6
syntax
$33
COPY source destination [REPLACE]
$10
complexity
$78
O(1) same-shard; O(V) across shards, where V is the value copied over the ring
$6
compat
$185
differs: the DB argument is not accepted — kevy is single-database. A cross-shard copy is not atomic with anything else, but a failure between its two steps leaves both keys untouched
$5
flags
*1
$5
write
$5
TOUCH
*14
$7
summary
$39
Count how many of the given keys exist.
$5
since
$5
1.0.0
$5
group
$7
generic
$6
syntax
$19
TOUCH key [key ...]
$10
complexity
$61
O(N) keys — one existence probe per key on its owning shard
$6
compat
$118
differs: kevy has no idle-time clock to reset, so TOUCH is EXISTS with the eviction bookkeeping the probe already does
$5
flags
*1
$8
readonly
$6
UNLINK
*14
$7
summary
$61
Delete one or more keys (alias of DEL in kevy's shard model).
$5
since
$5
1.0.0
$5
group
$7
generic
$6
syntax
$20
UNLINK key [key ...]
$10
complexity
$66
O(N) keys, plus O(M) per collection-typed key — identical to DEL
$6
compat
$161
differs: UNLINK is an alias of DEL — the value is freed inline on the owning shard's reactor thread, not by a background thread, so it gives no latency benefit
$5
flags
*1
$5
write
$6
APPEND
*14
$7
summary
$55
Append bytes to a string value; returns the new length.
$5
since
$5
1.0.0
$5
group
$6
string
$6
syntax
$16
APPEND key value
$10
complexity
$195
O(1) amortised while the value is <= 64 B; O(N) per call once it exceeds that (the Arc payload is copied out and re-boxed on every append), so building a large string by repeated APPEND is O(N^2)
$6
compat
$4
full
$5
flags
*1
$5
write
$5
BITOP
*14
$7
summary
$47
Combine strings bitwise into a destination key.
$5
since
$5
1.0.0
$5
group
$6
string
$6
syntax
$42
BITOP AND|OR|XOR|NOT destkey key [key ...]
$10
complexity
$134
O(N) over the longest source; on a multi-shard server each source is read on its own shard and the result written on the destination's
$6
compat
$81
differs: the DIFF / DIFF1 / ANDOR / ONE operators of Redis 8.2 are a syntax error
$5
flags
*1
$5
write
$8
BITCOUNT
*14
$7
summary
$57
Count set bits in a string, optionally over a byte range.
$5
since
$5
1.0.0
$5
group
$6
string
$6
syntax
$24
BITCOUNT key [start end]
$10
complexity
$27
O(N) over the counted bytes
$6
compat
$94
differs: the BYTE / BIT unit argument of Redis 7.0 is not accepted — ranges are byte offsets
$5
flags
*1
$8
readonly
$6
BITPOS
*14
$7
summary
$51
Return the position of the first bit set to 0 or 1.
$5
since
$5
1.0.0
$5
group
$6
string
$6
syntax
$28
BITPOS key bit [start [end]]
$10
complexity
$27
O(N) over the scanned bytes
$6
compat
$94
differs: the BYTE / BIT unit argument of Redis 7.0 is not accepted — ranges are byte offsets
$5
flags
*1
$8
readonly
$6
GETBIT
*14
$7
summary
$47
Return the bit at the given offset of a string.
$5
since
$5
1.0.0
$5
group
$6
string
$6
syntax
$17
GETBIT key offset
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$8
readonly
$5
GETEX
*14
$7
summary
$47
Read a key and set its expiry in the same call.
$5
since
$5
1.0.0
$5
group
$6
string
$6
syntax
$40
GETEX key [EX seconds | PX milliseconds]
$10
complexity
$4
O(1)
$6
compat
$109
differs: EXAT / PXAT / PERSIST are not accepted, and an expiry of zero or less is refused rather than applied
$5
flags
*1
$5
write
$8
GETRANGE
*14
$7
summary
$38
Return a byte range of a string value.
$5
since
$5
1.0.0
$5
group
$6
string
$6
syntax
$22
GETRANGE key start end
$10
complexity
$28
O(M) over the returned bytes
$6
compat
$4
full
$5
flags
*1
$8
readonly
$6
SETBIT
*14
$7
summary
$57
Set the bit at the given offset, returning its old value.
$5
since
$5
1.0.0
$5
group
$6
string
$6
syntax
$23
SETBIT key offset value
$10
complexity
$71
O(1) amortised; O(N) on the call that grows the value out to the offset
$6
compat
$4
full
$5
flags
*1
$5
write
$8
SETRANGE
*14
$7
summary
$67
Overwrite a string from the given offset, returning the new length.
$5
since
$5
1.0.0
$5
group
$6
string
$6
syntax
$25
SETRANGE key offset value
$10
complexity
$84
O(M) over the written bytes; O(N) on the call that grows the value out to the offset
$6
compat
$4
full
$5
flags
*1
$5
write
$4
DECR
*14
$7
summary
$44
Decrement the integer value of a key by one.
$5
since
$5
1.0.0
$5
group
$6
string
$6
syntax
$8
DECR key
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$5
write
$6
DECRBY
*14
$7
summary
$57
Decrement the integer value of a key by the given amount.
$5
since
$5
1.0.0
$5
group
$6
string
$6
syntax
$20
DECRBY key decrement
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$5
write
$3
GET
*14
$7
summary
$33
Return the string value of a key.
$5
since
$5
1.0.0
$5
group
$6
string
$6
syntax
$7
GET key
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$8
readonly
$6
GETDEL
*14
$7
summary
$47
Return the string value of a key and delete it.
$5
since
$5
1.0.0
$5
group
$6
string
$6
syntax
$10
GETDEL key
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$5
write
$6
GETSET
*14
$7
summary
$55
Set a key's string value and return its previous value.
$5
since
$5
1.0.0
$5
group
$6
string
$6
syntax
$16
GETSET key value
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$5
write
$4
INCR
*14
$7
summary
$44
Increment the integer value of a key by one.
$5
since
$5
1.0.0
$5
group
$6
string
$6
syntax
$8
INCR key
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$5
write
$6
INCRBY
*14
$7
summary
$57
Increment the integer value of a key by the given amount.
$5
since
$5
1.0.0
$5
group
$6
string
$6
syntax
$20
INCRBY key increment
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$5
write
$11
INCRBYFLOAT
*14
$7
summary
$55
Increment the float value of a key by the given amount.
$5
since
$5
1.0.0
$5
group
$6
string
$6
syntax
$25
INCRBYFLOAT key increment
$10
complexity
$4
O(1)
$6
compat
$160
differs: arithmetic is f64 and the reply uses Rust's shortest-round-trip float printer, not a long double accumulator, so trailing digits can diverge from Redis
$5
flags
*1
$5
write
$4
MGET
*14
$7
summary
$56
Return the values of multiple keys (cross-shard gather).
$5
since
$5
1.0.0
$5
group
$6
string
$6
syntax
$18
MGET key [key ...]
$10
complexity
$50
O(N) keys, one O(1) probe each on the owning shard
$6
compat
$133
differs: keys are grouped by shard and each shard is probed independently, so the reply is not a point-in-time snapshot across shards
$5
flags
*1
$8
readonly
$4
MSET
*14
$7
summary
$50
Set multiple key/value pairs atomically per shard.
$5
since
$5
1.0.0
$5
group
$6
string
$6
syntax
$30
MSET key value [key value ...]
$10
complexity
$29
O(N) pairs, one O(1) SET each
$6
compat
$202
differs: atomic only per shard — pairs are split by key and applied shard-by-shard with no cross-shard barrier, so a reader can observe some pairs written and others not; Redis MSET is globally atomic
$5
flags
*1
$5
write
$6
PSETEX
*14
$7
summary
$45
Set a key's value with a TTL in milliseconds.
$5
since
$5
1.0.0
$5
group
$6
string
$6
syntax
$29
PSETEX key milliseconds value
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$5
write
$3
SET
*14
$7
summary
$68
Set a key's string value with optional TTL and existence conditions.
$5
since
$5
1.0.0
$5
group
$6
string
$6
syntax
$50
SET key value [EX seconds|PX milliseconds] [NX|XX]
$10
complexity
$4
O(1)
$6
compat
$191
differs: only NX / XX / EX / PX are parsed — KEEPTTL, EXAT, PXAT, GET and the IFEQ family are a syntax error; a repeated expire option is silently accepted last-one-wins instead of erroring
$5
flags
*1
$5
write
$5
SETEX
*14
$7
summary
$40
Set a key's value with a TTL in seconds.
$5
since
$5
1.0.0
$5
group
$6
string
$6
syntax
$23
SETEX key seconds value
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$5
write
$5
SETNX
*14
$7
summary
$44
Set a key's value only if it does not exist.
$5
since
$5
1.0.0
$5
group
$6
string
$6
syntax
$15
SETNX key value
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$5
write
$6
STRLEN
*14
$7
summary
$42
Return the length of a key's string value.
$5
since
$5
1.0.0
$5
group
$6
string
$6
syntax
$10
STRLEN key
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$8
readonly
$4
HDEL
*14
$7
summary
$31
Delete one or more hash fields.
$5
since
$5
1.0.0
$5
group
$4
hash
$6
syntax
$26
HDEL key field [field ...]
$10
complexity
$11
O(M) fields
$6
compat
$4
full
$5
flags
*1
$5
write
$7
HEXISTS
*14
$7
summary
$34
Check whether a hash field exists.
$5
since
$5
1.0.0
$5
group
$4
hash
$6
syntax
$17
HEXISTS key field
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$8
readonly
$7
HEXPIRE
*14
$7
summary
$41
Set per-field TTLs on a hash, in seconds.
$5
since
$5
1.0.0
$5
group
$4
hash
$6
syntax
$68
HEXPIRE key seconds [NX|XX|GT|LT] FIELDS numfields field [field ...]
$10
complexity
$32
O(F) fields in the FIELDS clause
$6
compat
$120
differs: the FIELDS parse error reads 'Mandatory keyword FIELDS is missing' where Redis says 'Mandatory argument FIELDS'
$5
flags
*1
$5
write
$4
HGET
*14
$7
summary
$33
Return the value of a hash field.
$5
since
$5
1.0.0
$5
group
$4
hash
$6
syntax
$14
HGET key field
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$8
readonly
$7
HGETALL
*14
$7
summary
$39
Return all fields and values of a hash.
$5
since
$5
1.0.0
$5
group
$4
hash
$6
syntax
$11
HGETALL key
$10
complexity
$53
O(N) fields, with a full copy of every name and value
$6
compat
$4
full
$5
flags
*1
$8
readonly
$7
HINCRBY
*14
$7
summary
$44
Increment the integer value of a hash field.
$5
since
$5
1.0.0
$5
group
$4
hash
$6
syntax
$27
HINCRBY key field increment
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$5
write
$12
HINCRBYFLOAT
*14
$7
summary
$42
Increment the float value of a hash field.
$5
since
$5
1.0.0
$5
group
$4
hash
$6
syntax
$32
HINCRBYFLOAT key field increment
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$5
write
$10
HRANDFIELD
*14
$7
summary
$104
Return random fields from a hash; a negative count allows repeats, WITHVALUES pairs each with its value.
$5
since
$5
6.2.0
$5
group
$4
hash
$6
syntax
$35
HRANDFIELD key [count [WITHVALUES]]
$10
complexity
$118
O(count) for the positive form (partial Fisher-Yates over a materialised field list), O(|count|) for the negative form
$6
compat
$4
full
$5
flags
*1
$8
readonly
$5
HKEYS
*14
$7
summary
$33
Return all field names of a hash.
$5
since
$5
1.0.0
$5
group
$4
hash
$6
syntax
$9
HKEYS key
$10
complexity
$11
O(N) fields
$6
compat
$4
full
$5
flags
*1
$8
readonly
$4
HLEN
*14
$7
summary
$38
Return the number of fields in a hash.
$5
since
$5
1.0.0
$5
group
$4
hash
$6
syntax
$8
HLEN key
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$8
readonly
$5
HMGET
*14
$7
summary
$42
Return the values of multiple hash fields.
$5
since
$5
1.0.0
$5
group
$4
hash
$6
syntax
$27
HMGET key field [field ...]
$10
complexity
$21
O(M) fields requested
$6
compat
$4
full
$5
flags
*1
$8
readonly
$5
HMSET
*14
$7
summary
$41
Deprecated alias of HSET that replies OK.
$5
since
$5
1.0.0
$5
group
$4
hash
$6
syntax
$39
HMSET key field value [field value ...]
$10
complexity
$10
O(M) pairs
$6
compat
$4
full
$5
flags
*1
$5
write
$8
HPERSIST
*14
$7
summary
$34
Remove per-field TTLs from a hash.
$5
since
$5
1.0.0
$5
group
$4
hash
$6
syntax
$47
HPERSIST key FIELDS numfields field [field ...]
$10
complexity
$11
O(F) fields
$6
compat
$117
differs: silently accepts a stray NX|XX|GT|LT token before FIELDS (it shares HEXPIRE's parser) where Redis rejects it
$5
flags
*1
$5
write
$8
HPEXPIRE
*14
$7
summary
$46
Set per-field TTLs on a hash, in milliseconds.
$5
since
$5
1.0.0
$5
group
$4
hash
$6
syntax
$74
HPEXPIRE key milliseconds [NX|XX|GT|LT] FIELDS numfields field [field ...]
$10
complexity
$11
O(F) fields
$6
compat
$52
differs: same FIELDS error-text deviation as HEXPIRE
$5
flags
*1
$5
write
$10
HPEXPIREAT
*14
$7
summary
$62
Set per-field expiries as absolute Unix-millisecond deadlines.
$5
since
$5
1.0.0
$5
group
$4
hash
$6
syntax
$86
HPEXPIREAT key unix-time-milliseconds [NX|XX|GT|LT] FIELDS numfields field [field ...]
$10
complexity
$11
O(F) fields
$6
compat
$52
differs: same FIELDS error-text deviation as HEXPIRE
$5
flags
*1
$5
write
$5
HSCAN
*14
$7
summary
$57
Iterate a hash's fields and values (single-batch cursor).
$5
since
$5
1.0.0
$5
group
$4
hash
$6
syntax
$46
HSCAN key cursor [MATCH pattern] [COUNT count]
$10
complexity
$59
O(N) — the whole hash is copied and returned in one batch
$6
compat
$166
differs: not a cursor iterator — the cursor is always 0 and the entire hash comes back in a single reply; NOVALUES is not parsed and COUNT is validated then ignored
$5
flags
*1
$8
readonly
$4
HSET
*14
$7
summary
$62
Set one or more hash fields; returns the number of new fields.
$5
since
$5
1.0.0
$5
group
$4
hash
$6
syntax
$38
HSET key field value [field value ...]
$10
complexity
$10
O(M) pairs
$6
compat
$4
full
$5
flags
*1
$5
write
$6
HSETNX
*14
$7
summary
$43
Set a hash field only if it does not exist.
$5
since
$5
1.0.0
$5
group
$4
hash
$6
syntax
$22
HSETNX key field value
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$5
write
$5
HPTTL
*14
$7
summary
$72
Return per-field remaining TTLs in milliseconds (-1 no TTL, -2 missing).
$5
since
$5
4.0.0
$5
group
$4
hash
$6
syntax
$44
HPTTL key FIELDS numfields field [field ...]
$10
complexity
$11
O(F) fields
$6
compat
$88
differs: silently accepts a stray NX|XX|GT|LT token before FIELDS where Redis rejects it
$5
flags
*1
$8
readonly
$4
HTTL
*14
$7
summary
$67
Return per-field remaining TTLs in seconds (-1 no TTL, -2 missing).
$5
since
$5
1.0.0
$5
group
$4
hash
$6
syntax
$43
HTTL key FIELDS numfields field [field ...]
$10
complexity
$11
O(F) fields
$6
compat
$88
differs: silently accepts a stray NX|XX|GT|LT token before FIELDS where Redis rejects it
$5
flags
*1
$8
readonly
$5
HVALS
*14
$7
summary
$28
Return all values of a hash.
$5
since
$5
1.0.0
$5
group
$4
hash
$6
syntax
$9
HVALS key
$10
complexity
$11
O(N) fields
$6
compat
$4
full
$5
flags
*1
$8
readonly
$5
BLPOP
*14
$7
summary
$67
Blocking left pop across one or more lists (effect logged as LPOP).
$5
since
$5
1.0.0
$5
group
$4
list
$6
syntax
$27
BLPOP key [key ...] timeout
$10
complexity
$66
O(1) to serve; the park is O(1) and waiters are woken FIFO per key
$6
compat
$171
differs: on a multi-shard server the multi-key form does not honour Redis's left-to-right key priority — keys on the connection's own shard are served before remote ones
$5
flags
*2
$5
write
$8
blocking
$5
BRPOP
*14
$7
summary
$68
Blocking right pop across one or more lists (effect logged as RPOP).
$5
since
$5
1.0.0
$5
group
$4
list
$6
syntax
$27
BRPOP key [key ...] timeout
$10
complexity
$24
O(1) to serve; FIFO park
$6
compat
$51
differs: same multi-key priority deviation as BLPOP
$5
flags
*2
$5
write
$8
blocking
$10
BRPOPLPUSH
*14
$7
summary
$78
Blocking RPOPLPUSH: pop the source tail and push it onto the destination head.
$5
since
$5
1.0.0
$5
group
$4
list
$6
syntax
$37
BRPOPLPUSH source destination timeout
$10
complexity
$13
O(1) to serve
$6
compat
$236
differs: a cross-shard move is not atomic — the element is popped on the source's shard and pushed on the destination's, and between those two steps it is in neither list. Co-locate the keys with a {hashtag} to get Redis's atomic path
$5
flags
*2
$5
write
$8
blocking
$6
LINDEX
*14
$7
summary
$43
Return the element at the given list index.
$5
since
$5
1.0.0
$5
group
$4
list
$6
syntax
$16
LINDEX key index
$10
complexity
$91
O(1) — the list is a VecDeque, so an index is a direct offset (Redis's quicklist is O(N))
$6
compat
$4
full
$5
flags
*1
$8
readonly
$4
LLEN
*14
$7
summary
$28
Return the length of a list.
$5
since
$5
1.0.0
$5
group
$4
list
$6
syntax
$8
LLEN key
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$8
readonly
$5
LMOVE
*14
$7
summary
$45
Atomically move an element between two lists.
$5
since
$5
1.0.0
$5
group
$4
list
$6
syntax
$46
LMOVE source destination LEFT|RIGHT LEFT|RIGHT
$10
complexity
$4
O(1)
$6
compat
$60
differs: a cross-shard move is not atomic — see BRPOPLPUSH
$5
flags
*1
$5
write
$4
LPOP
*14
$7
summary
$49
Pop one or more elements from the head of a list.
$5
since
$5
1.0.0
$5
group
$4
list
$6
syntax
$16
LPOP key [count]
$10
complexity
$20
O(C) elements popped
$6
compat
$93
differs: LPOP key 0 on an existing key replies a nil array where Redis replies an empty array
$5
flags
*1
$5
write
$4
LPOS
*14
$7
summary
$48
Return the index of matching elements in a list.
$5
since
$5
1.0.0
$5
group
$4
list
$6
syntax
$61
LPOS key element [RANK rank] [COUNT num-matches] [MAXLEN len]
$10
complexity
$132
O(N) always — the whole list is copied before RANK / COUNT / MAXLEN are applied, so MAXLEN bounds the comparisons but not the copy
$6
compat
$4
full
$5
flags
*1
$8
readonly
$5
LPUSH
*14
$7
summary
$39
Prepend one or more elements to a list.
$5
since
$5
1.0.0
$5
group
$4
list
$6
syntax
$31
LPUSH key element [element ...]
$10
complexity
$32
O(M) values, O(1) amortised each
$6
compat
$4
full
$5
flags
*1
$5
write
$6
LRANGE
*14
$7
summary
$32
Return a range of list elements.
$5
since
$5
1.0.0
$5
group
$4
list
$6
syntax
$21
LRANGE key start stop
$10
complexity
$80
O(M) elements returned — the start offset is skipped in O(1) (Redis is O(S+M))
$6
compat
$4
full
$5
flags
*1
$8
readonly
$4
LREM
*14
$7
summary
$53
Remove elements equal to the given value from a list.
$5
since
$5
1.0.0
$5
group
$4
list
$6
syntax
$22
LREM key count element
$10
complexity
$101
O(N*R) worst case — the scan is O(N) but each removal shifts up to half the deque (Redis is O(N+R))
$6
compat
$4
full
$5
flags
*1
$5
write
$7
LINSERT
*14
$7
summary
$50
Insert an element before or after a pivot element.
$5
since
$5
1.0.0
$5
group
$4
list
$6
syntax
$38
LINSERT key BEFORE|AFTER pivot element
$10
complexity
$51
O(N) — the pivot is found by a scan from the head
$6
compat
$4
full
$5
flags
*1
$5
write
$4
LSET
*14
$7
summary
$40
Set the list element at the given index.
$5
since
$5
1.0.0
$5
group
$4
list
$6
syntax
$22
LSET key index element
$10
complexity
$66
O(1) — a direct index write (Redis is O(N) for a mid-list index)
$6
compat
$4
full
$5
flags
*1
$5
write
$5
LTRIM
*14
$7
summary
$31
Trim a list to the given range.
$5
since
$5
1.0.0
$5
group
$4
list
$6
syntax
$20
LTRIM key start stop
$10
complexity
$21
O(R) elements removed
$6
compat
$4
full
$5
flags
*1
$5
write
$4
RPOP
*14
$7
summary
$49
Pop one or more elements from the tail of a list.
$5
since
$5
1.0.0
$5
group
$4
list
$6
syntax
$16
RPOP key [count]
$10
complexity
$20
O(C) elements popped
$6
compat
$93
differs: RPOP key 0 on an existing key replies a nil array where Redis replies an empty array
$5
flags
*1
$5
write
$9
RPOPLPUSH
*14
$7
summary
$58
Pop the source tail and push it onto the destination head.
$5
since
$5
1.0.0
$5
group
$4
list
$6
syntax
$28
RPOPLPUSH source destination
$10
complexity
$4
O(1)
$6
compat
$60
differs: a cross-shard move is not atomic — see BRPOPLPUSH
$5
flags
*1
$5
write
$5
RPUSH
*14
$7
summary
$38
Append one or more elements to a list.
$5
since
$5
1.0.0
$5
group
$4
list
$6
syntax
$31
RPUSH key element [element ...]
$10
complexity
$32
O(M) values, O(1) amortised each
$6
compat
$4
full
$5
flags
*1
$5
write
$4
SADD
*14
$7
summary
$33
Add one or more members to a set.
$5
since
$5
1.0.0
$5
group
$3
set
$6
syntax
$28
SADD key member [member ...]
$10
complexity
$12
O(M) members
$6
compat
$4
full
$5
flags
*1
$5
write
$5
SCARD
*14
$7
summary
$38
Return the number of members in a set.
$5
since
$5
1.0.0
$5
group
$3
set
$6
syntax
$9
SCARD key
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$8
readonly
$5
SDIFF
*14
$7
summary
$61
Return the difference of the given sets (cross-shard gather).
$5
since
$5
1.0.0
$5
group
$3
set
$6
syntax
$19
SDIFF key [key ...]
$10
complexity
$34
O(sum of the source cardinalities)
$6
compat
$4
full
$5
flags
*1
$8
readonly
$10
SDIFFSTORE
*14
$7
summary
$56
Store the difference of the given sets into destination.
$5
since
$5
1.0.0
$5
group
$3
set
$6
syntax
$36
SDIFFSTORE destination key [key ...]
$10
complexity
$88
O(sum of the source cardinalities) + O(result) to write the destination on its own shard
$6
compat
$4
full
$5
flags
*1
$5
write
$6
SINTER
*14
$7
summary
$63
Return the intersection of the given sets (cross-shard gather).
$5
since
$5
1.0.0
$5
group
$3
set
$6
syntax
$20
SINTER key [key ...]
$10
complexity
$143
O(sum of the source cardinalities) — there is NO smallest-set-first ordering, so SINTER huge tiny costs O(huge) where Redis costs O(tiny * k)
$6
compat
$4
full
$5
flags
*1
$8
readonly
$11
SINTERSTORE
*14
$7
summary
$58
Store the intersection of the given sets into destination.
$5
since
$5
1.0.0
$5
group
$3
set
$6
syntax
$37
SINTERSTORE destination key [key ...]
$10
complexity
$80
O(sum of the source cardinalities) + O(result); same no-smallest-first algorithm
$6
compat
$4
full
$5
flags
*1
$5
write
$9
SISMEMBER
*14
$7
summary
$43
Check whether a value is a member of a set.
$5
since
$5
1.0.0
$5
group
$3
set
$6
syntax
$20
SISMEMBER key member
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$8
readonly
$8
SMEMBERS
*14
$7
summary
$28
Return all members of a set.
$5
since
$5
1.0.0
$5
group
$3
set
$6
syntax
$12
SMEMBERS key
$10
complexity
$12
O(N) members
$6
compat
$4
full
$5
flags
*1
$8
readonly
$4
SPOP
*14
$7
summary
$54
Remove and return one or more random members of a set.
$5
since
$5
1.0.0
$5
group
$3
set
$6
syntax
$16
SPOP key [count]
$10
complexity
$101
O(count) expected — each member is drawn by probing a random slot and taking the first occupied one
$6
compat
$4
full
$5
flags
*1
$5
write
$11
SRANDMEMBER
*14
$7
summary
$98
Return one or more random members of a set without removing them. A negative count allows repeats.
$5
since
$5
1.0.0
$5
group
$3
set
$6
syntax
$23
SRANDMEMBER key [count]
$10
complexity
$176
O(count) expected when count is a small fraction of the set (random-slot probing); O(N) once count exceeds a quarter of it, where copying and shuffling beats rejection sampling
$6
compat
$4
full
$5
flags
*1
$8
readonly
$4
SREM
*14
$7
summary
$38
Remove one or more members from a set.
$5
since
$5
1.0.0
$5
group
$3
set
$6
syntax
$28
SREM key member [member ...]
$10
complexity
$12
O(M) members
$6
compat
$4
full
$5
flags
*1
$5
write
$5
SSCAN
*14
$7
summary
$46
Iterate a set's members (single-batch cursor).
$5
since
$5
1.0.0
$5
group
$3
set
$6
syntax
$46
SSCAN key cursor [MATCH pattern] [COUNT count]
$10
complexity
$58
O(N) — the whole set is copied and returned in one batch
$6
compat
$133
differs: not a cursor iterator — the cursor is always 0 and the entire set comes back in one reply; COUNT is validated then ignored
$5
flags
*1
$8
readonly
$6
SUNION
*14
$7
summary
$56
Return the union of the given sets (cross-shard gather).
$5
since
$5
1.0.0
$5
group
$3
set
$6
syntax
$20
SUNION key [key ...]
$10
complexity
$34
O(sum of the source cardinalities)
$6
compat
$4
full
$5
flags
*1
$8
readonly
$11
SUNIONSTORE
*14
$7
summary
$51
Store the union of the given sets into destination.
$5
since
$5
1.0.0
$5
group
$3
set
$6
syntax
$37
SUNIONSTORE destination key [key ...]
$10
complexity
$46
O(sum of the source cardinalities) + O(result)
$6
compat
$4
full
$5
flags
*1
$5
write
$8
BZPOPMIN
*14
$7
summary
$72
Blocking pop of the lowest-scored member across one or more sorted sets.
$5
since
$5
1.0.0
$5
group
$4
zset
$6
syntax
$30
BZPOPMIN key [key ...] timeout
$10
complexity
$34
O(log N) per pop; the park is O(1)
$6
compat
$4
full
$5
flags
*2
$5
write
$8
blocking
$4
ZADD
*14
$7
summary
$64
Add members with scores to a sorted set, with conditional flags.
$5
since
$5
1.0.0
$5
group
$4
zset
$6
syntax
$68
ZADD key [NX|XX] [GT|LT] [CH] [INCR] score member [score member ...]
$10
complexity
$68
O(M log N) — O(1) hash insert plus O(log N) tree insert per member
$6
compat
$4
full
$5
flags
*1
$5
write
$5
ZCARD
*14
$7
summary
$45
Return the number of members in a sorted set.
$5
since
$5
1.0.0
$5
group
$4
zset
$6
syntax
$9
ZCARD key
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$8
readonly
$6
ZCOUNT
*14
$7
summary
$50
Count members with scores within the given bounds.
$5
since
$5
1.0.0
$5
group
$4
zset
$6
syntax
$18
ZCOUNT key min max
$10
complexity
$102
O(log N) — two rank descents on the order-statistic tree bracket the score range; nothing is scanned
$6
compat
$4
full
$5
flags
*1
$8
readonly
$10
ZDIFFSTORE
*14
$7
summary
$63
Store the difference of the given sorted sets into destination.
$5
since
$5
1.0.0
$5
group
$4
zset
$6
syntax
$44
ZDIFFSTORE destination numkeys key [key ...]
$10
complexity
$93
O(sum of the source cardinalities + R log R); each source is extracted whole on its own shard
$6
compat
$4
full
$5
flags
*1
$5
write
$7
ZINCRBY
*14
$7
summary
$43
Increment a member's score in a sorted set.
$5
since
$5
1.0.0
$5
group
$4
zset
$6
syntax
$28
ZINCRBY key increment member
$10
complexity
$8
O(log N)
$6
compat
$4
full
$5
flags
*1
$5
write
$10
ZINTERCARD
*14
$7
summary
$68
Return the cardinality of the intersection of the given sorted sets.
$5
since
$5
1.0.0
$5
group
$4
zset
$6
syntax
$46
ZINTERCARD numkeys key [key ...] [LIMIT limit]
$10
complexity
$96
O(sum of the source cardinalities) — LIMIT does not short-circuit the gather, only the combine
$6
compat
$4
full
$5
flags
*1
$8
readonly
$11
ZINTERSTORE
*14
$7
summary
$65
Store the intersection of the given sorted sets into destination.
$5
since
$5
1.0.0
$5
group
$4
zset
$6
syntax
$99
ZINTERSTORE destination numkeys key [key ...] [WEIGHTS weight [weight ...]] [AGGREGATE SUM|MIN|MAX]
$10
complexity
$44
O(sum of the source cardinalities + R log R)
$6
compat
$4
full
$5
flags
*1
$5
write
$7
ZPOPMIN
*14
$7
summary
$47
Pop up to count members with the lowest scores.
$5
since
$5
1.0.0
$5
group
$4
zset
$6
syntax
$19
ZPOPMIN key [count]
$10
complexity
$10
O(M log N)
$6
compat
$4
full
$5
flags
*1
$5
write
$13
ZPOPMIN.BELOW
*14
$7
summary
$111
kevy extension: pop up to count lowest members with score strictly below the threshold (delayed-job primitive).
$5
since
$5
3.0.0
$5
group
$4
zset
$6
syntax
$31
ZPOPMIN.BELOW key below [count]
$10
complexity
$115
O(M log N) — take_while stops at the first score at or above the threshold, so it never walks past the due prefix
$6
compat
$72
kevy-only: a delayed-job primitive (score = due time); no Redis analogue
$5
flags
*2
$5
write
$9
extension
$6
ZRANGE
*14
$7
summary
$29
Return members by rank range.
$5
since
$5
1.0.0
$5
group
$4
zset
$6
syntax
$34
ZRANGE key start stop [WITHSCORES]
$10
complexity
$89
O(log N + M) — one rank descent seeks to start, then the M requested members are walked
$6
compat
$148
differs: only the legacy 'key start stop [WITHSCORES]' form is accepted — the Redis 6.2 BYSCORE / BYLEX / REV / LIMIT arguments are a syntax error
$5
flags
*1
$8
readonly
$13
ZRANGEBYSCORE
*14
$7
summary
$51
Return members with scores within the given bounds.
$5
since
$5
1.0.0
$5
group
$4
zset
$6
syntax
$59
ZRANGEBYSCORE key min max [WITHSCORES] [LIMIT offset count]
$10
complexity
$199
O(log N + M) — a rank descent seeks to the score bound, then only the M in-range members are walked; LIMIT is still applied after the match set is materialised, so it bounds the reply, not the walk
$6
compat
$4
full
$5
flags
*1
$8
readonly
$5
ZRANK
*14
$7
summary
$54
Return a member's rank, ordered from the lowest score.
$5
since
$5
1.0.0
$5
group
$4
zset
$6
syntax
$16
ZRANK key member
$10
complexity
$101
O(log N) — a hash lookup for the score, then one descent of the rank-augmented (score, member) tree
$6
compat
$56
differs: the Redis 7.2 WITHSCORE option is not supported
$5
flags
*1
$8
readonly
$4
ZREM
*14
$7
summary
$45
Remove one or more members from a sorted set.
$5
since
$5
1.0.0
$5
group
$4
zset
$6
syntax
$28
ZREM key member [member ...]
$10
complexity
$10
O(M log N)
$6
compat
$4
full
$5
flags
*1
$5
write
$15
ZREMRANGEBYRANK
*14
$7
summary
$43
Remove members within the given rank range.
$5
since
$5
1.0.0
$5
group
$4
zset
$6
syntax
$30
ZREMRANGEBYRANK key start stop
$10
complexity
$75
O(log N + M log N) — a rank descent seeks to start, then M member deletes
$6
compat
$4
full
$5
flags
*1
$5
write
$16
ZREMRANGEBYSCORE
*14
$7
summary
$51
Remove members with scores within the given bounds.
$5
since
$5
1.0.0
$5
group
$4
zset
$6
syntax
$28
ZREMRANGEBYSCORE key min max
$10
complexity
$63
O(log N + M log N) — a seek finds the hit set, then M deletes
$6
compat
$4
full
$5
flags
*1
$5
write
$16
ZREVRANGEBYSCORE
*14
$7
summary
$66
Return members with scores within the given bounds, highest first.
$5
since
$5
1.0.0
$5
group
$4
zset
$6
syntax
$62
ZREVRANGEBYSCORE key max min [WITHSCORES] [LIMIT offset count]
$10
complexity
$84
O(log N + M) — a seeked forward walk of the M matches, then the result is reversed
$6
compat
$4
full
$5
flags
*1
$8
readonly
$9
ZREVRANGE
*14
$7
summary
$50
Return members by rank range, highest score first.
$5
since
$5
1.0.0
$5
group
$4
zset
$6
syntax
$37
ZREVRANGE key start stop [WITHSCORES]
$10
complexity
$95
O(N + M) — the set is read in rank order and reversed, then the M requested members are taken
$6
compat
$4
full
$5
flags
*1
$8
readonly
$5
ZSCAN
*14
$7
summary
$64
Iterate a sorted set's members and scores (single-batch cursor).
$5
since
$5
1.0.0
$5
group
$4
zset
$6
syntax
$46
ZSCAN key cursor [MATCH pattern] [COUNT count]
$10
complexity
$38
O(N) — the whole set is materialised
$6
compat
$115
differs: not a cursor iterator — every call returns the whole set with cursor 0, and COUNT is parsed then ignored
$5
flags
*1
$8
readonly
$6
ZSCORE
*14
$7
summary
$24
Return a member's score.
$5
since
$5
1.0.0
$5
group
$4
zset
$6
syntax
$17
ZSCORE key member
$10
complexity
$22
O(1) — a hash lookup
$6
compat
$4
full
$5
flags
*1
$8
readonly
$11
ZUNIONSTORE
*14
$7
summary
$58
Store the union of the given sorted sets into destination.
$5
since
$5
1.0.0
$5
group
$4
zset
$6
syntax
$99
ZUNIONSTORE destination numkeys key [key ...] [WEIGHTS weight [weight ...]] [AGGREGATE SUM|MIN|MAX]
$10
complexity
$44
O(sum of the source cardinalities + R log R)
$6
compat
$4
full
$5
flags
*1
$5
write
$4
XACK
*14
$7
summary
$49
Acknowledge pending entries for a consumer group.
$5
since
$5
1.0.0
$5
group
$6
stream
$6
syntax
$26
XACK key group id [id ...]
$10
complexity
$10
O(A log P)
$6
compat
$4
full
$5
flags
*1
$5
write
$4
XADD
*14
$7
summary
$48
Append an entry to a stream, with optional trim.
$5
since
$5
1.0.0
$5
group
$6
stream
$6
syntax
$101
XADD key [NOMKSTREAM] [MAXLEN|MINID [=|~] threshold [LIMIT count]] id|* field value [field value ...]
$10
complexity
$126
O(log N) to insert; O(N*F) whenever a MAXLEN / MINID clause actually evicts, because the trim triggers a full weight recompute
$6
compat
$374
differs: answers as valkey 9.1 does, an approximate '~' trim included: it removes only whole nodes of the stream's layout (at most 100 entries or 4 KB of fields each, the fixed stream-node-max-entries / stream-node-max-bytes defaults), up to LIMIT entries (10000 unless given, 0 for no limit); Redis 8.10's KEEPREF / DELREF / ACKED and IDMP / IDMPAUTO options are not parsed
$5
flags
*1
$5
write
$10
XAUTOCLAIM
*14
$7
summary
$59
Scan and claim idle pending entries starting from a cursor.
$5
since
$5
1.0.0
$5
group
$6
stream
$6
syntax
$72
XAUTOCLAIM key group consumer min-idle-time start [COUNT count] [JUSTID]
$10
complexity
$81
O(log P + COUNT log N): at most COUNT x 10 pending entries are looked at per call
$6
compat
$4
full
$5
flags
*1
$5
write
$6
XCLAIM
*14
$7
summary
$51
Claim specific idle pending entries for a consumer.
$5
since
$5
1.0.0
$5
group
$6
stream
$6
syntax
$143
XCLAIM key group consumer min-idle-time id [id ...] [IDLE ms] [TIME unix-time-milliseconds] [RETRYCOUNT count] [FORCE] [JUSTID] [LASTID lastid]
$10
complexity
$22
O(A * (log P + log N))
$6
compat
$4
full
$5
flags
*1
$5
write
$4
XDEL
*14
$7
summary
$35
Delete entries from a stream by ID.
$5
since
$5
1.0.0
$5
group
$6
stream
$6
syntax
$20
XDEL key id [id ...]
$10
complexity
$100
O(D log N + N*F) for D ids — NOT O(1): the trailing weight recompute is linear in the whole stream
$6
compat
$4
full
$5
flags
*1
$5
write
$6
XGROUP
*14
$7
summary
$30
Manage stream consumer groups.
$5
since
$5
1.0.0
$5
group
$6
stream
$6
syntax
$212
XGROUP CREATE key group id|$ [MKSTREAM] [ENTRIESREAD entries-read] | DESTROY key group | SETID key group id|$ [ENTRIESREAD entries-read] | CREATECONSUMER key group consumer | DELCONSUMER key group consumer | HELP
$10
complexity
$94
CREATE / DESTROY: O(1) plus an O(N*F) reweigh. SETID / CREATECONSUMER: O(1). DELCONSUMER: O(P)
$6
compat
$4
full
$5
flags
*1
$5
write
$5
XINFO
*14
$7
summary
$50
Introspect a stream, its groups, or its consumers.
$5
since
$5
1.0.0
$5
group
$6
stream
$6
syntax
$79
XINFO STREAM key [FULL [COUNT count]] | GROUPS key | CONSUMERS key group | HELP
$10
complexity
$266
STREAM: O(log N). GROUPS: O(G log N + G log G) — 'lag' reads the stream's head once per group, and the groups are sorted by name. CONSUMERS: O(C log C), sorted by name. STREAM FULL: O(K + G * (P log C + C log C)) for K entries shown and P pending entries per group
$6
compat
$495
differs: answers field for field as valkey 9.1 does; against Redis 8.10, XINFO STREAM lacks the six idmp-* / pids-* / iids-* fields of an XADD option kevy does not have, radix-tree-keys and radix-tree-nodes are the nodes and tree nodes valkey's layout would hold for the same history (kevy keeps no radix tree), and where the two disagree on 'lag' and 'entries-read' — an ENTRIESREAD above entries-added, a group before the first entry with a deletion behind it — kevy answers as valkey does
$5
flags
*1
$8
readonly
$4
XLEN
*14
$7
summary
$41
Return the number of entries in a stream.
$5
since
$5
1.0.0
$5
group
$6
stream
$6
syntax
$8
XLEN key
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$8
readonly
$8
XPENDING
*14
$7
summary
$71
Inspect pending entries of a consumer group (summary or extended form).
$5
since
$5
1.0.0
$5
group
$6
stream
$6
syntax
$68
XPENDING key group [[IDLE min-idle-time] start end count [consumer]]
$10
complexity
$126
summary: O(P*C + C log C) — the per-consumer tally is a linear find per PEL row, then sorted by name. extended: O(log P + K)
$6
compat
$142
differs: answers as valkey 9.1 does, except that a delivery count stops at 9223372036854775807 where valkey's wraps round to a negative number
$5
flags
*1
$8
readonly
$6
XRANGE
*14
$7
summary
$41
Return stream entries within an ID range.
$5
since
$5
1.0.0
$5
group
$6
stream
$6
syntax
$34
XRANGE key start end [COUNT count]
$10
complexity
$61
O(log N + M) — a B-tree range descent, COUNT applied lazily
$6
compat
$4
full
$5
flags
*1
$8
readonly
$5
XREAD
*14
$7
summary
$63
Read new entries from one or more streams, optionally blocking.
$5
since
$5
1.0.0
$5
group
$6
stream
$6
syntax
$74
XREAD [COUNT count] [BLOCK milliseconds] STREAMS key [key ...] id [id ...]
$10
complexity
$64
O(S * (log N + M)) over S streams; '$' is O(1); the park is O(1)
$6
compat
$107
differs: answers as valkey 9.1 does; Redis 8.10's unbalanced-streams error also names '+' as an accepted ID
$5
flags
*2
$8
readonly
$8
blocking
$10
XREADGROUP
*14
$7
summary
$68
Read stream entries as a consumer-group member, optionally blocking.
$5
since
$5
1.0.0
$5
group
$6
stream
$6
syntax
$108
XREADGROUP GROUP group consumer [COUNT count] [BLOCK milliseconds] [NOACK] STREAMS key [key ...] id [id ...]
$10
complexity
$119
'>' form: O(log N + M log P) for M entries handed out. History form: O(log P + K log N) for K entries handed back again
$6
compat
$4
full
$5
flags
*2
$5
write
$8
blocking
$9
XREVRANGE
*14
$7
summary
$59
Return stream entries within an ID range, in reverse order.
$5
since
$5
1.0.0
$5
group
$6
stream
$6
syntax
$37
XREVRANGE key end start [COUNT count]
$10
complexity
$12
O(log N + M)
$6
compat
$4
full
$5
flags
*1
$8
readonly
$6
XSETID
*14
$7
summary
$64
Overwrite a stream's last-generated ID and bookkeeping counters.
$5
since
$5
1.0.0
$5
group
$6
stream
$6
syntax
$77
XSETID key last-id [ENTRIESADDED entries-added] [MAXDELETEDID max-deleted-id]
$10
complexity
$8
O(log N)
$6
compat
$4
full
$5
flags
*1
$5
write
$5
XTRIM
*14
$7
summary
$38
Trim a stream by length or minimum ID.
$5
since
$5
1.0.0
$5
group
$6
stream
$6
syntax
$52
XTRIM key MAXLEN|MINID [=|~] threshold [LIMIT count]
$10
complexity
$38
O(R log N + N*F) for R evicted entries
$6
compat
$163
differs: answers as valkey 9.1 does, an approximate '~' trim removing only whole nodes as XADD's does; Redis 8.10's KEEPREF / DELREF / ACKED options are not parsed
$5
flags
*1
$5
write
$6
GEOADD
*14
$7
summary
$57
Add geospatial members (longitude/latitude) to a geo set.
$5
since
$5
1.0.0
$5
group
$3
geo
$6
syntax
$81
GEOADD key [NX|XX] [CH] longitude latitude member [longitude latitude member ...]
$10
complexity
$34
O(M log N); CH adds an O(M^2) term
$6
compat
$4
full
$5
flags
*1
$5
write
$7
GEODIST
*14
$7
summary
$44
Return the distance between two geo members.
$5
since
$5
1.0.0
$5
group
$3
geo
$6
syntax
$40
GEODIST key member1 member2 [m|km|mi|ft]
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$8
readonly
$7
GEOHASH
*14
$7
summary
$48
Return the base32 geohash string of each member.
$5
since
$5
1.0.0
$5
group
$3
geo
$6
syntax
$31
GEOHASH key member [member ...]
$10
complexity
$4
O(M)
$6
compat
$4
full
$5
flags
*1
$8
readonly
$6
GEOPOS
*14
$7
summary
$45
Return the longitude/latitude of each member.
$5
since
$5
1.0.0
$5
group
$3
geo
$6
syntax
$30
GEOPOS key member [member ...]
$10
complexity
$4
O(M)
$6
compat
$4
full
$5
flags
*1
$8
readonly
$9
GEORADIUS
*14
$7
summary
$69
Legacy radius search around a coordinate, with optional STORE writes.
$5
since
$5
1.0.0
$5
group
$3
geo
$6
syntax
$143
GEORADIUS key longitude latitude radius m|km|mi|ft [WITHCOORD] [WITHDIST] [WITHHASH] [COUNT count [ANY]] [ASC|DESC] [STORE key] [STOREDIST key]
$10
complexity
$196
O(log N + C) — up to nine neighbour cell ranges, each seeked on the score tree; C = members inside the matched cells. STORE / STOREDIST add O(K log K) to write plus O(D) to clear the destination
$6
compat
$108
differs: the destination is written on its own shard, so a STORE across shards is not atomic with the search
$5
flags
*1
$5
write
$17
GEORADIUSBYMEMBER
*14
$7
summary
$75
Legacy radius search around an existing member, with optional STORE writes.
$5
since
$5
1.0.0
$5
group
$3
geo
$6
syntax
$139
GEORADIUSBYMEMBER key member radius m|km|mi|ft [WITHCOORD] [WITHDIST] [WITHHASH] [COUNT count [ANY]] [ASC|DESC] [STORE key] [STOREDIST key]
$10
complexity
$89
O(log N + C) — the seeked nine-cell fetch, same as GEORADIUS; the anchor lookup is O(1)
$6
compat
$108
differs: the destination is written on its own shard, so a STORE across shards is not atomic with the search
$5
flags
*1
$5
write
$9
GEOSEARCH
*14
$7
summary
$66
Search members within a radius or box from a member or coordinate.
$5
since
$5
1.0.0
$5
group
$3
geo
$6
syntax
$183
GEOSEARCH key FROMMEMBER member|FROMLONLAT longitude latitude BYRADIUS radius m|km|mi|ft|BYBOX width height m|km|mi|ft [ASC|DESC] [COUNT count [ANY]] [WITHCOORD] [WITHDIST] [WITHHASH]
$10
complexity
$197
O(log N + C) — up to nine neighbour ranges, each a seeked slice of the score tree; C = members inside the matched geohash cells (the block bound now prunes iteration too, not just distance maths)
$6
compat
$85
differs: STOREDIST is accepted and ignored on the read-only form; COUNT 0 is an error
$5
flags
*1
$8
readonly
$14
GEOSEARCHSTORE
*14
$7
summary
$60
Run GEOSEARCH on source and store the hits into destination.
$5
since
$5
1.0.0
$5
group
$3
geo
$6
syntax
$181
GEOSEARCHSTORE destination source FROMMEMBER member|FROMLONLAT longitude latitude BYRADIUS radius m|km|mi|ft|BYBOX width height m|km|mi|ft [ASC|DESC] [COUNT count [ANY]] [STOREDIST]
$10
complexity
$87
O(log N + C) to search, plus O(D + K log K) to rewrite the destination on its own shard
$6
compat
$238
differs: STOREDIST stores the distance in the unit the query asked for (Redis does the same); the destination is written on its own shard, so the source and destination may live on different cores and the write is not atomic with the read
$5
flags
*1
$5
write
$4
ECHO
*14
$7
summary
$25
Return the given message.
$5
since
$5
1.0.0
$5
group
$10
connection
$6
syntax
$12
ECHO message
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$8
readonly
$5
HELLO
*14
$7
summary
$72
Handshake: report server info and switch RESP protocol version (2 or 3).
$5
since
$5
1.0.0
$5
group
$10
connection
$6
syntax
$16
HELLO [protover]
$10
complexity
$4
O(1)
$6
compat
$168
differs: only HELLO [2|3] is honoured — the AUTH and SETNAME tails are parsed off and ignored, because kevy has no AUTH and this form does not set the connection name
$5
flags
*1
$8
readonly
$4
PING
*14
$7
summary
$61
Ping the server; returns PONG or echoes the optional message.
$5
since
$5
1.0.0
$5
group
$10
connection
$6
syntax
$14
PING [message]
$10
complexity
$4
O(1)
$6
compat
$164
differs: kevy has no RESP2 subscriber mode, so PING while subscribed does not switch to the array form and non-pubsub commands stay legal on a subscribed connection
$5
flags
*1
$8
readonly
$4
QUIT
*14
$7
summary
$39
Close the connection after replying OK.
$5
since
$5
1.0.0
$5
group
$10
connection
$6
syntax
$4
QUIT
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$8
readonly
$6
SELECT
*14
$7
summary
$72
Select the logical database; kevy is single-DB and only accepts index 0.
$5
since
$5
1.0.0
$5
group
$10
connection
$6
syntax
$12
SELECT index
$10
complexity
$4
O(1)
$6
compat
$82
differs: kevy is single-DB — SELECT 0 replies OK and any other index is an error
$5
flags
*1
$8
readonly
$12
BGREWRITEAOF
*14
$7
summary
$52
Start an append-only-file rewrite in the background.
$5
since
$5
1.0.0
$5
group
$6
server
$6
syntax
$12
BGREWRITEAOF
$10
complexity
$102
O(S) fan-out; each shard freezes a copy-on-write view and hands serialise plus fsync to its own worker
$6
compat
$123
differs: replies +OK rather than Redis's status line, rewrites one AOF per shard, and replies +OK even when AOF is disabled
$5
flags
*2
$5
write
$5
admin
$6
BGSAVE
*14
$7
summary
$40
Start a snapshot save in the background.
$5
since
$5
1.0.0
$5
group
$6
server
$6
syntax
$6
BGSAVE
$10
complexity
$93
O(S) fan-out; O(N/S) copy-on-write freeze per shard on the reactor, then serialise off-thread
$6
compat
$83
differs: replies +OK rather than Redis's status line, and writes one dump per shard
$5
flags
*2
$5
write
$5
admin
$4
TIME
*14
$7
summary
$57
Return the server clock as unix seconds and microseconds.
$5
since
$5
1.0.0
$5
group
$6
server
$6
syntax
$4
TIME
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*1
$8
readonly
$7
COMMAND
*14
$7
summary
$67
Introspect the command table (COUNT, LIST, INFO, DOCS subcommands).
$5
since
$5
1.0.0
$5
group
$6
server
$6
syntax
$82
COMMAND [COUNT | LIST | INFO command [command ...] | DOCS [command [command ...]]]
$10
complexity
$109
bare / LIST / DOCS: O(V) verbs. COUNT: O(1). INFO / DOCS with k names: O(k*V) — the lookup is a linear scan
$6
compat
$179
differs: COUNT / LIST / INFO / DOCS only — GETKEYS and GETKEYSANDFLAGS are absent, and the info rows hard-code first/last/step and leave ACL categories, tips and key-specs empty
$5
flags
*1
$8
readonly
$6
CONFIG
*14
$7
summary
$47
Read or change server configuration parameters.
$5
since
$5
1.0.0
$5
group
$6
server
$6
syntax
$64
CONFIG GET parameter | SET parameter value | REWRITE | RESETSTAT
$10
complexity
$122
GET: O(patterns * 16). SET: O(1) plus one config swap that shards pick up on their next tick. REWRITE: O(config file size)
$6
compat
$258
differs: 16 Redis-named parameters exist; only maxmemory, maxmemory-policy, appendfsync, the auto-rewrite pair, hz, maxmemory-samples, loglevel and logfile are hot-settable — bind, port, io-threads, dir and appendonly error at runtime; RESETSTAT is a no-op
$5
flags
*2
$5
write
$5
admin
$6
CLIENT
*14
$7
summary
$49
Connection introspection and control subcommands.
$5
since
$5
1.0.0
$5
group
$6
server
$6
syntax
$80
CLIENT ID | GETNAME | SETNAME name | LIST | KILL filter | INFO | NO-EVICT ON|OFF
$10
complexity
$91
ID / GETNAME / SETNAME / INFO: O(1). LIST: O(S) fan-out + O(C) rows. KILL: O(S) + O(C) scan
$6
compat
$213
differs: ID / GETNAME / SETNAME / INFO / LIST (bare) / KILL (ID, ADDR) / NO-EVICT only; CLIENT LIST with a filter is a syntax error and every other subcommand (PAUSE, REPLY, TRACKING, UNBLOCK, NO-TOUCH) is unknown
$5
flags
*2
$8
readonly
$5
admin
$7
CLUSTER
*14
$7
summary
$64
Cluster topology introspection (virtual-node model over shards).
$5
since
$5
1.0.0
$5
group
$6
server
$6
syntax
$74
CLUSTER INFO | NODES | SLOTS | SHARDS | KEYSLOT key | COUNTKEYSINSLOT slot
$10
complexity
$89
INFO / NODES / SLOTS / SHARDS / MYID: O(S). KEYSLOT: O(len(key)). COUNTKEYSINSLOT: O(N/S)
$6
compat
$255
differs: a read-only virtual-node topology derived from config (one virtual master per shard) — no gossip, no MEET / FORGET / SETSLOT effect (they reply OK as no-ops), no MIGRATE / ASK, no failover; COUNTKEYSINSLOT counts only the answering shard's keys
$5
flags
*2
$8
readonly
$5
admin
$6
DBSIZE
*14
$7
summary
$44
Return the number of keys across all shards.
$5
since
$5
1.0.0
$5
group
$6
server
$6
syntax
$6
DBSIZE
$10
complexity
$81
O(S) — one message per shard, each answering O(1) from its map length; NOT O(N)
$6
compat
$4
full
$5
flags
*1
$8
readonly
$5
DEBUG
*14
$7
summary
$81
Debug subcommands; SLEEP blocks the shard, other subcommands are tolerated as OK.
$5
since
$5
1.0.0
$5
group
$6
server
$6
syntax
$43
DEBUG SLEEP seconds | subcommand [args ...]
$10
complexity
$117
SLEEP: parks the ANSWERING shard's reactor thread for the duration (other shards keep serving). Everything else: O(1)
$6
compat
$167
differs: SLEEP is the only subcommand with an effect and it blocks one shard, not the server; every other subcommand is accepted and answered OK without doing anything
$5
flags
*2
$8
readonly
$5
admin
$8
FLUSHALL
*14
$7
summary
$32
Delete every key on every shard.
$5
since
$5
1.0.0
$5
group
$6
server
$6
syntax
$8
FLUSHALL
$10
complexity
$88
O(S) fan-out; per shard O(N/S) clear plus WATCH invalidation plus a feed-generation bump
$6
compat
$169
differs: ASYNC / SYNC are accepted and ignored (the flush is always synchronous per shard), and it bumps the CDC feed generation, so live FEED cursors get a resync error
$5
flags
*1
$5
write
$7
FLUSHDB
*14
$7
summary
$79
Delete every key of the current database (kevy is single-DB: same as FLUSHALL).
$5
since
$5
1.0.0
$5
group
$6
server
$6
syntax
$7
FLUSHDB
$10
complexity
$34
O(N + S) — identical to FLUSHALL
$6
compat
$88
differs: kevy is single-DB, so FLUSHDB is an alias of FLUSHALL; ASYNC / SYNC are ignored
$5
flags
*1
$5
write
$4
INFO
*14
$7
summary
$53
Report server statistics and status sections as text.
$5
since
$5
1.0.0
$5
group
$6
server
$6
syntax
$14
INFO [section]
$10
complexity
$76
O(1) in the keyspace — it never walks it; O(S) to sum the per-shard gauges
$6
compat
$271
differs: 8 sections only (server, clients, memory, persistence, stats, replication, cluster, keyspace) — no commandstats / latencystats / errorstats / cpu; reports redis_version 7.4.0 for client sniffing plus a kevy_version line, and the values are up to one tick stale
$5
flags
*1
$8
readonly
$6
MEMORY
*14
$7
summary
$33
Memory introspection subcommands.
$5
since
$5
1.0.0
$5
group
$6
server
$6
syntax
$72
MEMORY USAGE key [SAMPLES count] | STATS | DOCTOR | PURGE | MALLOC-STATS
$10
complexity
$95
USAGE: O(1) — the accounting is exact, not sampled. STATS: O(1) from the instance-wide gauges
$6
compat
$204
differs: USAGE's SAMPLES count is parsed and ignored (our accounting is exact); PURGE is a no-op (system allocator, no arena); DOCTOR and MALLOC-STATS return canned strings; STATS is a trimmed 8-field set
$5
flags
*1
$8
readonly
$4
SAVE
*14
$7
summary
$43
Synchronously snapshot the dataset to disk.
$5
since
$5
1.0.0
$5
group
$6
server
$6
syntax
$4
SAVE
$10
complexity
$51
O(S) fan-out; O(N/S) copy-on-write freeze per shard
$6
compat
$187
differs: SAVE is no longer synchronous-until-durable — it freezes a copy-on-write view and replies OK immediately, so 'SAVE returned, therefore the dump is safe to copy' no longer holds
$5
flags
*2
$5
write
$5
admin
$8
SHUTDOWN
*14
$7
summary
$59
Stop the server process (connection drops without a reply).
$5
since
$5
1.0.0
$5
group
$6
server
$6
syntax
$22
SHUTDOWN [NOSAVE|SAVE]
$10
complexity
$58
O(1) to trip the stop flag; the drain that follows is O(N)
$6
compat
$87
differs: only SHUTDOWN [NOSAVE|SAVE] parses — NOW, FORCE and ABORT are a syntax error
$5
flags
*2
$5
write
$5
admin
$7
SLOWLOG
*14
$7
summary
$38
Inspect or reset the slow-command log.
$5
since
$5
1.0.0
$5
group
$6
server
$6
syntax
$40
SLOWLOG GET [count] | LEN | RESET | HELP
$10
complexity
$66
GET: O(S) fan-out plus O(L log L) to merge. LEN: O(S). RESET: O(S)
$6
compat
$167
differs: the log is per-shard and GET merges across shards by timestamp, so ids are not globally monotonic; every entry's client-addr and client-name are empty strings
$5
flags
*2
$8
readonly
$5
admin
$8
FAILOVER
*14
$7
summary
$108
Planned zero-loss handover: quiesce writes, wait for the target replica to drain, promote it, and follow it.
$5
since
$5
3.0.0
$5
group
$11
replication
$6
syntax
$39
FAILOVER host port [TIMEOUT ms] | ABORT
$10
complexity
$101
O(1) at the command — the handover runs in the background, polling the target until it is caught up
$6
compat
$245
differs: Redis's syntax is FAILOVER [TO host port [FORCE]] [ABORT] [TIMEOUT ms] with an optional target; kevy's is FAILOVER host port [TIMEOUT ms] | ABORT — the target is mandatory and positional, and the port given is the target's client port
$5
flags
*2
$5
write
$5
admin
$10
REPL.TOKEN
*14
$7
summary
$159
kevy extension: mint a read-your-writes token — per-shard [generation, offset] pairs (a primary reports its live feed tail; a replica its applied positions).
$5
since
$5
3.0.0
$5
group
$11
replication
$6
syntax
$10
REPL.TOKEN
$10
complexity
$48
O(S) — one (generation, offset) pair per shard
$6
compat
$129
kevy-only: the read-your-writes token; the nearest Redis concept is master_repl_offset, which is not a resumable per-shard cursor
$5
flags
*2
$8
readonly
$9
extension
$9
REPL.WAIT
*14
$7
summary
$274
kevy extension: on a replica, block until every shard has applied the given REPL.TOKEN (then reads are read-your-writes); +OK on success, -MISDIRECTED writer is <primary> on timeout or generation mismatch. Default TIMEOUT 1000 ms, hard cap 60 s. On a primary: immediate +OK.
$5
since
$5
3.0.0
$5
group
$11
replication
$6
syntax
$60
REPL.WAIT gen offset [gen offset ...] [TIMEOUT milliseconds]
$10
complexity
$134
O(S) — a barrier, not a keyspace op; the wall-clock cost is the replication lag, bounded by TIMEOUT (default 1s, hard-capped at 60s)
$6
compat
$133
kevy-only: waits until a (generation, offset) token has been applied, which is what makes read-your-writes possible across a failover
$5
flags
*3
$8
readonly
$8
blocking
$9
extension
$9
REPLICAOF
*14
$7
summary
$65
Make this server a replica of another, or promote it with NO ONE.
$5
since
$5
1.0.0
$5
group
$11
replication
$6
syntax
$28
REPLICAOF host port | NO ONE
$10
complexity
$75
O(1) at the command; the full resync that follows is O(N) in the background
$6
compat
$159
differs: the port argument is the primary's REPLICATION port base, not its client port (the default base is client port + 10000); chain replication is rejected
$5
flags
*2
$5
write
$5
admin
$4
ROLE
*14
$7
summary
$53
Report the replication role and state of this server.
$5
since
$5
1.0.0
$5
group
$11
replication
$6
syntax
$4
ROLE
$10
complexity
$36
O(1) on a replica; O(R) on a primary
$6
compat
$4
full
$5
flags
*1
$8
readonly
$7
SLAVEOF
*14
$7
summary
$26
Legacy alias of REPLICAOF.
$5
since
$5
1.0.0
$5
group
$11
replication
$6
syntax
$26
SLAVEOF host port | NO ONE
$10
complexity
$29
O(1) plus a background resync
$6
compat
$86
differs: a deprecated alias of REPLICAOF, including the replication-port-base argument
$5
flags
*2
$5
write
$5
admin
$4
WAIT
*14
$7
summary
$262
Block until every shard's master_repl_offset is acknowledged by at least numreplicas replicas (or timeout ms pass); returns the minimum acked-replica count across shards. timeout 0 = wait forever, hard-capped at 60 s. NOTE: a replica ACK is not fsync durability.
$5
since
$5
1.0.0
$5
group
$11
replication
$6
syntax
$24
WAIT numreplicas timeout
$10
complexity
$122
O(S) — an all-shard barrier returning the MINIMUM acked-replica count; the wall-clock cost is the replication round trip
$6
compat
$249
differs: it is an all-shard barrier returning the minimum across shards (Redis has one offset to wait on); timeout 0 is capped at 60s rather than blocking forever, and an ACK means the frame reached the replica's apply pipeline, not fsync durability
$5
flags
*2
$8
readonly
$8
blocking
$7
DISCARD
*14
$7
summary
$33
Abort the open MULTI transaction.
$5
since
$5
1.0.0
$5
group
$2
tx
$6
syntax
$7
DISCARD
$10
complexity
$52
O(1) — drops the queued commands and the WATCH set
$6
compat
$4
full
$5
flags
*2
$8
readonly
$11
transaction
$4
EXEC
*14
$7
summary
$41
Execute every command queued since MULTI.
$5
since
$5
1.0.0
$5
group
$2
tx
$6
syntax
$4
EXEC
$10
complexity
$116
O(sum of the queued commands' costs); with W watched keys, one extra O(W) pre-check fanned into O(min(W,S)) messages
$6
compat
$262
differs: a MULTI batch spanning several shards is per-shard-atomic, not globally isolated (there is no cross-shard snapshot); a queue-time error aborts the whole batch with EXECABORT, but a runtime error inside EXEC leaves the other commands applied, as in Redis
$5
flags
*2
$8
readonly
$11
transaction
$5
MULTI
*14
$7
summary
$63
Start a transaction; subsequent commands are queued until EXEC.
$5
since
$5
1.0.0
$5
group
$2
tx
$6
syntax
$5
MULTI
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*2
$8
readonly
$11
transaction
$7
UNWATCH
*14
$7
summary
$24
Forget all watched keys.
$5
since
$5
1.0.0
$5
group
$2
tx
$6
syntax
$7
UNWATCH
$10
complexity
$4
O(1)
$6
compat
$4
full
$5
flags
*2
$8
readonly
$11
transaction
$5
WATCH
*14
$7
summary
$51
Watch keys for optimistic locking of the next EXEC.
$5
since
$5
1.0.0
$5
group
$2
tx
$6
syntax
$19
WATCH key [key ...]
$10
complexity
$56
O(W) keys, grouped into O(min(W,S)) cross-shard messages
$6
compat
$4
full
$5
flags
*2
$8
readonly
$11
transaction
$10
PSUBSCRIBE
*14
$7
summary
$55
Subscribe to channels matching the given glob patterns.
$5
since
$5
1.0.0
$5
group
$6
pubsub
$6
syntax
$32
PSUBSCRIBE pattern [pattern ...]
$10
complexity
$76
O(p * P) — each pattern costs a linear scan of the shared pattern registry
$6
compat
$4
full
$5
flags
*2
$8
readonly
$6
pubsub
$7
PUBLISH
*14
$7
summary
$56
Post a message to a channel; returns the receiver count.
$5
since
$5
1.0.0
$5
group
$6
pubsub
$6
syntax
$23
PUBLISH channel message
$10
complexity
$177
O(1) channel lookup + O(P) — a linear walk of the registered patterns with one glob match each, even when none match. Delivery fans out only to the shards holding a subscriber
$6
compat
$4
full
$5
flags
*2
$8
readonly
$6
pubsub
$12
PUNSUBSCRIBE
*14
$7
summary
$57
Unsubscribe from patterns (all patterns when none given).
$5
since
$5
1.0.0
$5
group
$6
pubsub
$6
syntax
$36
PUNSUBSCRIBE [pattern [pattern ...]]
$10
complexity
$8
O(p * P)
$6
compat
$4
full
$5
flags
*2
$8
readonly
$6
pubsub
$9
SUBSCRIBE
*14
$7
summary
$32
Subscribe to the given channels.
$5
since
$5
1.0.0
$5
group
$6
pubsub
$6
syntax
$31
SUBSCRIBE channel [channel ...]
$10
complexity
$45
O(c) channels; never fans out to other shards
$6
compat
$176
differs: kevy has no RESP2 subscriber mode — after SUBSCRIBE the connection may still issue any command, where Redis restricts it to the pubsub verbs plus PING / QUIT / RESET
$5
flags
*2
$8
readonly
$6
pubsub
$11
UNSUBSCRIBE
*14
$7
summary
$57
Unsubscribe from channels (all channels when none given).
$5
since
$5
1.0.0
$5
group
$6
pubsub
$6
syntax
$35
UNSUBSCRIBE [channel [channel ...]]
$10
complexity
$13
O(c) channels
$6
compat
$4
full
$5
flags
*2
$8
readonly
$6
pubsub
$4
EVAL
*14
$7
summary
$74
Run a Lua script server-side; routed to KEYS[1]'s shard when numkeys >= 1.
$5
since
$5
1.0.0
$5
group
$6
script
$6
syntax
$51
EVAL script numkeys [key [key ...]] [arg [arg ...]]
$10
complexity
$232
O(compile + the script's own work). The whole script is one atomic unit on KEYS[1]'s shard and blocks that shard for its duration. The runaway guard is an INSTRUCTION budget (lua time_limit_ms x 40000 instructions), not a wall clock
$6
compat
$545
differs: there is no -BUSY state and no SCRIPT KILL — an over-budget script is aborted in place and answered with an ordinary error; nested EVAL is rejected, a redis.call touching another shard's key returns CROSSSLOT, and EVAL auto-caches its source by SHA1 so EVALSHA works without SCRIPT LOAD. Scripts replicate by SOURCE, not by effects: a script calling SPOP draws its own random members on a replica or an AOF replay — keep nondeterministic verbs out of scripts you replicate (plain SPOP outside EVAL propagates its effect and is safe)
$5
flags
*1
$5
write
$7
EVALSHA
*14
$7
summary
$43
Run a cached Lua script by its SHA1 digest.
$5
since
$5
1.0.0
$5
group
$6
script
$6
syntax
$52
EVALSHA sha1 numkeys [key [key ...]] [arg [arg ...]]
$10
complexity
$41
O(1) cache lookup, then identical to EVAL
$6
compat
$122
differs: same instruction-budget model as EVAL (no -BUSY, no SCRIPT KILL); the cache is process-wide and EVAL populates it
$5
flags
*1
$5
write
$6
SCRIPT
*14
$7
summary
$41
Manage the process-wide Lua script cache.
$5
since
$5
1.0.0
$5
group
$6
script
$6
syntax
$64
SCRIPT LOAD script | EXISTS sha1 [sha1 ...] | FLUSH [ASYNC|SYNC]
$10
complexity
$60
LOAD: O(len(script)). EXISTS: O(k). FLUSH: O(cached scripts)
$6
compat
$157
differs: LOAD / EXISTS / FLUSH only — SCRIPT KILL does not exist, by design: there is no -BUSY state to interrupt because an over-budget script self-aborts
$5
flags
*1
$8
readonly
$10
IDX.ADVISE
*14
$7
summary
$127
The declarations refused queries have been asking for, most-refused first — each rendered as the command that would serve it.
$5
since
$5
4.2.0
$5
group
$5
index
$6
syntax
$10
IDX.ADVISE
$10
complexity
$123
O(observed families); the refusal log is bounded (128 families, least-refused evicted) and cleared on every catalog install
$6
compat
$124
kevy-only: no Redis analogue — the refusal log turns 'no such index' into the declaration that would have served the query
$5
flags
*2
$8
readonly
$9
extension
$9
IDX.COUNT
*14
$7
summary
$59
Count index entries matching a range or equality predicate.
$5
since
$5
3.0.0
$5
group
$5
index
$6
syntax
$39
IDX.COUNT name RANGE min max | EQ value
$10
complexity
$109
O(log N + matched) per shard — NOT an O(1) counter and not a B-tree rank query; it counts the matched range
$6
compat
$46
kevy-only: nearest is FT.SEARCH with LIMIT 0 0
$5
flags
*2
$8
readonly
$9
extension
$10
IDX.CREATE
*14
$7
summary
$82
Declare a secondary index over a key prefix (catalog mutation, sidecar-persisted).
$5
since
$5
3.0.0
$5
group
$5
index
$6
syntax
$220
IDX.CREATE name ON PREFIX prefix FIELD field TYPE i64|f64|str|vector KIND range|unique|text|ann|agg [MAXMEM bytes] [DIM dim] [DISTANCE cosine|l2|ip] [M m] [EF ef] [GROUPBY field] [PARTITION local|global] [SPLIT value]…
$10
complexity
$240
O(1) at the call; the build is asynchronous — each shard snapshots its matching keys (O(keys on that shard)) then backfills 2048 rows per tick. Per-row build cost: range/unique O(log N), text O(tokens), vector O(ef_construction * M * dim)
$6
compat
$349
kevy-only: nearest is RediSearch FT.CREATE — comparable declarative index-on-prefix, but RediSearch is a module (`redisearch.so`, auto-loaded in Redis 8 and running in the server's own process, not a separate index server) whose index is maintained asynchronously; kevy's catalog is part of the engine and the index is maintained in the write hook
$5
flags
*2
$5
write
$9
extension
$12
IDX.DESCRIBE
*14
$7
summary
$149
Read an index declaration back: prefix, kind, type, fields, stored values, options, the table that compiled it, and the IDX.CREATE that recreates it.
$5
since
$5
6.5.0
$5
group
$5
index
$6
syntax
$17
IDX.DESCRIBE name
$10
complexity
$118
O(declaration size), plus O(tables) compiles to name the owning table; at the origin — the catalog is process-global
$6
compat
$9
kevy-only
$5
flags
*2
$8
readonly
$9
extension
$8
IDX.DROP
*14
$7
summary
$60
Drop a declared index (catalog mutation, sidecar-persisted).
$5
since
$5
3.0.0
$5
group
$5
index
$6
syntax
$13
IDX.DROP name
$10
complexity
$15
O(catalog size)
$6
compat
$34
kevy-only: nearest is FT.DROPINDEX
$5
flags
*2
$5
write
$9
extension
$8
IDX.LIST
*14
$7
summary
$59
List declared indexes with per-index build state and stats.
$5
since
$5
3.0.0
$5
group
$5
index
$6
syntax
$8
IDX.LIST
$10
complexity
$154
Not O(1) — per shard, per index it computes live stats: range/unique O(1), text O(distinct tokens + docs), vector O(nodes + links), agg O(groups + rows)
$6
compat
$52
kevy-only: nearest is FT._LIST plus FT.INFO combined
$5
flags
*2
$8
readonly
$9
extension
$11
IDX.EXPLAIN
*14
$7
summary
$84
The IDX.QUERY parse without the execution: kind, state, est_rows, and the plan line.
$5
since
$5
3.0.0
$5
group
$5
index
$6
syntax
$79
IDX.EXPLAIN name RANGE min max|EQ value|MATCH text|KNN vector|GROUPS [args ...]
$10
complexity
$79
The plan is parse-only, but est_rows costs the same live stats walk as IDX.LIST
$6
compat
$135
kevy-only: nearest is FT.EXPLAIN, which returns a parsed query tree; ours returns kind, build state, estimated rows and a one-line plan
$5
flags
*2
$8
readonly
$9
extension
$9
IDX.QUERY
*14
$7
summary
$99
Query an index: range/equality, text MATCH, vector KNN, aggregation groups, or a two-index COMPOSE.
$5
since
$5
3.0.0
$5
group
$5
index
$6
syntax
$564
IDX.QUERY name RANGE min max|EQ value [LIMIT n] [CURSOR c] [FILTER field RANGE min max|EQ value ...] [SORT field ASC|DESC] [DISTINCT field] [FACET field ...] [OFFSET n] [FIELDS field ...] | name MATCH text [LIMIT n] [FIELDS field ...] | name KNN vector [LIMIT k] [EF ef] [FIELDS field ...] | name GROUP group | name GROUPS [BY count|sum|min|max] [LIMIT n] | HYBRID text_idx MATCH text ann_idx KNN vector [LIMIT n] [RRFK k] [EF ef] [FIELDS field ...] | COMPOSE AND|OR nameA RANGE min max|EQ value nameB RANGE min max|EQ value [LIMIT n] [CURSOR c] [FIELDS field ...]
$10
complexity
$460
Depends on the index kind. range: O(log N + limit). unique: O(log N + hits). full-text: O(sum of the posting lists), MaxScore-pruned. vector ANN: O(dim * (M log N + ef * M)) distance evaluations (HNSW). agg GROUPS: a bounded top-K with 1 to 3 fan-out rounds. HYBRID: both sub-queries at 4x depth, fused by RRF at the origin. COMPOSE: NOT limit-bounded — both leaves are materialised in full, because the result is key-ordered while a segment is value-ordered
$6
compat
$572
kevy-only: nearest is RediSearch FT.SEARCH, and for the HYBRID shape FT.HYBRID (Redis 8.4+, which fuses by RRF with the same default constant of 60) — genuinely comparable on two axes (our text index is BM25 over inverted segments, our vector index is HNSW, and RediSearch offers both). Differences: nothing to load, RediSearch being `redisearch.so` and auto-loaded since Redis 8; our BM25 statistics are per-shard, not global; and our query surface is a fixed grammar, not a DSL — no field boosting, no phrase or proximity search, no stemming, no aggregation pipeline
$5
flags
*2
$8
readonly
$9
extension
$11
IDX.REBUILD
*14
$7
summary
$176
Rebuild an index: a range or unique index packs its leaves, an ANN index compacts its tombstones, a global index samples its split points again. A text or agg index is refused.
$5
since
$5
3.0.0
$5
group
$5
index
$6
syntax
$16
IDX.REBUILD name
$10
complexity
$283
Depends on the index kind, on every shard, synchronously. range / unique: O(N) to pack the leaves. global: one sample of every shard's values, then the moved entries. ann: O(V_live * ef_construction * M * dim) distance evaluations — the most expensive verb in the extension surface
$6
compat
$103
kevy-only: no Redis analogue — RediSearch handles HNSW deletes internally and exposes no rebuild verb
$5
flags
*2
$5
write
$9
extension
$10
IDX.VERIFY
*14
$7
summary
$279
Verify an index. Scalar kinds re-read every held entry against its row and report entries/bytes/coerce_failures/duplicates/drift/checked/missing (both audit directions); agg/text/ann answer their own sizing vocabulary (rows|docs|vectors, bytes, ...) and carry no row-keyed audit.
$5
since
$5
3.0.0
$5
group
$5
index
$6
syntax
$15
IDX.VERIFY name
$10
complexity
$159
O(N) per shard — every held entry is re-read against its row and re-coerced, which is the point: it makes index drift falsifiable rather than merely asserted
$6
compat
$118
kevy-only: no Redis analogue — RediSearch's index is asynchronously maintained and offers no consistency-verify verb
$5
flags
*2
$8
readonly
$9
extension
$13
TABLE.DECLARE
*14
$7
summary
$114
Declare a relational table that compiles at declare time into named indexes (catalog mutation, sidecar-persisted).
$5
since
$5
4.0.0
$5
group
$5
table
$6
syntax
$272
TABLE.DECLARE name PREFIX prefix PK col COLUMN name i64|f64|str [COLUMN ...] [INDEX col range|unique [VALUES col ...] [GLOBAL [SPLIT AT v ...]]] [ORDERPATH name ON col [DESC] [THEN col [DESC]] ... [GLOBAL [SPLIT AT 0xhex ...]]] [WINDOW col SPAN n BUCKET n] [AUTODECLARE n]
$10
complexity
$234
O(declaration size) at the call; each compiled index then backfills like IDX.CREATE (2048 rows per tick per shard). The engine gains no query planner: queries name the compiled paths (`<table>.<col>`, `<table>.<orderpath>`) explicitly
$6
compat
$235
kevy-only: nearest is CREATE TABLE in an RDBMS — but this is a declaration compiler, not a schema enforcer: a row with a missing column is a row with an absent field (NULL semantics), never an error, and no SQL executes at query time
$5
flags
*2
$5
write
$9
extension
$12
TABLE.ENSURE
*14
$7
summary
$166
TABLE.DECLARE's boot form: identical existing declaration answers +UNCHANGED, a different one is a named refusal saying which part differs — never a silent rebuild.
$5
since
$5
4.1.0
$5
group
$5
table
$6
syntax
$132
TABLE.ENSURE name PREFIX prefix PK col COLUMN name i64|f64|str [COLUMN ...] [INDEX ...] [ORDERPATH ...] [WINDOW ...] [AUTODECLARE n]
$10
complexity
$130
declare-at-boot is the steady state; plain DECLARE errors on re-declare, which quiet boot code then ignores forever (dogfood F8.2)
$6
compat
$103
kevy-only: nearest is CREATE TABLE IF NOT EXISTS — plus the spec comparison IF NOT EXISTS does not do
$5
flags
*2
$5
write
$9
extension
$13
TABLE.REPLACE
*14
$7
summary
$184
Drop and redeclare in one verb, rebuilding every compiled index from the rows. Named for its cost: a full backfill, asked for explicitly. A bad spec refuses BEFORE the old table drops.
$5
since
$5
4.1.0
$5
group
$5
table
$6
syntax
$133
TABLE.REPLACE name PREFIX prefix PK col COLUMN name i64|f64|str [COLUMN ...] [INDEX ...] [ORDERPATH ...] [WINDOW ...] [AUTODECLARE n]
$10
complexity
$48
the migration verb: spec changed, rebuild wanted
$6
compat
$78
kevy-only: nearest is DROP TABLE + CREATE TABLE, atomic against a bad new spec
$5
flags
*2
$5
write
$9
extension
$14
TABLE.DESCRIBE
*14
$7
summary
$173
Read a table declaration back: columns with types, indexes, order paths, window, and the TABLE.DECLARE that recreates it (auto-declared paths are listed but left out of it).
$5
since
$5
6.5.0
$5
group
$5
table
$6
syntax
$19
TABLE.DESCRIBE name
$10
complexity
$67
O(declaration size) at the origin — the catalog is process-global
$6
compat
$50
kevy-only: nearest is DESCRIBE / SHOW CREATE TABLE
$5
flags
*2
$8
readonly
$9
extension
$10
TABLE.DROP
*14
$7
summary
$85
Drop a declared table and its compiled indexes (catalog mutation, sidecar-persisted).
$5
since
$5
4.0.0
$5
group
$5
table
$6
syntax
$15
TABLE.DROP name
$10
complexity
$34
O(catalog size + compiled indexes)
$6
compat
$9
kevy-only
$5
flags
*2
$5
write
$9
extension
$10
TABLE.LIST
*14
$7
summary
$66
List declared tables with their prefix, PK and declaration counts.
$5
since
$5
4.0.0
$5
group
$5
table
$6
syntax
$10
TABLE.LIST
$10
complexity
$57
O(tables) at the origin — the catalog is process-global
$6
compat
$9
kevy-only
$5
flags
*2
$8
readonly
$9
extension
$12
TABLE.VERIFY
*14
$7
summary
$113
Verify a table: each compiled index's full drift recheck plus a bounded column-type spot check over sampled rows.
$5
since
$5
4.0.0
$5
group
$5
table
$6
syntax
$17
TABLE.VERIFY name
$10
complexity
$212
O(sum of compiled index entries) per shard for the drift recheck (the IDX.VERIFY discipline, composites re-derive their byte encoding) plus a bounded 64-row-per-shard column spot check through the no-promote peek
$6
compat
$84
kevy-only: nearest is a relational fsck; verify-not-enforce is the declarative fence
$5
flags
*2
$8
readonly
$9
extension
$11
VIEW.CREATE
*14
$7
summary
$92
Declare a composed view over indexes with an ORDER BY (catalog mutation, sidecar-persisted).
$5
since
$5
3.0.0
$5
group
$4
view
$6
syntax
$179
VIEW.CREATE name QUERY tree ORDER BY index [DESC] [MODE virtual|materialized] [TOPK k] [VIA template] (tree = '( AND|OR|DIFF sub sub )' | 'index RANGE min max' | 'index EQ value')
$10
complexity
$156
O(tree size) at the call. A materialized view builds lazily on the next tick (a full eval_tree plus an O(M log M) sort); a virtual view builds nothing, ever
$6
compat
$188
kevy-only: no Redis analogue. A view is neither a stored query nor a join — it is a named composition tree over declared indexes that stores membership and order only, never field values
$5
flags
*2
$5
write
$9
extension
$13
VIEW.DESCRIBE
*14
$7
summary
$123
Read a view declaration back: the composition tree, order, mode, hydration template, and the VIEW.CREATE that recreates it.
$5
since
$5
6.5.0
$5
group
$4
view
$6
syntax
$18
VIEW.DESCRIBE name
$10
complexity
$67
O(declaration size) at the origin — the catalog is process-global
$6
compat
$38
kevy-only: nearest is SHOW CREATE VIEW
$5
flags
*2
$8
readonly
$9
extension
$9
VIEW.DROP
*14
$7
summary
$59
Drop a declared view (catalog mutation, sidecar-persisted).
$5
since
$5
3.0.0
$5
group
$4
view
$6
syntax
$14
VIEW.DROP name
$10
complexity
$15
O(catalog size)
$6
compat
$9
kevy-only
$5
flags
*2
$5
write
$9
extension
$12
VIEW.EXPLAIN
*14
$7
summary
$62
Explain a view's composition tree with per-leaf cardinalities.
$5
since
$5
3.0.0
$5
group
$4
view
$6
syntax
$17
VIEW.EXPLAIN name
$10
complexity
$140
O(sum over leaves of (log N + matched)) — each leaf's cardinality is a real count, so EXPLAIN on a broad leaf costs as much as counting it
$6
compat
$95
kevy-only: nearest is FT.EXPLAIN, which returns a query tree rather than per-leaf cardinalities
$5
flags
*2
$8
readonly
$9
extension
$9
VIEW.LIST
*14
$7
summary
$46
List declared views with their mode and shape.
$5
since
$5
3.0.0
$5
group
$4
view
$6
syntax
$9
VIEW.LIST
$10
complexity
$56
O(views) at the origin — the catalog is process-global
$6
compat
$9
kevy-only
$5
flags
*2
$8
readonly
$9
extension
$10
VIEW.QUERY
*14
$7
summary
$88
Page through a view's ordered members, optionally hydrating fields via the VIA template.
$5
since
$5
3.0.0
$5
group
$4
view
$6
syntax
$55
VIEW.QUERY name [LIMIT n] [CURSOR c] [FIELDS field ...]
$10
complexity
$275
virtual: O(log N_order + candidates * leaves) — it streams the ORDER index and probes membership per candidate, stopping at the limit, so it never materialises the member set. materialized: O(log M + limit). Adding FIELDS with VIA costs a SECOND fan-out to hydrate the rows
$6
compat
$158
kevy-only: no Redis analogue. Absent by construction: no joins, no predicates at the view layer, no projection from the view itself, no HAVING, no aggregation
$5
flags
*2
$8
readonly
$9
extension
$12
VIEW.REBUILD
*14
$7
summary
$39
Force a rebuild of a materialized view.
$5
since
$5
3.0.0
$5
group
$4
view
$6
syntax
$17
VIEW.REBUILD name
$10
complexity
$139
Materialized only. A full eval_tree over the whole tree plus an O(M log M) sort and re-insert, on every shard, now (not deferred to a tick)
$6
compat
$9
kevy-only
$5
flags
*2
$5
write
$9
extension
$11
VIEW.VERIFY
*14
$7
summary
$48
Verify a view and report member/byte statistics.
$5
since
$5
3.0.0
$5
group
$4
view
$6
syntax
$16
VIEW.VERIFY name
$10
complexity
$190
materialized: O(M). virtual: O(sum over leaves of (log N + leaf range) + M) — a full fresh evaluation just to report cardinality, which is the one place a virtual view is the expensive one
$6
compat
$9
kevy-only
$5
flags
*2
$8
readonly
$9
extension
$9
FEED.READ
*14
$7
summary
$71
Read change-feed frames from one shard past a generation/offset cursor.
$5
since
$5
3.0.0
$5
group
$4
feed
$6
syntax
$63
FEED.READ shard generation offset [COUNT n] [PREFIX prefix ...]
$10
complexity
$209
A single shard (the shard is an argument, not a fan-out). O(log B) to locate the start offset in the backlog plus O(count * frame size) to decode and re-encode. COUNT defaults to 256 and is hard-capped at 4096
$6
compat
$414
kevy-only: no clean Redis analogue. Keyspace notifications are fire-and-forget with no cursor and no replay; Redis Streams have cursors but are a stream you must dual-write to, not a feed over your existing keyspace; the replication backlog is what this is built on, but Redis exposes it only to replicas. kevy is deliberately not a broker: no consumer groups, no server-side positions, no global cross-shard order
$5
flags
*2
$8
readonly
$9
extension
$11
FEED.SHARDS
*14
$7
summary
$40
Return the number of change-feed shards.
$5
since
$5
3.0.0
$5
group
$4
feed
$6
syntax
$11
FEED.SHARDS
$10
complexity
$22
O(1), answered locally
$6
compat
$66
kevy-only: Redis has no shard-partitioned change feed to enumerate
$5
flags
*2
$8
readonly
$9
extension
$9
FEED.TAIL
*14
$7
summary
$57
Return a shard's current feed generation and next offset.
$5
since
$5
3.0.0
$5
group
$4
feed
$6
syntax
$15
FEED.TAIL shard
$10
complexity
$22
O(1) on a single shard
$6
compat
$106
kevy-only: nearest is INFO replication's master_repl_offset, which is not a resumable per-shard CDC cursor
$5
flags
*2
$8
readonly
$9
extension
$12
PREFIX.STATS
*14
$7
summary
$54
Report key-count and byte statistics for a key prefix.
$5
since
$5
3.0.0
$5
group
$9
migration
$6
syntax
$19
PREFIX.STATS prefix
$10
complexity
$94
O(keys on the shard) — a full keyspace walk on every shard; the prefix cannot be precomputed
$6
compat
$173
kevy-only: nearest is INFO keyspace's db0:keys=N,expires=M — the same two counters, but whole-DB and O(1) off a counter, where ours is per-prefix and therefore O(keyspace)
$5
flags
*2
$8
readonly
$9
extension
$13
PREFIX.DIGEST
*14
$7
summary
$73
Order-insensitive checksum of a prefix's rows for migration verification.
$5
since
$5
3.0.0
$5
group
$9
migration
$6
syntax
$20
PREFIX.DIGEST prefix
$10
complexity
$174
O(keys on the shard) to walk plus O(sum of row sizes) to digest, on every shard. Per-row digests XOR together, so the result is order-insensitive and safe across shard counts
$6
compat
$233
kevy-only: nearest is DEBUG DIGEST — comparable in kind (Redis also XORs per-key digests), but Redis's is whole-DB and lives behind DEBUG, while ours is per-prefix (the unit a migration actually cares about) and is a supported verb
$5
flags
*2
$8
readonly
$9
extension