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/group-replication-message-compression.html
Group Replication uses the LZ4 compression algorithm to compress messages sent in the group. Note that the maximum supported input size for the LZ4 compression algorithm is 2113929216 bytes. With the LZ4 compression algorithm, do not set a value ...
https://dev.mysql.com/doc/refman/8.0/en/group-replication-single-primary-mode.html
20.1.3.1.1 Primary Election Algorithm The automatic primary member election process involves each member looking at the new view of the group, ordering the potential new primary members, and choosing the member that qualifies as the most suitable.
https://dev.mysql.com/doc/refman/8.0/en/hash-joins.html
A hash join is usually faster than and is intended to be used in such cases instead of the block nested loop algorithm (see Block Nested-Loop Join Algorithm) employed in previous versions of MySQL. Prior to MySQL 8.0.20, a hash join could not be ...
https://dev.mysql.com/doc/refman/8.0/en/innodb-buffer-pool-flushing.html
Adaptive Flushing InnoDB uses an adaptive flushing algorithm to dynamically adjust the rate of flushing based on the speed of redo log generation and the current rate of flushing. The adaptive flushing algorithm helps avoid such scenarios by ...
https://dev.mysql.com/doc/refman/8.0/en/innodb-performance-midpoint_insertion.html
Rather than using a strict LRU algorithm, InnoDB uses a technique to minimize the amount of data that is brought into the buffer pool and never accessed again. For an explanation of the inner workings of the InnoDB buffer pool and specifics about ...The goal is to make sure that frequently accessed (“hot”) pages remain in the buffer pool, even as read-ahead and full table scans bring in new blocks that might or might not be accessed ...
https://dev.mysql.com/doc/refman/8.0/en/mysql-cluster-online-add-node-basics.html
ALGORITHM=INPLACE, REORGANIZE PARTITION statement in the mysql client for each NDBCLUSTER table. REORGANIZE PARTITION ALGORITHM=INPLACE reorganizes partitions but does not reclaim the space freed on the “old” nodes. In this section, we list the ...
https://dev.mysql.com/doc/refman/8.0/en/optimizing-innodb-configuration-variables.html
Controlling the algorithm that determines when InnoDB performs certain types of background writes. The algorithm works for some types of workloads but not others, so you might disable this feature if you observe periodic drops in performance. In ...
https://dev.mysql.com/doc/refman/8.0/en/optimizing-innodb-diskio.html
Review settings for the following configuration options when using non-rotational storage: innodb_checksum_algorithm The crc32 option uses a faster checksum algorithm and is recommended for fast storage systems. This change could cause a performance ... If you follow best practices for database design and tuning techniques for SQL operations, but your database is still slow due to heavy disk I/O activity, consider these disk I/O ...
https://dev.mysql.com/doc/refman/8.0/en/partitioning-management-range-list.html
You can see that this is the case by re-running the previous SELECT query: mysql> SELECT * FROM tr WHERE purchased -> BETWEEN '1995-01-01' AND '1999-12-31'; Empty set (0.00 sec) Note DROP PARTITION is supported by native partitioning in-place APIs ... Adding and dropping of range and list partitions are handled in a similar fashion, so we discuss the management of both sorts of partitioning in this ...
https://dev.mysql.com/doc/refman/8.0/en/performance-schema-binary-log-transaction-compression-stats-table.html
Compressed transactions are grouped by the compression algorithm used, and uncompressed transactions are grouped together with the compression algorithm stated as NONE, so the compression ratio can be calculated. This table shows statistical ...