From: | Alexander Korotkov <aekorotkov(at)gmail(dot)com> |
---|---|
To: | PostgreSQL - Hans-Jürgen Schönig <postgres(at)cybertec(dot)at> |
Cc: | Heikki Linnakangas <hlinnakangas(at)vmware(dot)com>, PostgreSQL-development <pgsql-hackers(at)postgresql(dot)org> |
Subject: | Re: Small GIN optimizations (after 9.4) |
Date: | 2014-02-09 10:17:12 |
Message-ID: | CAPpHfduSEOAjDju9GBhBaiVczO25FB3md+U6z2VAGJJbLLBA=g@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On Thu, Feb 6, 2014 at 8:31 PM, PostgreSQL - Hans-Jürgen Schönig <
postgres(at)cybertec(dot)at> wrote:
> i think there is one more thing which would be really good in GIN and
> which would solve a ton of issues.
> atm GIN entries are sorted by item pointer.
> if we could sort them by a "column" it would fix a couple of real work
> issues such as ...
>
> SELECT ... FROM foo WHERE "tsearch_query" ORDER BY price DESC
> LIMIT 10
>
> ... or so.
> it many cases you want to search for a, say, product and find the cheapest
> / most expensive one.
> if the tsearch_query yields a high number of rows (which it often does)
> the subsequent sort will kill you.
>
This is not intended to be a small change. However, some solution might be
possible in post 9.4 gin improvements or in new secret indexing project
which will be presented at PGCon :-)
------
With best regards,
Alexander Korotkov.
From | Date | Subject | |
---|---|---|---|
Next Message | Alexander Korotkov | 2014-02-09 10:31:19 | Re: Small GIN optimizations (after 9.4) |
Previous Message | Alexander Korotkov | 2014-02-09 10:11:50 | Re: GIN improvements part2: fast scan |