Redis集群下，不同的Key可以映射到同一个槽吗？

问题：{user}:age和{user}.name能被映射到同一个槽下吗？

答案是可以的

我们都知道，Redis中的key的hash slot是通过对key进行crc16哈希计算得出的。因此，如果{user}的值相同，那么{user}:123和{user}:456将被放置在同一个槽中。否则，它们将被放置在不同的槽中。

1 Redis如何计算Key对应的槽位

在Redis中，key的槽位是通过对key进行CRC16哈希计算得出的。具体来说，Redis使用一个名为keyHashSlot的函数来计算key的槽位。

具体来说，Redis使用的哈希函数是MurmurHash2算法，它可以将任意长度的数据映射为一个128位的哈希值。在计算键名的哈希值时，Redis只使用了其中的一部分，具体来说是使用了128位哈希值的低16位和高16位的异或值。这样可以保证哈希值的分布比较均匀，从而避免出现热点数据。

而对于不同的key值，可能会被映射到同一个槽位上，这就是Redis中的哈希冲突问题。为了解决这个问题，Redis使用了一种叫做链式哈希的方法来处理哈希冲突。具体来说，当多个key被映射到同一个槽位上时，Redis会将这些key存储在一个链表中，这样就可以避免哈希冲突的问题。

该方法大致如下：

unsigned int keyHashSlot(const void *key, int keylen) {
    return crc16(key,keylen) & 0x3FFF;
}

其中，key是要计算槽位的key值，keylen是key的长度。计算出的槽位是一个整数，范围在0到16383之间。

带着这个问题，我们来看看redis源码， /src/cluster.c

/* -----------------------------------------------------------------------------
 * Key space handling
 * -------------------------------------------------------------------------- */

/* We have 16384 hash slots. The hash slot of a given key is obtained
 * as the least significant 14 bits of the crc16 of the key.
 *
 * However if the key contains the {...} pattern, only the part between
 * { and } is hashed. This may be useful in the future to force certain
 * keys to be in the same node (assuming no resharding is in progress). */
unsigned int keyHashSlot(char *key, int keylen) {
    int s, e; /* start-end indexes of { and } */

    for (s = 0; s < keylen; s++)
        if (key[s] == '{') break;

    /* No '{' ? Hash the whole key. This is the base case. */
    if (s == keylen) return crc16(key,keylen) & 0x3FFF;

    /* '{' found? Check if we have the corresponding '}'. */
    for (e = s+1; e < keylen; e++)
        if (key[e] == '}') break;

    /* No '}' or nothing between {} ? Hash the whole key. */
    if (e == keylen || e == s+1) return crc16(key,keylen) & 0x3FFF;

    /* If we are here there is both a { and a } on its right. Hash
     * what is in the middle between { and }. */
    return crc16(key+s+1,e-s-1) & 0x3FFF;
}

我们可以看到，Redis的keyHashSlot方法，首先对键名中的第一个“{”进行查找，如果能找到，找到键名中的“}”，

• 如果两者都能找到，那么取他们中间的字符串作为有效部分（可以理解为参与crc16的实际部分，官网叫Hash Tag）
• 如果找不到，则取整个key作为参数进行运算。

扩展阅读： CRC16算法

CRC16算法是一种广泛应用于通信、存储等领域的哈希算法。它可以将任意长度的数据映射为一个16位的哈希值。CRC16算法的核心是一个16位的多项式，它可以通过查表的方式来计算数据的哈希值。

在Redis中，CRC16算法的实现是基于一个叫做crc16.c的文件。这个文件中包含了一个名为crc16的函数，它可以计算任意长度的数据的哈希值。具体来说，crc16函数的实现是基于一个名为crc16tab的查表数组，它可以快速地计算数据的哈希值。

源码位置：/src/crc16.c

