On 10 May 2010, at 20:06, Greg Stark wrote: > On Sun, May 9, 2010 at 4:47 PM, Tom Lane <t...@sss.pgh.pa.us> wrote: >> Ovid <curtis_ovid_...@yahoo.com> writes: >>> My apologies. This isn't PG-specific, but since this is running on >>> PostgreSQL 8.4, maybe there are specific features which might help. >>> I have a tree structure in a table and it uses materialized paths to allow >>> me to find children quickly. However, I also need to sort the results >>> depth-first, as one would expect with threaded forum replies. >> >> I think contrib/ltree might help you here. However, it seems to sort >> node names textually rather than numerically, so you might need to >> change it a bit for your own purposes. >> > > That's rather unfortunate. Ltree is awfully convenient and it would be > nice to be able to use it. > > If you just used plain Postgres arrays of integers you would get the > sorting you want. But you lose all the useful ltree operators for > trees.
I recall from the docs that you can create arrays of ltrees. It has some special operators for that. I couldn't figure out what the use case for those ltree-arrays was (the docs are rather sparse), but it might just be what you're looking for. Alban Hertroys -- Screwing up is an excellent way to attach something to the ceiling. !DSPAM:737,4be8791c10411720337464! -- Sent via pgsql-general mailing list (pgsql-general@postgresql.org) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-general
