| From: | "David E(dot) Wheeler" <david(at)kineticode(dot)com> |
|---|---|
| To: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
| Cc: | Peter Eisentraut <peter_e(at)gmx(dot)net>, Thorbjørn Weidemann <thorbjoern(at)weidemann(dot)name>, "pgsql-hackers(at)postgresql(dot)org Hackers" <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | Re: citext like searches using index |
| Date: | 2013-04-02 15:59:49 |
| Message-ID: | F6D40F9D-1F61-4B5E-B8FE-9BD670700A62@kineticode.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On Apr 2, 2013, at 8:03 AM, Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> wrote:
>> Are there any widely known non-built-in cases besides citext?
>
> Well, indxpath.c knows about text LIKE and network subset operators,
> and it would be nice if it knew how to do the same type of optimization
> for range inclusion, ie btree_indexed_col <@ range_constant. The latter
> doesn't seem implementable in the current infrastructure because ranges
> aren't all built-in types. I agree that the citext case isn't too
> compelling in isolation, but surely the range case is interesting.
Is this knowledge encapsulated in a to-do?
David
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Jeff Janes | 2013-04-02 16:01:36 | Re: Spin Lock sleep resolution |
| Previous Message | Robert Haas | 2013-04-02 15:54:32 | Re: Page replacement algorithm in buffer cache |