MySQL Forums
Forum List  »  Performance

Re: 30M rows - is dynamic sorting and selecting even possible?
Posted by: Craig Logan
Date: April 15, 2009 01:37PM

thanks for your very informative post, but let me rephrase my question a bit:

is it possible to build a table and the respective queries selecting data from it in a way that allows fast (<1 second) results and sorting even if you have more than 30M rows in that table?

if not, the only way to do it is some sort of caching anyway (like the pagination table I mentioned), but this would likely lead to an odd update delay to the list that is presented to the user.

the "where you left off" thingy works as I anticipated, but can't be applied here because I'm not always sorting by ids.

I'm using innodb because of the row locking and I also believe I got the idea behind multi column indexes. I will certainly be able to improve the indexes on that table, but will that be enough to get the performance to the level I want?

Options: ReplyQuote




Sorry, you can't reply to this topic. It has been closed.

Content reproduced on this site is the property of the respective copyright holders. It is not reviewed in advance by Oracle and does not necessarily represent the opinion of Oracle or any other party.