Okay thanks.
That's what I wanted to know.
Janek Sendrowski
--
Sent via pgsql-performance mailing list (pgsql-performance@postgresql.org)
To make changes to your subscription:
http://www.postgresql.org/mailpref/pgsql-performance
"Janek Sendrowski" writes:
> Sorry, I still wanted to add following link:
> http://www.sai.msu.su/~megera/postgres/talks/Full-text%20search%20in%20PostgreSQL%20in%20milliseconds-extended-version.pdf
Oh ... well, that's not Postgres documentation; that's Oleg and Alexander
giving a paper about so
Sorry, I still wanted to add following link:
http://www.sai.msu.su/~megera/postgres/talks/Full-text%20search%20in%20PostgreSQL%20in%20milliseconds-extended-version.pdf
On page 6 you can see the first example:
"postgres=# explain analyze
SELECT docid, ts_rank(text_vector, to_tsquery('english', 'ti
Craig James writes:
> A GIST is a tree, but there's no notion of ">" or "<", only yes/no at each
> tree branch. In this regard a GIST index is more like a hash table. You
> can't use a hash table to sort. It doesn't make sense.
Recent versions of PG do allow GIST indexes to be used to satisfy
On Wed, Dec 11, 2013 at 2:29 PM, Janek Sendrowski wrote:
> Hi,
>
> How can I use this ORDER BY using index feature presented in this
> implementation.
> It doesn't seem to be in use, when I have a look in my query plan.
> It still does an cost intensive Bitmap Heap Scan and a Bitmap Index scan.
>
"Janek Sendrowski" writes:
> How can I use this ORDER BY using index feature presented in this
> implementation.
> It doesn't seem to be in use, when I have a look in my query plan.
> It still does an cost intensive Bitmap Heap Scan and a Bitmap Index scan.
> I also can't find the "><" operator i
