Re: The cost of visibillity testing? (gin-search) - Mailing list pgsql-hackers

From Tom Lane
Subject Re: The cost of visibillity testing? (gin-search)
Date
Msg-id 8036.1292974672@sss.pgh.pa.us
Whole thread Raw
In response to Re: The cost of visibillity testing? (gin-search)  (Heikki Linnakangas <heikki.linnakangas@enterprisedb.com>)
List pgsql-hackers
Heikki Linnakangas <heikki.linnakangas@enterprisedb.com> writes:
> On 21.12.2010 21:25, Jesper Krogh wrote:
>> Or is a Bitmap Heap Scan simply 3 times faster than a Seq-scan for
>> visibillity-testing?

> It certainly shouldn't be.

>> What have I missed in the logic?

> Perhaps you have a lot of empty space or dead tuples that don't match 
> the query in the table, which the sequential scan has to grovel through, 
> but the bitmap scan skips? What does EXPLAIN ANALYZE of both queries say?

Another possibility is that the seqscan is slowed by trying to operate
in a limited number of buffers (the buffer strategy stuff).
        regards, tom lane


pgsql-hackers by date:

Previous
From: Robert Haas
Date:
Subject: Re: strncmp->memcmp when we know the shorter length
Next
From: "Kevin Grittner"
Date:
Subject: Re: How much do the hint bits help?