[hfs-user] Algorithm of B* tree Implementation

Simon Bazley <sibaz@sibaz.com> simon@sibaz.com
Mon, 11 Feb 2002 01:43:53 +0000 (GMT)

Having said that, in the Technote covering HFS+ they refer to a book
called Algorithms in C (Addison Wesley), which they say explains B-Trees.
I've not seen it, but I intend to look at it when I can.  Check out the
Tech Note if you're interested.


On Thu, 7 Feb 2002, Entwicklung wrote:

> Biswaroop,
> You'll probably have to come up with an algorithm yourself - based on the general structure of a B* tree as described in the specs.
> There's no such thing as 'the algorithm'. I'm sure all the HFS-implementations on the web generate relatively different images using different approaches (though based on the same underlying principle).
> Once you've read thru' the specs and understood how a B* tree has to be built you'll be in a position to come up with some idea as to how to build it (based on your particular requirements).
> Regards,
> Nandini Hengen
>   ----- Original Message -----
>   From: Biswaroop Banerjee
>   To: hfs-user@lists.mars.org
>   Sent: Thursday, February 07, 2002 11:04 AM
>   Subject: [hfs-user] Algorithm of B* tree Implementation
>   Hi All,
>     Can anybody of you give me the algorithm of implementating a B* tree which is the prominent data structure in a HFS formatted volume.
>   Waiting  for your help.
>    Regards
>   Biswaroop Banerjee.
>   The essence of Success lies in its Struggle
>                                                                    -Bisban