On 2005-11-22, at 15:45, Tom Lane wrote:

> "Kevin McArthur" <Kevin@StormTide.ca> writes:
>> This is acceptable to create a unique constraint, however, we
>> cannot mark
>> the column unique, without defining btree operators, which clearly
>> are not
>> possible for sorting. Is there any way to base the operators based
>> on the
>> text representation of the type for strict equality (not to be
>> confused with
>> same or equivilent) and thus use that not as an ordering method,
>> but as a
>> simple equality for uniqueness.
>
> Translation: you do know how to define a sortable order (ie, generate
> the text version and compare); you're just too lazy to create the
> operators to do it ...
We do have WORKING < , > , etc operators, and ::text cast already.
Thing is, can I have btree and gist indexes at the same time ?


--
GJ

"If we knew what we were doing, it wouldn't be called Research, would
it?" - AE




---------------------------(end of broadcast)---------------------------
TIP 5: don't forget to increase your free space map settings

On Tue, Nov 22, 2005 at 04:24:21PM +0100, Grzegorz Jaskiewicz wrote:
> >Translation: you do know how to define a sortable order (ie, generate
> >the text version and compare); you're just too lazy to create the
> >operators to do it ...
> We do have WORKING < , > , etc operators, and ::text cast already.
> Thing is, can I have btree and gist indexes at the same time ?

Sure, did you look at the ltree example someone pointed you to?

Have a nice day,
--
Martijn van Oosterhout <kleptog@svana.org> http://svana.org/kleptog/
> Patent. n. Genius is 5% inspiration and 95% perspiration. A patent is a
> tool for doing 5% of the work and then sitting around waiting for someone
> else to do the other 95% so you can sue them.

-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.0.6 (GNU/Linux)
Comment: For info see http://www.gnupg.org

iD8DBQFDgzuyIB7bNG8LQkwRAscJAJ99N2JiDDr0i6rIkc8s3o Puekaf9wCfcPVb
azDybnPxs3qfCTd7Ses8CDA=
=6wKp
-----END PGP SIGNATURE-----

On Tue, 22 Nov 2005, Grzegorz Jaskiewicz wrote:
> Thing is, can I have btree and gist indexes at the same time ?

no, we have contrib/btree_gist for this


Regards,
Oleg
__________________________________________________ ___________
Oleg Bartunov, sci.researcher, hostmaster of AstroNet,
Sternberg Astronomical Institute, Moscow University (Russia)
Internet: oleg@sai.msu.su, http://www.sai.msu.su/~megera/
phone: +007(095)939-16-83, +007(095)939-23-83

---------------------------(end of broadcast)---------------------------
TIP 1: if posting/reading through Usenet, please send an appropriate
subscribe-nomail command to majordomo@postgresql.org so that your
message can get through to the mailing list cleanly

On 2005-11-22, at 16:39, Martijn van Oosterhout wrote:

> On Tue, Nov 22, 2005 at 04:24:21PM +0100, Grzegorz Jaskiewicz wrote:
>>> Translation: you do know how to define a sortable order (ie,
>>> generate
>>> the text version and compare); you're just too lazy to create the
>>> operators to do it ...
>> We do have WORKING < , > , etc operators, and ::text cast already.
>> Thing is, can I have btree and gist indexes at the same time ?
>
> Sure, did you look at the ltree example someone pointed you to?
>
> Have a nice day,
Ok, I hacked btree for my type, and surely I can have both btree and
gist at the same time on the same column.
/me is now going to have a look on btree_gist.

Thanks folks.

--
GJ

"If we knew what we were doing, it wouldn't be called Research, would
it?" - AE




---------------------------(end of broadcast)---------------------------
TIP 5: don't forget to increase your free space map settings

On Tue, Nov 22, 2005 at 05:14:35PM +0100, Grzegorz Jaskiewicz wrote:
> Ok, I hacked btree for my type, and surely I can have both btree and
> gist at the same time on the same column.
> /me is now going to have a look on btree_gist.

You don't actually have to have a btree defined on your column for
ORDER BY to work, you just need to define a btree OPERATOR CLASS so
that PostgreSQL knows what you mean by "ORDER BY".

Have a nice day,
--
Martijn van Oosterhout <kleptog@svana.org> http://svana.org/kleptog/
> Patent. n. Genius is 5% inspiration and 95% perspiration. A patent is a
> tool for doing 5% of the work and then sitting around waiting for someone
> else to do the other 95% so you can sue them.

-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.0.6 (GNU/Linux)
Comment: For info see http://www.gnupg.org

iD8DBQFDg0StIB7bNG8LQkwRAlfCAJ0U1HWh61E7llmBIUejZq YMFHZr4QCcDQ+b
0jMV5EQzETo1+gN5VIv6xoY=
=gFnW
-----END PGP SIGNATURE-----

On 2005-11-22, at 17:17, Martijn van Oosterhout wrote:

> On Tue, Nov 22, 2005 at 05:14:35PM +0100, Grzegorz Jaskiewicz wrote:
>> Ok, I hacked btree for my type, and surely I can have both btree and
>> gist at the same time on the same column.
>> /me is now going to have a look on btree_gist.
>
> You don't actually have to have a btree defined on your column for
> ORDER BY to work, you just need to define a btree OPERATOR CLASS so
> that PostgreSQL knows what you mean by "ORDER BY".
yep, I know. Thanks.
Anyhow, I wanted to see if having two indexes will make it faster/
slower. and if it is possible in first place.

--
GJ

"If we knew what we were doing, it wouldn't be called Research, would
it?" - AE




---------------------------(end of broadcast)---------------------------
TIP 1: if posting/reading through Usenet, please send an appropriate
subscribe-nomail command to majordomo@postgresql.org so that your
message can get through to the mailing list cleanly