Re: Query problem fixed
От | SZUCS Gábor |
---|---|
Тема | Re: Query problem fixed |
Дата | |
Msg-id | 009f01c325ee$63fbdb00$0403a8c0@fejleszt4 обсуждение исходный текст |
Ответ на | Query problem fixed ("Kevin Schroeder" <mirage@mirageworks.com>) |
Список | pgsql-performance |
The thing I can't really understand why can't the planner find out something like this: 1. Index scan using column6 2. Backward search on subset using column3 Any guru to explain? G. ------------------------------- cut here ------------------------------- ----- Original Message ----- From: "Kevin Schroeder" <mirage@mirageworks.com> Sent: Thursday, May 29, 2003 4:09 PM > I figured out how to make the query faster. There should be a mailing list > set up for wasted questions since I always seem to figure out the problem > after I've bugged everyone for help. > > In the query > > select row_key, column1, column2, column3, column4, column5 from table1 > where column6 = 1 order by column3 desc limit 21; > > I changed the index to > > message_index btree (column3, column6) > > rather than > > message_index btree (column6, column3, column7) > > Since the data was being ordered by column3 it seems to have sped the query > up to 1 ms from 6000ms by making column 3 the first part of the index rather > than the second. > > Kevin
В списке pgsql-performance по дате отправления: