DEL key
Available since
Time complexity
O(N) where N is the number of keys that will be removed. When a key to remove holds a value other than a string, the individual complexity for this key is O(M) where M is the number of elements in the list, set, sorted set or hash. Removing a single key that holds a string value is O(1).
ACL categories
@keyspace, @write, @slow

Removes the specified keys. A key is ignored if it does not exist.

Examples #

SET key1 "Hello"
SET key2 "World"
DEL key1 key2 key3

Redict logo courtesy of @janWilejan, CC-BY-SA-4.0. Download SVG ⤑

Portions of this website courtesy of Salvatore Sanfilippo, CC-BY-SA-4.0.