Science Fair Project Encyclopedia
B*-tree
A B*-tree is a tree data structure, a variety of B-tree that is efficient for searching at the cost of a more expensive insertion. The term is not in general use today; most people use "B-tree" generically to refer to all the variations and refinements of the basic data structure.
See also
10-26-2009 08:16:03
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details


