PDF (US Ltr)
- 43.3Mb
PDF (A4)
- 43.4Mb
Man Pages (TGZ)
- 297.2Kb
Man Pages (Zip)
- 402.4Kb
Info (Gzip)
- 4.3Mb
Info (Zip)
- 4.3Mb
Search Results
https://dev.mysql.com/doc/refman/8.0/en/innodb-locks-set.html
The locks are normally next-key locks that also block inserts into the “gap” immediately before the record. However, gap locking can be disabled explicitly, which causes next-key locking not to be used. For SERIALIZABLE level, the search sets ...
https://dev.mysql.com/doc/refman/8.0/en/alter-table-partition-operations.html
ALGORITHM=1 causes the server to use the same key-hashing functions as MySQL 5.1 when computing the placement of rows in partitions; ALGORITHM=2 means that the server employs the key-hashing functions implemented and used by default for new KEY ...
https://dev.mysql.com/doc/refman/8.0/en/load-data.html
Unless REPLACE is also specified, LOCAL has the same effect as the IGNORE modifier on the interpretation of input file contents and error handling; see Duplicate-Key and Error Handling, and Column Value Assignment. With IGNORE, new rows that ...The ...
https://dev.mysql.com/doc/refman/8.0/en/invisible-columns.html
Index definitions can name invisible columns, including definitions for PRIMARY KEY and UNIQUE indexes. Foreign key constraints can be defined on invisible columns, and foreign key constraints can reference invisible columns. For statements that ...
https://dev.mysql.com/doc/refman/8.0/en/mysql-cluster-ndbinfo-tc-time-track-stats.html
Each TC instance tracks latencies for a set of activities it undertakes on behalf of API nodes or other data nodes; these activities include transactions, transaction errors, key reads, key writes, unique index operations, failed key operations of ... The tc_time_track_stats table provides time-tracking information obtained from the DBTC block (TC) instances in the data nodes, through API nodes access ...
https://dev.mysql.com/doc/refman/8.0/en/partitioning-hash.html
Partitioning by HASH is used primarily to ensure an even distribution of data among a predetermined number of partitions. Note For simplicity, the tables in the examples that follow do not use any keys. You should be aware that, if a table has any ...To partition a table using HASH partitioning, it is necessary to append to the CREATE TABLE statement a PARTITION BY HASH (expr) clause, where expr is an expression that returns an ...
https://dev.mysql.com/doc/refman/8.0/en/create-table-secondary-indexes.html
The data length of logged values is limited by the index key limit of 767 bytes for COMPACT and REDUNDANT row formats, and 3072 bytes for DYNAMIC and COMPRESSED row formats. row *************************** id: 1 select_type: SIMPLE table: jemp ...A ...
https://dev.mysql.com/doc/refman/8.0/en/innodb-and-mysql-replication.html
A transaction that fails (for example, because of a foreign key violation, or because it is rolled back) is not written to the binary log, so it is not sent to replicas. Cascading actions for InnoDB tables on the source are executed on the replica ... It is possible to use replication in a way where the storage engine on the replica is not the same as the storage engine on the ...
https://dev.mysql.com/doc/refman/8.0/en/encryption-functions.html
One way to make collisions detectable is to make the hash column a primary key. AES_DECRYPT(crypt_str,key_str[,init_vector][,kdf_name][,salt][,info | iterations]) This function decrypts data using the official AES (Advanced Encryption Standard) ...
https://dev.mysql.com/doc/refman/8.0/en/innodb-best-practices.html
Specify a primary key for every table using the most frequently queried column or columns, or an auto-increment value if there is no obvious primary key. For fast join performance, define foreign keys on the join columns, and declare those columns ...Use joins wherever data is pulled from multiple tables based on identical ID values from those ...