On Thu, 3 Aug 2000, Travis Bemann wrote:
> > >
> > > Actually, I was already thinking of using a binary tree.
> > Then you need to do some research on data structures. A binary tree is
> > *not* a scalable datastructure for high volume disk access. Read up on a
> > B+ tree and come back to me.
>
> No, the reason why I want to use a binary tree is to do high speed
> file index lookups. The reason why is that you don't have to compare
> the key you are looking for with each other key for other files until
> you come upon the file the key you have points to. And also, this
> would greatly reduce the time spent in the worst case (which would be
> searching for a nonexistant item with a plain sequential search).
You really need to read a data structures book before arguing with
everyone in a public forum like this. For a start, start reading the
balanced trees chapter of Knuths "Searching and Sorting" and keep on
reading past that into the multi-way tree section.
Ivan...
---------------------------------------------------------------------------
Ivan Pulleyn
4942 N. Winchester Ave. #3
Chicago, IL 60640
ivan at torpid.com
(847) 980-1400
---------------------------------------------------------------------------
_______________________________________________
Freenet-dev mailing list
Freenet-dev at lists.sourceforge.net
http://lists.sourceforge.net/mailman/listinfo/freenet-dev
