Re: Performance pb vs SQLServer.

From: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
To: "Steinar H(dot) Gunderson" <sgunderson(at)bigfoot(dot)com>
Cc: pgsql-performance(at)postgresql(dot)org
Subject: Re: Performance pb vs SQLServer.
Date: 2005-08-15 01:18:45
Message-ID: 14401.1124068725@sss.pgh.pa.us
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-performance

"Steinar H. Gunderson" <sgunderson(at)bigfoot(dot)com> writes:
> To me, it looks like he'll get 88 rows, not 3.2M. Surely we must be able to
> do something better than a full sequential scan in this case?

Not really. There's been some speculation about implementing index
"skip search" --- once you've verified there's at least one visible
row of a given index value, tell the index to skip to the next different
value instead of handing back any of the remaining entries of the
current value. But it'd be a lot of work and AFAICS not useful for
very many kinds of queries besides this.

regards, tom lane

In response to

Responses

Browse pgsql-performance by date

  From Date Subject
Next Message Steinar H. Gunderson 2005-08-15 01:37:41 Re: Performance pb vs SQLServer.
Previous Message John Arbash Meinel 2005-08-15 01:05:58 Re: Performance pb vs SQLServer.