of the computation and storage capacity of existed database in distributed system, rather than a totally new database. As the cornerstone of enterprises, relational database still takes a huge market share Command Client, MySQL Workbench, etc.) that is compatible of MySQL protocol to operate data. • Totally transparent to applications, it can be used directly as MySQL. • Applicable to any kind of terminal table will use the conditions of t_order. Due to this, sharding keys in binding tables should be totally identical. 3.1. Sharding 12 Apache ShardingSphere document, v5.0.0-beta Broadcast Table It refers

is compatible of MySQL or PostgreSQL protocol to op‐ erate data, which is friendlier to DBAs • Totally transparent to applications, it can be used directly as MySQL/PostgreSQL. • Applicable to any kind architecture. It needs to make each mod‐ ule decouple to independent and imperceptible to each other totally, and enables appendable functions in a way of superposition through a pluggable kernel. Design an table will use the conditions of t_order. Due to this, sharding keys in binding tables should be totally identical. Broadcast Table It refers to tables that exist in all sharding database sources. The

is compatible with MySQL or PostgreSQL protocol to operate data, which is friendlier to DBAs • Totally transparent to applications, it can be used directly as MySQL/PostgreSQL; • Applicable to any kind architecture. It needs to make each mod‐ ule decouple to independent and imperceptible to each other totally, and enables appendable functions in a way of superposition through a pluggable kernel. Design an algorithm can ensure sequences of different processes do not repeat and those of the same process are ordered. Principle In the same process, it makes sure that IDs do not repeat through time, or through order

is compatible with MySQL or PostgreSQL protocol to operate data, which is friendlier to DBAs • Totally transparent to applications, it can be used directly as MySQL/PostgreSQL; 3.1. Adaptor 11 Apache architecture. It needs to make each mod‐ ule decouple to independent and imperceptible to each other totally, and enables appendable functions in a way of superposition through a pluggable kernel. Design an algorithm can ensure sequences of different processes do not repeat and those of the same process are ordered. 4.3. Sharding 35 Apache ShardingSphere document, v5.1.2 Principle In the same process, it makes

function between all kinds of distributed transactions. Highly consistent transactions do not have totally the same API and functions as soft transactions, and they cannot switch between each other freely Statement and PreparedStatement Interface • Do not support statements that return multiple result sets (stored procedures, multiple pieces of non‐SELECT data) • Do not support the operation of international org.apache.shardingsphere.infra.merge.engine.ResultProcessEngine Definition Used to process result sets Implementation classes C onfigura- tion type Description Fully-qualified class name Shardi ngRule

function between all kinds of distributed transactions. Highly consistent transactions do not have totally the same API and functions as soft transactions, and they cannot switch between each other freely Statement and PreparedStatement Interface • Do not support statements that return multiple result sets (stored procedures, multiple pieces of non‐SELECT data) • Do not support the operation of international org.apache.shardingsphere.infra.merge.engine.ResultProcessEngine Definition Used to process result sets Implementation classes C onfigura- tion type Description Fully-qualified class name Shardi ngRule

function between all kinds of distributed transactions. Highly consistent transactions do not have totally the same API and functions as soft transactions, and they cannot switch between each other freely Statement and PreparedStatement Interface • Do not support statements that return multiple result sets (stored procedures, multiple pieces of non‐SELECT data) • Do not support the operation of international sqlserver:mssql-jdbc, represented by the JDBC Driver of MS SQL Server, will dynamically load different character sets based on the encoding used in the database, which is unpredictable behavior. When encountering the

only holds if x’s datatype only contains numbers, not `NaN or infinities.) • The empty string is ordered lexicographically before every other string. Therefore, S >= '' is true whatever the value of S !> some( select income from blacksmiths ) ) then PoorGoldsmith = 1; else PoorGoldsmith = 0; (sets PoorGoldsmith to 1 if at least one blacksmith’s income is not less than the value of GSIncome) 5 the universal (“A”) quantifier and ANY|SOME to the existential (“E”) quantifier.) For non-empty sets, you can write out “A {ANY|SOME} ()” as A E1 or A E2 or ... or A En

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 3.5.3. Special Character Sets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 473 RDB$CHARACTER_SETS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 509 Appendix F: Character Sets and Collation Sequences . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

function between all kinds of distributed transactions. Highly consistent transactions do not have totally the same API and functions as soft transactions, and they cannot switch between each other freely Statement and PreparedStatement Interface • Do not support statements that return multiple result sets (stored procedures, multiple pieces of non‐SELECT data) • Do not support the operation of international sqlserver:mssql-jdbc, represented by the JDBC Driver of MS SQL Server, will dynamically load different character sets based on the encoding used in the database, which is unpredictable behavior. When encountering the