Re: Dynamic Partitioning using Segment Visibility Maps - Mailing list pgsql-hackers

From Gokulakannan Somasundaram
Subject Re: Dynamic Partitioning using Segment Visibility Maps
Date
Msg-id 9362e74e0801060313yfb55391y60cb271eb37a34fd@mail.gmail.com
Whole thread Raw
In response to Re: Dynamic Partitioning using Segment Visibility Maps  (Markus Schiltknecht <markus@bluegap.ch>)
List pgsql-hackers


On Jan 6, 2008 4:09 PM, Markus Schiltknecht <markus@bluegap.ch> wrote:
Hi,

Gokulakannan Somasundaram wrote:
>
>
> On Jan 5, 2008 6:15 PM, <tomas@tuxteam.de <mailto:tomas@tuxteam.de >> wrote:
>
>
>     One thought I had back then, with partitioned tables was "gee -- B-tree
>     index is already doing a partition; why do a manual partition on top of
>     that?".
>
> Can you please explain more on what you are trying to say here?

I think this has to do with SE not being of much use for index scans. Or
put it another way: SE is an optimization for sequential scans. For
tables where it works well, it could possibly replace the index entirely.

Without the index, you would rely on SE to always be able to exclude
enough segments, so that the seq scan is less expensive than an index
scan with the following table lookups.

With an index, the planner gets a hard time deciding  between the index
scan and the (possibly SE optimized) seq scan.

That's a good point. But i think Simon is planning not to give the job to the planner, but to the executor. So SE optimization will come into play, only when planner has decided on Sequential scan.

pgsql-hackers by date:

Previous
From: Markus Schiltknecht
Date:
Subject: Re: Dynamic Partitioning using Segment Visibility Maps
Next
From: "Usama Dar"
Date:
Subject: Re: Tuning Postgresql on Windows XP Pro 32 bit