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-understanding-consistency-guarantees.html
Although Group Replication is written using Group Communication System (GCS) protocols that implement the Paxos algorithm, some parts of Group Replication are asynchronous, which implies that data is asynchronously applied to secondaries. In terms ...
https://dev.mysql.com/doc/refman/8.0/en/index-btree-hash.html
LIKE '%string%' and string is longer than three characters, MySQL uses the Turbo Boyer-Moore algorithm to initialize the pattern for the string and then uses this pattern to perform the search more quickly. Understanding the B-tree and hash data ...
https://dev.mysql.com/doc/refman/8.0/en/information-schema-tables-table.html
The allocation algorithm reserves memory in large amounts to reduce the number of allocation operations. The information_schema_stats_expiry system variable defines the period of time before cached table statistics expire. If there are no cached ...
https://dev.mysql.com/doc/refman/8.0/en/innodb-analyze-table-complexity.html
ANALYZE TABLE complexity for InnoDB tables is dependent on: The number of pages sampled, as defined by innodb_stats_persistent_sample_pages. The number of indexed columns in a table The number of partitions. If a table has no partitions, the number ...
https://dev.mysql.com/doc/refman/8.0/en/innodb-benefits.html
InnoDB tables have the following benefits: If the server unexpectedly exits because of a hardware or software issue, regardless of what was happening in the database at the time, you don't need to do anything special after restarting the database.
https://dev.mysql.com/doc/refman/8.0/en/innodb-compression-tuning.html
The adaptive LRU algorithm attempts to balance the use of memory between compressed and uncompressed pages to take into account whether the workload is running in an I/O-bound or CPU-bound manner. Most often, the internal optimizations described in ...
https://dev.mysql.com/doc/refman/8.0/en/innodb-compression-usage.html
The actual compression algorithm is not affected by the KEY_BLOCK_SIZE value; the value determines how large each compressed chunk is, which in turn affects how many rows can be packed into each compressed page. Compressed tables can be created in ...
https://dev.mysql.com/doc/refman/8.0/en/innodb-deadlocks-handling.html
Note that the InnoDB instant deadlock detection algorithm also works in this case, because the serializing lock is a row-level lock. This section builds on the conceptual information about deadlocks in Section 17.7.5.2, “Deadlock Detection”. It ...
https://dev.mysql.com/doc/refman/8.0/en/innodb-file-defragmenting.html
If the insertions into an index are always ascending and records are deleted only from the end, the InnoDB filespace management algorithm guarantees that fragmentation in the index does not occur. Random insertions into or deletions from a ...
https://dev.mysql.com/doc/refman/8.0/en/innodb-locking.html
Shared and Exclusive Locks Intention Locks Record Locks Gap Locks Next-Key Locks Insert Intention Locks AUTO-INC Locks Predicate Locks for Spatial Indexes Shared and Exclusive Locks InnoDB implements standard row-level locking where there are two ...