Fetching few sorted records from huge table
===

Let's pretend I have a huge website and a huge table (with some million entries table) with a few columns ("ID", "AuthorID", "Message", "Time" for example) to contain twitter-like messages.

I want to execute the following simple query:

    SELECT * FROM HugeTable ORDER BY Time DESC LIMIT 1,10;

This query shall be executed a lot of times (tens per second). How do I make sure that this query is very fast?

I tought memcached could have been a solution, but new posts are added very quickly, and using memcached I would provide "old" messages to users.

Assume that I have only one mysql server, and it is so good that it can handle all the traffic.

My problem is that the server should take the whole table, sorting that (huge bottleneck here), and then take only the first 10. So, what is the best optimization that I could do? Partitioning maybe? Also, inside the table, newer posts are put on the bottom, so it's safe to assume that a new post will have "ID" and "Time" >= than the previous.

Thanks in advance.

P.S: I'm not an expert of MySql (even though I know the basis), and I have no clue about NoSql methods. If you believe NoSql is the way to suffice my task, then I'm open to learn using something new :)