Search

Download this Manual
PDF (US Ltr) - 43.3Mb
PDF (A4) - 43.4Mb
Man Pages (TGZ) - 297.2Kb
Man Pages (Zip) - 402.5Kb
Info (Gzip) - 4.3Mb
Info (Zip) - 4.3Mb


Displaying 351 to 360 of 474 total results
https://dev.mysql.com/doc/refman/8.0/en/innodb-memcached-internals.html
If there is no such entry, the first entry in the containers table, ordered alphabetically by name (ascending), determines the default InnoDB table. InnoDB API for the InnoDB memcached Plugin The InnoDB memcached engine accesses InnoDB through ...
https://dev.mysql.com/doc/refman/8.0/en/innodb-memcached-porting-memcached.html
This is because InnoDB performs best for large-scale insertions if primary key values are added in sorted order (as they are with auto-increment values). Primary key values are included in secondary indexes, which takes up unnecessary space if the ...
https://dev.mysql.com/doc/refman/8.0/en/innodb-multi-versioning.html
This removal operation is called a purge, and it is quite fast, usually taking the same order of time as the SQL statement that did the deletion. It keeps information about old versions of changed rows to support transactional features such as ...
https://dev.mysql.com/doc/refman/8.0/en/innodb-next-key-locking.html
If one session has a shared or exclusive lock on record R in an index, another session cannot insert a new index record in the gap immediately before R in the index order. The so-called phantom problem occurs within a transaction when the same ...
https://dev.mysql.com/doc/refman/8.0/en/innodb-online-ddl-limitations.html
Secondary indexes are not created as efficiently because keys are inserted in the order they appeared in the primary key. The following limitations apply to online DDL operations: The table is copied when creating an index on a TEMPORARY TABLE. The ...
https://dev.mysql.com/doc/refman/8.0/en/innodb-online-ddl-performance.html
LOCK clauses are described below, in order of least to most restrictive: LOCK=NONE: Permits concurrent queries and DML. Online DDL improves several aspects of MySQL operation: Applications that access the table are more responsive because queries ...
https://dev.mysql.com/doc/refman/8.0/en/innodb-performance-read_ahead.html
Random read-ahead is a technique that predicts when pages might be needed soon based on pages already in the buffer pool, regardless of the order in which those pages were read. A read-ahead request is an I/O request to prefetch multiple pages in ...
https://dev.mysql.com/doc/refman/8.0/en/innodb-transaction-scheduling.html
In some cases, this change may affect the order in which transactions are granted locks. InnoDB uses the Contention-Aware Transaction Scheduling (CATS) algorithm to prioritize transactions that are waiting for locks. When multiple transactions are ...
https://dev.mysql.com/doc/refman/8.0/en/insert.html
If you do not know the order of the columns in the table, use DESCRIBE tbl_name to find out. INSERT [LOW_PRIORITY | DELAYED | HIGH_PRIORITY] [IGNORE] [INTO] tbl_name [PARTITION (partition_name [, partition_name] ...)] [(col_name [, col_name] ...)] ...
https://dev.mysql.com/doc/refman/8.0/en/json-functions.html
Functions that return JSON values always perform normalization of these values (see Normalization, Merging, and Autowrapping of JSON Values), and thus orders them. The functions described in this section perform operations on JSON values. For ...
Displaying 351 to 360 of 474 total results