Re: Why does a simple query not use an obvious index?
От | Greg Stark |
---|---|
Тема | Re: Why does a simple query not use an obvious index? |
Дата | |
Msg-id | 87fz65k5sq.fsf@stark.xeocode.com обсуждение исходный текст |
Ответ на | Re: Why does a simple query not use an obvious index? ("Scott Marlowe" <smarlowe@qwest.net>) |
Ответы |
Re: Why does a simple query not use an obvious index?
Re: Why does a simple query not use an obvious index? Re: Why does a simple query not use an obvious index? |
Список | pgsql-performance |
"Scott Marlowe" <smarlowe@qwest.net> writes: > Also, count(*) is likely to always generate a seq scan due to the way > aggregates are implemented currently in pgsql. you might want to try: Huh? I'm curious to know what you're talking about here. > select somefield from sometable where timestampfield > now()-'60 > seconds'::interval > > and count the number of returned rows. If there's a lot, it won't be > any faster, if there's a few, it should be a win. Why would this ever be faster? And how could postgres ever calculate that without doing a sequential scan when count(*) would force it to do a sequential scan? -- greg
В списке pgsql-performance по дате отправления: