[HACKERS] bitmap-index-scan faster than seq-scan on full-table-scan (gin index)

2010-05-31 Thread Jesper Krogh
Hi. The test data a set of generated terms using this perl-script http://shrek.krogh.cc/~jesper/build-test.pl and http://shrek.krogh.cc/~jesper/words.txt I have generated a test dataset with an average tsvector length of around 250 and 200.000 tuples in the dataset. Conceptually searching for

Re: [HACKERS] bitmap-index-scan faster than seq-scan on full-table-scan (gin index)

2010-05-31 Thread Tom Lane
Jesper Krogh jes...@krogh.cc writes: Conceptually searching for the full dataset would always be fastest solved by a seq-scan. The query planner enforces this so much, so not even enable_seqscan=off can convince it to to something else. ... Would it be possible to implement the Filtering

Re: [HACKERS] bitmap-index-scan faster than seq-scan on full-table-scan (gin index)

2010-05-31 Thread Jesper Krogh
On 2010-05-31 22:09, Tom Lane wrote: Jesper Kroghjes...@krogh.cc writes: Conceptually searching for the full dataset would always be fastest solved by a seq-scan. The query planner enforces this so much, so not even enable_seqscan=off can convince it to to something else. ... Would it be