8.2.1.22 Avoiding Full Table Scans

The table is so small that it is faster to perform a table scan than to bother with a key lookup. This is common for tables with fewer than 10 rows and a short row length.

There are no usable restrictions in the ON or WHERE clause for indexed columns.

You are comparing indexed columns with constant values and MySQL has calculated (based on the index tree) that the constants cover too large a part of the table and that a table scan would be faster. See Section 8.2.1.1, “WHERE Clause Optimization”.

You are using a key with low cardinality (many rows match the key value) through another column. In this case, MySQL assumes that by using the key it probably will do many key lookups and that a table scan would be faster.

Use ANALYZE TABLE tbl_name to update the key distributions for the scanned table. See Section 13.7.3.1, “ANALYZE TABLE Syntax”.

Use FORCE INDEX for the scanned table to tell MySQL that table scans are very expensive compared to using the given index:

See Section 8.9.4, “Index Hints”.

Start mysqld with the --max-seeks-for-key=1000 option or use SET max_seeks_for_key=1000 to tell the optimizer to assume that no key scan causes more than 1,000 key seeks. See Section 5.1.8, “Server System Variables”.