From: | Peter Eisentraut <peter_e(at)gmx(dot)net> |
---|---|
To: | Hans-Juergen Schoenig <postgres(at)cybertec(dot)at> |
Cc: | pgsql-hackers(at)postgresql(dot)org, Justin <justin(at)emproshunts(dot)com> |
Subject: | Re: Ad Hoc Indexes |
Date: | 2008-02-18 21:45:39 |
Message-ID: | 200802182245.40077.peter_e@gmx.net |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
Hans-Juergen Schoenig wrote:
> this kind of indexing makes sense if you visit the same data over and
> over again. WITH-queries would be an example for that and self joins
> could benefit from the this feature too.
Yes, for joins it is useful. We have hash joins, which are kind of ad hoc
hash indexes. If anyone wants to implement a btree join, that might work. :)
But I think we essentially support what the OP is asking for, it is just
under different labels.
--
Peter Eisentraut
http://developer.postgresql.org/~petere/
From | Date | Subject | |
---|---|---|---|
Next Message | Tom Lane | 2008-02-18 21:58:04 | Re: [HACKERS] deadlock with truncate and foreing keys |
Previous Message | Stephan Szabo | 2008-02-18 21:37:08 | Re: [HACKERS] deadlock with truncate and foreing keys |