Re: [GENERAL] Select performance variation based on the different combinations of using where lower(), order by, and limit

2013-08-18 Thread Tyler Reese
On Sun, Aug 18, 2013 at 10:33 PM, Kevin Grittner wrote: > Tyler Reese wrote: > > Kevin Grittner wrote: > >> Tyler Reese wrote: > > >>> mydb=> explain analyze SELECT * FROM "cdr" WHERE > lower("CallingPartyNumber") = '972

Re: [GENERAL] Select performance variation based on the different combinations of using where lower(), order by, and limit

2013-08-18 Thread Tyler Reese
ed all of the indexes and recreated them just to see what would happen. I wouldn't think that recreating the indexes would cause case 4 to go slow, but that's the symptom I am seeing now. Should I be running analyze on a table after it has been reindexed? On Sun, Aug 18, 2013 at 3:02 PM, Ke

[GENERAL] Select performance variation based on the different combinations of using where lower(), order by, and limit

2013-08-16 Thread Tyler Reese
I have a table that has around 8 million rows. The table has 71 columns and 33 indexes. The relevant indexes are: "callingpartynumber" btree ("CallingPartyNumber") "callingpartynumber_lower" btree (lower("CallingPartyNumber") text_pattern_ops) My question is about the explain analyze output, bel