Re: trees, trees, trees
From: Gerard H. Pille <ghp_at_skynet.be>
Date: Thu, 21 Jun 2012 21:39:34 +0200
Message-ID: <4FE37876.2040808_at_skynet.be>
geos wrote:
> Gerard H. Pille wrote:
>> geos wrote:
>>>
>>> I would appreciate any suggestion how to do this.
>>>
>>
>> Use a tree walk (hierarchical query) to find the parent, if any, and another to find all
>> children of that parent.
>
> yep, it's so easy to write that :) much much easier than to implement acceptable solution based
> on those hierarchical queries and keeping an eye on performance...
>
Date: Thu, 21 Jun 2012 21:39:34 +0200
Message-ID: <4FE37876.2040808_at_skynet.be>
geos wrote:
> Gerard H. Pille wrote:
>> geos wrote:
>>>
>>> I would appreciate any suggestion how to do this.
>>>
>>
>> Use a tree walk (hierarchical query) to find the parent, if any, and another to find all
>> children of that parent.
>
> yep, it's so easy to write that :) much much easier than to implement acceptable solution based
> on those hierarchical queries and keeping an eye on performance...
>
I've been keeping both my eyes on performance in programming for over 35 years now. Of course, I can only do as much as your design allows. Given the correct indexing, tree walks can be performant enough. You wouldn't want me to write the select statement for you, would you? Received on Thu Jun 21 2012 - 14:39:34 CDT