. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 3.1.8 Appendix with SQL operator . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 3.2 Distributed Transaction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 ii 3.2.9 Appendix with SQL operator . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 3.3 Readwrite‐splitting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47 3.8.8 Appendix with SQL operator . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47 3.9 Shadow . . . . . . . . . . . .

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27 3.1.8 Appendix with SQL operator . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27 3.2 Distributed Transaction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 3.2.9 Appendix with SQL operator . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ii 3.3 Readwrite‐splitting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46 3.8.8 Appendix with SQL operator . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46 3.9 Shadow . . . . . . . . . . . .

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 8.1.8 Appendix with SQL operator . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 8.2 Distributed Transaction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38 8.2.9 Appendix with SQL operator . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38 8.3 Readwrite‐splitting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 48 8.7.8 Appendix with SQL operator . . . . . . . . . . . . . . . . . . . . . . . . . . . . 48 8.8 Data Masking . . . . . . . . .

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 8.1.8 Appendix with SQL operator . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 8.2 Distributed Transaction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38 8.2.9 Appendix with SQL operator . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38 8.3 Readwrite‐splitting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 48 8.7.8 Appendix with SQL operator . . . . . . . . . . . . . . . . . . . . . . . . . . . . 48 8.8 Data Masking . . . . . . . . .

provided by different database dialect, it is categorized into keyword, expression, literal value and operator. SQL is then converted into abstract syntax tree by syntactic parser. For example, the following single‐sharding route (equal mark as the operator of sharding key), multiple‐sharding route (IN as the operator of sharding key) and range sharding route (BETWEEN as the operator of sharding key). SQL without sharding not include joint query or only includes joint query between binding tables. When the sharding operator is equal mark, the route result will fall into a single database (table); when sharding operators

databases. What’s more, it also brings the same problem as data sharding, complicating developer and operator’s maintenance and operation. The following diagram has shown the complex topological rela‐ tions provided by different database dialect, it is categorized into keyword, expression, literal value and operator. SQL is then converted into abstract syntax tree by syntactic parser. For example, the following single‐sharding route (equal mark as the operator of sharding key), multiple‐sharding route (IN as the operator of sharding key) and range sharding route (BETWEEN as the operator of sharding key). SQL without sharding

databases. What’s more, it also brings the same problem as data sharding, complicating developer and operator’s maintenance and operation. The following diagram has shown the complex topological rela‐ tions provided by different database dialect, it is categorized into keyword, expression, literal value and operator. SQL is then converted into abstract syntax tree by syntactic parser. For example, the following single‐sharding route (equal mark as the operator of sharding key), multiple‐sharding route (IN as the operator of sharding key) and range sharding route (BETWEEN as the operator of sharding key). SQL without sharding

databases. What’s more, it also brings the same problem as data sharding, complicating developer and operator’s maintenance and operation. The following diagram has shown the complex topological rela‐ tions provided by different database dialect, it is categorized into keyword, expression, literal value and operator. SQL is then converted into abstract syntax tree by syntactic parser. For example, the following single‐sharding route (equal mark as the operator of sharding key), multiple‐sharding route (IN as the operator of sharding key) and range sharding route (BETWEEN as the operator of sharding key). SQL without sharding

table-name="t_order" operator= "EQUAL"> 3.10. 测试引擎 108 Apache ShardingSphere document, v5.0.0-beta operator= "EQUAL"> column-name="order_id" table-name="t_order" operator= "EQUAL"> operator= "EQUAL">

0 码力 | 301 页 | 3.44 MB | 1 年前

3

table-name="t_order" operator= "EQUAL"> 7.6. 测试 285 Apache ShardingSphere document, v5.0.0 operator= "EQUAL"> column-name="order_id" table-name="t_order" operator= "EQUAL"> operator= "EQUAL">

0 码力 | 385 页 | 4.26 MB | 1 年前

3