MySQL Forums
Forum List  »  Partitioning

Re: Optimizations on ORDER BY with partitions
Posted by: Mikael Ronström
Date: April 13, 2006 12:09AM

Ok, if I understood you correctly the idea is that several ranges in a
range partitioned table use the same partition. A bit like LIST partitioning
with lists of ranges instead of list of points.

Rgrds Mikael

James Porter wrote:
> The major speed improvement that I see with
> partitioning is the fact that it avoids having to
> do a full table scan for a query. The less data
> that is read, the faster the query. We all know
> the limiting speed factor these days is the hard
> drive.
> By catch-all I was referring to range
> partitioning. If you can create specific
> partitions for common ranges and then use your
> catch all for less common ranges. This pattern
> would make queries for your common ranges fast and
> also speed up queries that operate on one extreme
> of your ranges.

Mikael Ronstrom
Senior Software Architect, MySQL AB
My blog:

Options: ReplyQuote

Written By
Re: Optimizations on ORDER BY with partitions
April 13, 2006 12:09AM

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.