Note that there are some explanatory texts on larger screens.

plurals
  1. POWhat are the differences between B-tree and B*-tree, except the requirement for fullness?
    text
    copied!<p>I know about <a href="https://stackoverflow.com/questions/870218/b-trees-b-trees-difference"><strong>this</strong></a> question, but it's about <a href="http://en.wikipedia.org/wiki/B-tree" rel="nofollow noreferrer"><strong>B-tree</strong></a> and <a href="http://en.wikipedia.org/wiki/B+_tree" rel="nofollow noreferrer"><strong>B+-tree</strong></a>. Sorry, if there's similar for <code>B*-tree</code>, but I couldn't find such.</p> <hr> <p>So, what is the difference between these two trees? The <a href="http://en.wikipedia.org/wiki/B*-tree" rel="nofollow noreferrer"><strong>wikipedia article</strong></a> about <code>B*-trees</code> is very short. </p> <p>The only difference, that is noted there, is <code>"non-root nodes to be at least 2/3 full instead of 1/2"</code>. But I guess there's something more.. There could be just one kind of tree - the <code>B-tree</code>, just with different constants (for the fullness of each non-root node), and no two different trees, if this was the only difference, right?</p> <p>Also, one more thing, that made me thing about more differences:</p> <pre><code>"A B*-tree should not be confused with a B+ tree, which is one where the leaf nodes of the tree are chained together in the form of a linked list" </code></pre> <p>So, <code>B+-tree</code> has something really specific - the linked list. What is the specific characteristic of <code>B*-tree</code>, or there isn't such?</p> <hr> <p>Also, there are no any external links/references in the wikipedia's article. Are there any resources at all? Articles, tutorials, anything?</p> <p>Thanks!</p>
 

Querying!

 
Guidance

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload