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/explain-output.html
This occurs two ways: If the index is a covering index for the queries and can be used to satisfy all data required from the table, only the index tree is scanned. You can see when an antijoin transformation is performed for a given query by ... The ...
https://dev.mysql.com/doc/refman/8.0/en/myisam-storage-engine.html
Table 18.2 MyISAM Storage Engine Features Feature Support B-tree indexes Yes Backup/point-in-time recovery (Implemented in the server, rather than in the storage engine.) Yes Cluster database support No Clustered indexes No Compressed data Yes ...
https://dev.mysql.com/doc/refman/8.0/en/mysql-indexes.html
Most MySQL indexes (PRIMARY KEY, UNIQUE, INDEX, and FULLTEXT) are stored in B-trees. Exceptions: Indexes on spatial data types use R-trees; MEMORY tables also support hash indexes; InnoDB uses inverted lists for FULLTEXT indexes. Characteristics ...
https://dev.mysql.com/doc/refman/8.0/en/information-schema-innodb-buffer-page-table.html
The INNODB_BUFFER_PAGE table provides information about each page in the InnoDB buffer pool. For related usage information and examples, see Section 17.15.5, “InnoDB INFORMATION_SCHEMA Buffer Pool Tables”. Do not query this table on a ...
https://dev.mysql.com/doc/refman/8.0/en/myisam-key-cache.html
Usually the size of an index block is equal to the size of nodes of the index B-tree. To minimize disk I/O, the MyISAM storage engine exploits a strategy that is used by many database management systems. It employs a cache mechanism to keep the ...
https://dev.mysql.com/doc/refman/8.0/en/column-indexes.html
The B-tree data structure lets the index quickly find a specific value, a set of values, or a range of values, corresponding to operators such as =, >, ≤, BETWEEN, IN, and so on, in a WHERE clause. Other storage engines use B-trees for indexing ...
https://dev.mysql.com/doc/refman/8.0/en/source-installation-methods.html
For information on building from one of the development trees, see Section 2.8.5, “Installing MySQL Using a Development Source Tree”. There are two methods for installing MySQL from source: Use a standard MySQL source distribution. To obtain a ...
https://dev.mysql.com/doc/refman/8.0/en/create-index.html
(USING BTREE is supported as usual.) Spatial Indexes The MyISAM, InnoDB, NDB, and ARCHIVE storage engines support spatial columns such as POINT and GEOMETRY. For example: CREATE TABLE lookup (id INT) ENGINE = MEMORY; CREATE INDEX id_index ON lookup ... CREATE [UNIQUE | FULLTEXT | SPATIAL] INDEX index_name [index_type] ON tbl_name (key_part,...) [index_option] [algorithm_option | lock_option] ...
https://dev.mysql.com/doc/refman/8.0/en/mysql-cluster-general-info.html
For information about obtaining MySQL sources using Git and building them yourself, see Section 2.8.5, “Installing MySQL Using a Development Source Tree”. MySQL NDB Cluster uses the MySQL server with the NDB storage engine. Support for the NDB ...
https://dev.mysql.com/doc/refman/8.0/en/creating-spatial-indexes.html
For storage engines that support nonspatial indexing of spatial columns, the engine creates a B-tree index. A B-tree index on spatial values is useful for exact-value lookups, but not for range scans. For InnoDB and MyISAM tables, MySQL can create ...