Re: [PERFORM] Why those queries do not utilize indexes?

2004-08-28 Thread Christopher Kings-Lynne
First things first:  try vacuum full analyze on all the tables involved.
1.	Should I afraid of high cost indexes? Or query will still be very efficient?
Not necessarily.  However, EXPLAIN output is pretty much useless for us 
for helping you.  You need to post EXPLAIN ANALYZE output.

Then, you need to use explain analyze to check the speed difference 
between the index and seq scan versions.  Is the seq scan actually slower?

2.  Postgres does not use the index I need. For my data sets it’s always msgstatus 
index is
narrowest compare with ‘messagesStatus’ one. Is any way to “enforce” to use a 
particular index?
What’s the logic when Postgres chooses one index compare with the other.
It's complicated, but it's based on teh statistics in pg_statistic that 
the vacuum analyze command gathers.

3.	I can change db structure to utilize Postgres specifics if you can tell them to me.
I avoid using int8 and int2 in the first place :)  In PostgreSQL 8.0, 
they will be less troublesome, but I've never seen a need for them!

4.	Also, originally I had “messagesStatus” index having 2 components ( “msgstatus”, “user_id” ).
But query SELECT * FROM messageinfo WHERE msgstatus = 0 did not utilize indexes in this case. It
only worked if both index components are in WHERE part. So I have to remove 2-nd component
“user_id” from messagesStatus index even I wanted it. Is any way that where clause has only 1-st
component but index is utilized? 
So long as your where clause matches a subset of the columns in the 
index in left to right order, the index can be used.  For example, if 
your index is over (a, b, c) then select * where a=1 and b=2; can use 
the index.

Chris
---(end of broadcast)---
TIP 4: Don't 'kill -9' the postmaster


Re: [PERFORM] Why those queries do not utilize indexes?

2004-08-27 Thread Artimenko Igor
I could force Postgres to use the best index by removing condition "msgstatus = CAST( 
0 AS
smallint );" from WHERE clause & set enable_seqscan to off;
Total runtime in this case dropped from 1883 ms ( sequential reads ) to 1.598 ms ( 
best index ).

But unfortunatelly It does not resolve my problem. I can not remove above condition. I 
need to
find a way to use whole condition "WHERE user_id = CAST( 2 AS BIGINT ) and 
msgstatus = CAST( 0
AS smallint );" and still utilyze index.  

Yes you are right. Using "messagesStatus" index is even worse for my data set then 
sequential
scan.

Igor Artimenko

--- Dennis Bjorklund <[EMAIL PROTECTED]> wrote:

> On Fri, 27 Aug 2004, Artimenko Igor wrote:
> 
> > 1. Sequential search and very high cost if set enable_seqscan to on;
> > Seq scan on messageinfo ( cost=0.00..24371.30, rows =36802 )
> > 
> > 2. Index scan but even bigger cost if set enable_seqscan to off;
> > Index “messagesStatus” on messageinfo ( Cost=0.00..27220.72, rows=36802 )
> 
> So pg thinks that a sequential scan will be a little bit faster (The cost 
> is a little bit smaller). If you compare the actual runtimes maybe you 
> will see that pg was right. In this case the cost is almost the same so 
> the runtime is probably almost the same.
> 
> When you have more data pg will start to use the index since then it will 
> be faster to use an index compared to a seq. scan.
> 
> -- 
> /Dennis Björklund
> 
> 




___
Do you Yahoo!?
Win 1 of 4,000 free domain names from Yahoo! Enter now.
http://promotions.yahoo.com/goldrush

---(end of broadcast)---
TIP 2: you can get off all lists at once with the unregister command
(send "unregister YourEmailAddressHere" to [EMAIL PROTECTED])


Re: [PERFORM] Why those queries do not utilize indexes?

2004-08-27 Thread Dennis Bjorklund
On Fri, 27 Aug 2004, Artimenko Igor wrote:

> 1. Sequential search and very high cost if set enable_seqscan to on;
> Seq scan on messageinfo ( cost=0.00..24371.30, rows =36802 )
> 
> 2. Index scan but even bigger cost if set enable_seqscan to off;
> Index “messagesStatus” on messageinfo ( Cost=0.00..27220.72, rows=36802 )

So pg thinks that a sequential scan will be a little bit faster (The cost 
is a little bit smaller). If you compare the actual runtimes maybe you 
will see that pg was right. In this case the cost is almost the same so 
the runtime is probably almost the same.

When you have more data pg will start to use the index since then it will 
be faster to use an index compared to a seq. scan.

-- 
/Dennis Björklund


---(end of broadcast)---
TIP 3: if posting/reading through Usenet, please send an appropriate
  subscribe-nomail command to [EMAIL PROTECTED] so that your
  message can get through to the mailing list cleanly