You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@directory.apache.org by bu...@apache.org on 2013/08/06 14:53:57 UTC

svn commit: r873187 - in /websites/staging/directory/trunk/content: ./ mavibot/index.html

Author: buildbot
Date: Tue Aug  6 12:53:56 2013
New Revision: 873187

Log:
Staging update by buildbot for directory

Modified:
    websites/staging/directory/trunk/content/   (props changed)
    websites/staging/directory/trunk/content/mavibot/index.html

Propchange: websites/staging/directory/trunk/content/
------------------------------------------------------------------------------
--- cms:source-revision (original)
+++ cms:source-revision Tue Aug  6 12:53:56 2013
@@ -1 +1 @@
-1510943
+1510945

Modified: websites/staging/directory/trunk/content/mavibot/index.html
==============================================================================
--- websites/staging/directory/trunk/content/mavibot/index.html (original)
+++ websites/staging/directory/trunk/content/mavibot/index.html Tue Aug  6 12:53:56 2013
@@ -124,7 +124,7 @@
 
 
     <h1 id="apache-mavibotwzxhzdk0">Apache Mavibot&trade;</h1>
-<p>Mavibot is a MVCC B+Tree implementation in Java.</p>
+<p><strong>Mavibot</strong> is a <strong>MVCC B+Tree</strong> implementation in Java.</p>
 <h2 id="btree-basics">Btree basics</h2>
 <p>A <em>Btree</em> is a data structure that stores <em><Key, Value></em> tuples in a tree, with the guarantee that the tree will be ordered, and that the depth of the tree is the same for all the leaves. A <em>Btree</em> has nodes and leaves (with the only exception of a <em>Btree</em> with only a root page). The nodes are used to route to the underlying values, and have children. Leaves don't have children.</p>
 <p>Nodes and leaves have a maximum number of elements stored into them, and when they are full, they are split. If the split is done on a leaf, we may have to reorganize the tree so that either we can move some elements up and keep the tree at the current height, or we may have to reorganize the full tree so that all the leaves are at the same level, which will then be one deeper (if we added some value) than the tree before the split.</p>
@@ -149,7 +149,7 @@
 </ul>
     
         <div class="news"><h1 id="news">News</h1>
-<h2 id="apache-mavibot-has-been-moved-from-apache-labs-to-pache-directory-project-posted-on-august-6th-2013">Apache Mavibot has been moved from Apache Labs to Pache Directory project <em>posted on August 6th, 2013</em></h2></div>
+<h2 id="apache-mavibot-added-to-apache-directory-project-posted-on-august-6th-2013">Apache Mavibot added to Apache Directory project <em>posted on August 6th, 2013</em></h2></div>