While it's fairly acedemic, I'm interested in your thoughts one why
you'd choose a btree over a hash table.

If, as I am assuming, these are ID cards that are dispensed
sequentually, then at any given time the btree will be unevenly
weighted.  This could lead to very deep, sparse trees that could require
more storage space than a simple linear array.

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.

-Adam

michael brown wrote:

>"Bob Ammerman" wrote:
>
>
>
>
>>Think 'hash table'
>>
>>
>
>I was thinking b-tree.
>
>michael brown
>
>--
>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
>
>
>
>
>

--
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