> Of course, this may be a limitation to my understanding of a btree -
> which is why I'm asking.  I've only implemented very simple trees or
> very complex self-balancing trees.  The self balancing method I used,
> however, would not be well suited to flash storage since more than one
> element in the tree might change for each newly inserted element, and
> the simple tree did not attempt to maintain any balance since
> there were
> no memory bounds in that project.

I implemented a b+ tree once (in my first job fresh from university).
IIRC the algorithm certainly allows for an insert to force updates of
lots of nodes, but there is a statistical average that is much lower.
But sequential inserting might defeat this (the statistics are based on
randomness). IIRC I did something to overcome exactly this.

But as said, when sorted traversal is not needed a hash table is the way
to go.

Wouter van Ooijen

-- -------------------------------------------
Van Ooijen Technische Informatica: www.voti.nl
consultancy, development, PICmicro products

--
http://www.piclist.com hint: The list server can filter out subtopics
(like ads or off topics) for you. See http://www.piclist.com/#topics