Re: MIN/MAX optimization for partitioned table

From: Greg Stark <gsstark(at)mit(dot)edu>
To: Alan Li <ali(at)truviso(dot)com>
Cc: pgsql-hackers(at)postgresql(dot)org
Subject: Re: MIN/MAX optimization for partitioned table
Date: 2009-07-17 21:45:59
Message-ID: 407d949e0907171445m5c192ffeqe43f7aef5496acd0@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

Neat! I haven't read the patch yet but I have some questions.

Does this handle the case where some partitions have an index and
others don't? Ie. Does it just apply the regular optimization to each
partition and then slap on the aggregate node? I think that's actually
a realistic case because people often don't have indexes on empty
partitions like the parent partition or a new partition which has just
been added and doesn't have indexes yet.

Is there any overlap with the ordered-append patch which is also in
the pipeline? afaict it covers similar cases but doesn't actually
overlap since the min/max optimization avoids having to do a sort
anywhere.

--
greg
http://mit.edu/~gsstark/resume.pdf

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message David Fetter 2009-07-17 21:57:14 Re: Enhancement - code completion when typing set search_path
Previous Message David Fetter 2009-07-17 21:41:09 Sort commitfest tables