The Problem Space
Let's say you have "news articles" (rows in a table) and want a web page showing the latest ten articles about a particular topic.
Variants on "topic":
⚈ Provider (of news article)
⚈ Manufacturer (of item for sale)
⚈ Ticker (financial stock)
Variants on "news article"
⚈ Item for sale
⚈ Blog comment
⚈ Blog thread
Variants on "latest"
⚈ Publication date (unix_timestamp)
⚈ Most popular (keep the count)
⚈ Most emailed (keep the count)
⚈ Manual ranking (1..10 -- 'top ten')
Variants on "10" - there is nothing sacred about "10" in this discussion.
The Performance Issues
Currently you have a table (or a column) that relates the topic to the article. The SELECT statement to find the latest 10 articles has grown in complexity, and performance is poor. You have focused on what index to add, but nothing seems to work.
⚈ If there are multiple topics for each article, you need a many-to-many table.
⚈ You have a flag "is_deleted" that needs filtering on.
⚈ You want to "paginate" the list (ten articles per page, for as many pages as necessary).
First, let me give you the solution, then I will elaborate on why it works well.
⚈ One new table called, say, Lists.
⚈ Lists has _exactly_ 3 columns: topic, article_id, sequence
⚈ Lists has _exactly_ 2 indexes: PRIMARY KEY(topic, sequence, article_id), INDEX(article_id)
⚈ Only viewable articles are in Lists. (This avoids the filtering on "is_deleted", etc)
⚈ Lists is InnoDB. (This gets "clustering".)
⚈ sequence is typically the date of the article, but could be some other ordering.
⚈ topic could be a string, or could be an id that maps to the 'topic', the choice is not critical to this discussion.
⚈ article_id is a link to the bulky row in another table(s) that provide all the details about the article.
Find the latest 10 articles for a topic:
FROM Articles a
JOIN Lists s ON s.article_id = a.article_id
WHERE s.topic = ?
ORDER BY s.sequence DESC
You must _not_ have any WHERE condition touching columns in Articles.
When you mark an article for deletion; you _must_ remove it from Lists:
DELETE FROM Lists
WHERE article_id = ?;
I emphasize "must" because "deleted" flags and other filtering is often the root of
Why it works
By now, you may have discovered why it works.
The big goal is to minimize the disk hits. Let's itemize how few disk hits are needed. When finding the latest articles with 'normal' code, you will probably find that it is doing significant scans of the Articles table, failing to quickly home in on the 10 rows you want. With this design, there is only one extra disk hit:
⚈ 1 disk hit: 10 adjacent, narrow, rows in Lists -- probably in a single "block".
⚈ 10 disk hits: The 10 articles. (These hits are unavoidable, but may be cached.)
The PRIMARY KEY, and using InnoDB, makes these quite efficient.
OK, you pay for this by removing things that you should avoid.
⚈ 1 disk hit: INDEX(article_id) - finding a few ids
⚈ A few more disk hits to DELETE rows from Lists.
This is a small price to pay -- and you are not paying it while the user is waiting for the page to render.
Contact me by posting a question at MySQL Forums :: Performance
-- Rick James