Re: [PERFORM] Planner enhancement suggestion.

2006-03-07 Thread Jim C. Nasby
On Tue, Mar 07, 2006 at 07:09:15PM +0100, PFC wrote: > > >The problem is that you're now talking about doing 2 index scans instead > >of just one and a sort. > > It depends on what you call an index scan : > a- Scanning just the index (no heap lookup) to create a bitmap Sure, and the

Re: [PERFORM] Planner enhancement suggestion.

2006-03-07 Thread PFC
The problem is that you're now talking about doing 2 index scans instead of just one and a sort. It depends on what you call an index scan : a- Scanning just the index (no heap lookup) to create a bitmap b- Scanning the index and hitting the heap in index order to retrieve the

Re: [PERFORM] Planner enhancement suggestion.

2006-03-06 Thread Jim C. Nasby
On Sun, Mar 05, 2006 at 10:00:25PM +0100, PFC wrote: > > Bitmap index scan is bliss. Many thanks to the postgres team ! Now > searching in tables with a lot of fields and conditions is no longer a > pain. > > And just a thought : > > SELECT * FROM table WHERE category IN (1

[PERFORM] Planner enhancement suggestion.

2006-03-05 Thread PFC
Bitmap index scan is bliss. Many thanks to the postgres team ! Now searching in tables with a lot of fields and conditions is no longer a pain. And just a thought : SELECT * FROM table WHERE category IN (1,2,3) ORDER BY price LIMIT 10; Suppose you have an index on catego