Re: Proper siblings sorting in nested sets model
From: Mikito Harakiri <mikharakiri_at_iahu.com>
Date: Fri, 9 Apr 2004 09:39:51 -0700
Message-ID: <hvAdc.12$zY.111_at_news.oracle.com>
Date: Fri, 9 Apr 2004 09:39:51 -0700
Message-ID: <hvAdc.12$zY.111_at_news.oracle.com>
"Pavel Schevaev" <pacha_shevaev_at_mail.ru> wrote in message
news:320b3b2.0404090545.692729f1_at_posting.google.com...
> Nested sets are just great and i've been using it for quite a while
> already.
> The only inconvenience that popped up lately was that it seems like
> it's impossible to order node siblings by some arbitrary parameter,
> say, alphabetically, in sigle query without any vendor-specific stuff.
Assuming that you have LIST aggregate, then find path from the root to the leaf in the subquery within the "select" clause (does your database support subqueries within the "select" clause?) for each leaf and aggregate those node names with the LIST function. Received on Fri Apr 09 2004 - 18:39:51 CEST