sharding is performed using a single key as the sharding key =, IN, BETWEEN AND, >, <, >=, <=. ‐ Composite Sharding Algorithm Used to cope with scenarios where multiple keys are used as sharding keys. The not supported • Migration without primary key and unique key tables. • Migration of composite primary key or composite unique key tables. • Migration on top of the current storage node is not supported algorithms, which can be divided into automatic sharding algorithms, standard sharding algorithms, composite sharding algorithms, and hint sharding algorithms, and can meet the needs of most business scenarios

sharding is performed using a single key as the sharding key =, IN, BETWEEN AND, >, <, >=, <=. ‐ Composite Sharding Algorithm Used to cope with scenarios where multiple keys are used as sharding keys. The key tables. Procedures not supported • Migration without primary key tables. • Migration of composite primary key tables. • Migration on top of the current storage node is not supported, so a brand algorithms, which can be divided into automatic sharding algorithms, standard sharding algorithms, composite sharding algorithms, and hint sharding algorithms, and can meet the needs of most business scenarios

ShardingSphere. Unsupported • Scale table without primary key, primary key can not be composite; • Scale table with composite primary key; • Do not support scale on in used databases, need to prepare a new

v5.1.1 Unsupported • Scale table without primary key, primary key can not be composite; • Scale table with composite primary key; • Do not support scale on in used databases, need to prepare a new

v5.1.2 Unsupported • Scale table without primary key, primary key can not be composite; • Scale table with composite primary key; • Do not support scale on in used databases, need to prepare a new

sharding is performed using a single key as the sharding key =, IN, BETWEEN AND, >, <, >=, <=. ‐ Composite Sharding Algorithm Used to cope with scenarios where multiple keys are used as sharding keys. The algorithms, which can be divided into automatic sharding algorithms, standard sharding algorithms, composite sharding algorithms, and hint sharding algorithms, and can meet the needs of most business scenarios

sharding is performed using a single key as the sharding key =, IN, BETWEEN AND, >, <, >=, <=. ‐ Composite Sharding Algorithm Used to cope with scenarios where multiple keys are used as sharding keys. The algorithms, which can be divided into automatic sharding algorithms, standard sharding algorithms, composite sharding algorithms, and hint sharding algorithms, and can meet the needs of most business scenarios