The Redis PEXPIREAT command sets a timeout as a Unix timestamp on a given key in milliseconds. It works the same as the EXPIREAT command, except that it sets the timeout in milliseconds instead of seconds.
It’s also similar to the PEXPIRE command, but with an absolute Unix timestamp instead of a time interval.
The Redis PEXPIRE command sets a timeout on a given key in milliseconds. After the timeout has expired, the key will be deleted.
The PEXPIRE command works exactly the same as the EXPIRE command, except that it returns the timeout in milliseconds instead of seconds.
The Redis EXPIRE command sets a timeout on a given key in seconds. After the timeout has expired, the key will be deleted.
Redis also has a PEXPIRE command that works the same as EXPIRE, except that it returns the timeout in milliseconds instead of seconds.
A key with a timeout is said to be volatile in Redis terminology.
Continue readingIn Redis, the STRLEN command returns the length of the string stored at a given key.
The Redis PSETEX command sets a key to hold a given string value, and sets that key to time out after a given number of milliseconds.
In Redis, the SETEX command sets a key to hold a given string value, and sets that key to time out after a given number of seconds.
In Redis, the APPEND command appends a given value to the end of the value of a specified key.
If the key doesn’t exist, APPEND creates the key with the empty string and appends the value to it (so it basically works like the SET command in this case).
The Redis GETDEL command gets the value of a given key, then deletes that key. It’s similar to the GET command, except that it deletes the key on success (the GET command doesn’t delete the key – it only returns its value).
An error is returned if the value stored at key is not a string.
The GETDEL command was introduced in Redis 6.2.0.
In Redis, the DEL command removes one or more keys. If a specified key doesn’t exist, it’s ignored.
In Redis, the LCS command implements the longest common subsequence algorithm.
The longest common subsequence algorithm finds the longest subsequence common to all sequences in a set of sequences. Note that this is different to the longest common string algorithm (also known as the longest common substring algorithm), which requires that matching characters in the string are contiguous. The longest common subsequence algorithm, on the other hand, doesn’t require matching characters to be contiguous.
The LCS command was introduced in Redis 7.0.0.
Continue reading