Re: Generalised approach to storing address details
From: Bob Badour <bbadour_at_pei.sympatico.ca>
Date: Wed, 13 Dec 2006 23:09:01 GMT
Message-ID: <hK%fh.32528$cz.484555_at_ursa-nb00s0.nbnet.nb.ca>
>
> I would agree that trees of various kinds, including B-Trees, do in
> fact form trees.
Date: Wed, 13 Dec 2006 23:09:01 GMT
Message-ID: <hK%fh.32528$cz.484555_at_ursa-nb00s0.nbnet.nb.ca>
Marshall wrote:
> On Dec 13, 8:16 am, "Neo" <neo55..._at_hotmail.com> wrote:
>
[snip]
>>How about B-Trees that are used to implement most relational databases?
>
> I would agree that trees of various kinds, including B-Trees, do in
> fact form trees.
One should point out here that the tree part of a b-tree relates to division of labour and not to logical structure.
The logical structure of the b-tree is still an ordered list with a logical first, logical successors and a logical last. Using any ordered list, one can express other logical iterators such as "least not lesser", "least greater", "greatest lesser", "greatest not greater". The b-tree has performance advantages for the latter sort of iterators, while other ordered lists have performance advantages for the former. Received on Thu Dec 14 2006 - 00:09:01 CET