KEYS pattern

    Time complexity: O(N) with N being the number of keys in the database, under the assumption that the key names in the database and the given pattern have limited length.

    Returns all keys matching .

    While the time complexity for this operation is O(N), the constant times are fairly low. For example, Redis running on an entry level laptop can scan a 1 million key database in 40 milliseconds.

    Supported glob-style patterns:

    • h?llo matches hello, hallo and hxllo
    • h[ae]llo matches hello and hallo, but not hillo
    • h[a-b]llo matches hallo and hbllo

    Use \ to escape special characters if you want to match them verbatim.

    Array reply: list of keys matching pattern.

    *Examples

    redis> KEYS name

    redis> KEYS a??

    redis> KEYS *

    redis>