Greg Stark <[EMAIL PROTECTED]> writes:
> Here's a small patch to add the full suite of btree operators for tids
> and the corresponding btree opclass.
Having just felt a need for MAX(tid) and MIN(tid) to look into a
performance issue, I went ahead and committed this. I'm aware that
your later pat
Tom Lane <[EMAIL PROTECTED]> writes:
> Greg Stark <[EMAIL PROTECTED]> writes:
> > Here's a small patch to add the full suite of btree operators for tids and
> > the
> > corresponding btree opclass.
>
> This has been proposed and rejected before, mainly on the basis that
> there's no conceivable
Greg Stark <[EMAIL PROTECTED]> writes:
> Here's a small patch to add the full suite of btree operators for tids and the
> corresponding btree opclass.
This has been proposed and rejected before, mainly on the basis that
there's no conceivable application for an index on TID. What's your
use case?
Greg Stark wrote:
>
> Here's a small patch to add the full suite of btree operators for tids and the
> corresponding btree opclass. This came up a while back on -hackers and a few
> people were interested in it at the time. I just had a need for it again so I
> added it.
>
> I'm not sure how to a
Here's a small patch to add the full suite of btree operators for tids and the
corresponding btree opclass. This came up a while back on -hackers and a few
people were interested in it at the time. I just had a need for it again so I
added it.
I'm not sure how to allocate OIDs. I just looked for
