[EMAIL PROTECTED] wrote:
>
> Yep! ltree is Fst , and i use it at the moment.
>
> But will it work in INGRES,DB2 or ORACLE ?
> what if tommorow my boss ask me to use ORACLE?
>
> I have similar issues in using intarray & arrays in PGSQL
>
> though reasons of shifting to others dbs are dimin
Yep! ltree is Fst , and i use it at the moment.
But will it work in INGRES,DB2 or ORACLE ?
what if tommorow my boss ask me to use ORACLE?
I have similar issues in using intarray & arrays in PGSQL
though reasons of shifting to others dbs are diminishing
with every major release of PG ;-)
Hubert,
> i recently spent some time on tree-structures in sql.
> i started with simple id/parent_id approach, used by nearly everyone,
> then i stopped at joe celko's nested sets, but i found it not very
> usable.
I'll be posting an article on implementing nested set trees "real soon now".
My
While I don't have a time to comment your message I want to point to
contrib/ltree package which is extremely fast :-)
http://www.sai.msu.su/~megera/postgres/gist/ltree
Oleg
On Tue, 3 Sep 2002, Hubert depesz Lubaczewski wrote:
> hi
> i recently spent some time on tree-structures in sql.
hi
i recently spent some time on tree-structures in sql.
i started with simple id/parent_id approach, used by nearly everyone,
then i stopped at joe celko's nested sets, but i found it not very
usable.
then i found my own (maybe someone wrote it before, but i haven't read
it, so idea is mine) way.