static const uint16_t crc16tab[256]= {
    0x0000,0x1021,0x2042,0x3063,0x4084,0x50a5,0x60c6,0x70e7,
    0x8108,0x9129,0xa14a,0xb16b,0xc18c,0xd1ad,0xe1ce,0xf1ef,
    0x1231,0x0210,0x3273,0x2252,0x52b5,0x4294,0x72f7,0x62d6,
    0x9339,0x8318,0xb37b,0xa35a,0xd3bd,0xc39c,0xf3ff,0xe3de,
    0x2462,0x3443,0x0420,0x1401,0x64e6,0x74c7,0x44a4,0x5485,
    0xa56a,0xb54b,0x8528,0x9509,0xe5ee,0xf5cf,0xc5ac,0xd58d,
    0x3653,0x2672,0x1611,0x0630,0x76d7,0x66f6,0x5695,0x46b4,
    0xb75b,0xa77a,0x9719,0x8738,0xf7df,0xe7fe,0xd79d,0xc7bc,
    0x48c4,0x58e5,0x6886,0x78a7,0x0840,0x1861,0x2802,0x3823,
    0xc9cc,0xd9ed,0xe98e,0xf9af,0x8948,0x9969,0xa90a,0xb92b,
    0x5af5,0x4ad4,0x7ab7,0x6a96,0x1a71,0x0a50,0x3a33,0x2a12,
    0xdbfd,0xcbdc,0xfbbf,0xeb9e,0x9b79,0x8b58,0xbb3b,0xab1a,
    0x6ca6,0x7c87,0x4ce4,0x5cc5,0x2c22,0x3c03,0x0c60,0x1c41,
    0xedae,0xfd8f,0xcdec,0xddcd,0xad2a,0xbd0b,0x8d68,0x9d49,
    0x7e97,0x6eb6,0x5ed5,0x4ef4,0x3e13,0x2e32,0x1e51,0x0e70,
    0xff9f,0xefbe,0xdfdd,0xcffc,0xbf1b,0xaf3a,0x9f59,0x8f78,
    0x9188,0x81a9,0xb1ca,0xa1eb,0xd10c,0xc12d,0xf14e,0xe16f,
    0x1080,0x00a1,0x30c2,0x20e3,0x5004,0x4025,0x7046,0x6067,
    0x83b9,0x9398,0xa3fb,0xb3da,0xc33d,0xd31c,0xe37f,0xf35e,
    0x02b1,0x1290,0x22f3,0x32d2,0x4235,0x5214,0x6277,0x7256,
    0xb5ea,0xa5cb,0x95a8,0x8589,0xf56e,0xe54f,0xd52c,0xc50d,
    0x34e2,0x24c3,0x14a0,0x0481,0x7466,0x6447,0x5424,0x4405,
    0xa7db,0xb7fa,0x8799,0x97b8,0xe75f,0xf77e,0xc71d,0xd73c,
    0x26d3,0x36f2,0x0691,0x16b0,0x6657,0x7676,0x4615,0x5634,
    0xd94c,0xc96d,0xf90e,0xe92f,0x99c8,0x89e9,0xb98a,0xa9ab,
    0x5844,0x4865,0x7806,0x6827,0x18c0,0x08e1,0x3882,0x28a3,
    0xcb7d,0xdb5c,0xeb3f,0xfb1e,0x8bf9,0x9bd8,0xabbb,0xbb9a,
    0x4a75,0x5a54,0x6a37,0x7a16,0x0af1,0x1ad0,0x2ab3,0x3a92,
    0xfd2e,0xed0f,0xdd6c,0xcd4d,0xbdaa,0xad8b,0x9de8,0x8dc9,
    0x7c26,0x6c07,0x5c64,0x4c45,0x3ca2,0x2c83,0x1ce0,0x0cc1,
    0xef1f,0xff3e,0xcf5d,0xdf7c,0xaf9b,0xbfba,0x8fd9,0x9ff8,
    0x6e17,0x7e36,0x4e55,0x5e74,0x2e93,0x3eb2,0x0ed1,0x1ef0
};

uint16_t crc16(const char *buf, int len) {
    int counter;
    uint16_t crc = 0;
    for (counter = 0; counter < len; counter++)
            crc = (crc<<8) ^ crc16tab[((crc>>8) ^ *buf++)&0x00FF];
    return crc;
}

扩展阅读：Hash Tag

在Redis官网有个章节，Hash Tag，我们可以看看，

There is an exception for the computation of the hash slot that is used in order to implement hash tags. Hash tags are a way to ensure that multiple keys are allocated in the same hash slot. This is used in order to implement multi-key operations in Redis Cluster.

为了实现散列标记而使用的散列槽的计算有一个例外。散列标记是一种确保在同一个散列槽中分配多个键的方法。这是为了在Redis集群中实现多键操作。

To implement hash tags, the hash slot for a key is computed in a slightly different way in certain conditions. If the key contains a “{…}” pattern only the substring between { and } is hashed in order to obtain the hash slot. However since it is possible that there are multiple occurrences of { or } the algorithm is well specified by the following rules:
为了实现哈希标签，在某些条件下，键的哈希槽以略微不同的方式计算。如果键包含“{…”}"模式只对{和}之间的子字符串进行哈希以获得哈希槽。然而，由于{or}有可能出现多次，该算法由以下规则指定:

• IF the key contains a { character.
• AND IF there is a } character to the right of {.
• AND IF there are one or more characters between the
  first occurrence of { and the first occurrence of }.

更多详情见：Redis-Cluster-Hash tags

总结

所以，本文的问题，{user}:age和{user}.name是可以映射到一个槽位上，因为他们有共同的Hash Tag(“user”)，我们在集群环境操作的时候如果有这种需求，假设我们需要存储用户相关的信息，我们要求存储在相同的槽位上，方便我们进行查看

set {userInfo:1001}.username zhangsan

set {userInfo:1001}.age 24

set {userInfo:1001}.email xxx@gmail.com

结果：