问题
I have a MySQL database with a fairly large table where the products are. Each of them has its own id and categoryId field where there is a category id belongs to this product. Now I have a query that pulls out products from given categories such as:
SELECT * FROM products WHERE categoryId IN ( 1, 2, 3, 4, 5, 34, 6, 7, 8, 9, 10, 11, 12 )
Of course, come a WHERE clause and ORDER BY sort but not in this thing. Let's say that these products is 250k and the visits are over 100k per day. Under such conditions in the table slow_log registered weight of these queries with large generation time.
Do you have any ideas how to optimize the given problem?
Table engine is MyISAM.
回答1:
Index on categoryId won't help in this case, IN (...) queries will produce sequence scan instead of index lookup anyway.
I would consider first redesigning the system to get rid of multiple category select and if it is not appropriate, caching query results.
For example, you can create a helper table items_category_groups(hash, item_id) and after client query on multiple categories hash their combined ids and lookup this table. If not found, make an expensive query and fill this table. If found, make a cheap query joining these tables. Other caching tools like memcached will work too.
来源：https://stackoverflow.com/questions/2408250/optimizing-mysql-queries-with-in-operator