Re: Indexing techniques for hierarchies
From: Kendall <kendallwillets_at_yahoooo.com>
Date: Thu, 20 Dec 2001 19:42:15 -0800
Message-ID: <pan.2001.12.20.19.42.01.606.27046_at_yahoooo.com>
Date: Thu, 20 Dec 2001 19:42:15 -0800
Message-ID: <pan.2001.12.20.19.42.01.606.27046_at_yahoooo.com>
In article <%3sU7.5938$XC5.7898_at_www.newsranger.com>, "vadim Tropashko" <nospam_at_newsranger.com> wrote:
(agreed about the performance of the queries - you can't have it both ways)
>
> Interestingly, recursive query (either Oracle proprietory "connect by",
> or SQL99 recursive SQL) is fast in both cases, assuming that we indexed
> both id and parent_id columns, and that we extract small portion of the
> tree.
>
FWIW I once did an explain plan on a db2 recursive query. It made little sense, and I could find no indication that it was doing a recursive query at all. If I can dig it up I'll post it. I'd be interested to find out the type of search used in these. Received on Fri Dec 21 2001 - 04:42:15 CET