A p a c h e    M a v i b o t
                        ----------------------------

               by Emmanuel Lecharny <elecharny at apache.org>


 What is this?
 -------------

Mavibot is a Java implementation of a MVCC B+Tree in Java. The idea is to 
experiment around this data structure, and try some similar algorithms
to get a better perception of the pros and cons of each algorithms.


 Why was it created?
 -------------------

We have been using JDBM for years, as it's an excellent B+Tree implementation
in Java, but it does not offer MVCC support and some new Java API, like the
MemoryMapped files couold improve greatly the performances of such data 
structure.
Many other projects beside ApacheDS may also benefit from such an implementation,
assuming we offer a in-memory version and an on-disk version.

There is also an interesting new algorithm that leverage the new disks we 
now see gaining a lot of traction (SSD), and it would be a perfect labs to 
play around this class of algorithm (namely, Stratified BTrees)


 What comes in the box?
 ----------------------

Mavibot first intent to be a MVCC B+Tree, first in memory, and second
with a backend on disk.

Then we will provide an implementtaion based on the Startified BTree ideas.

The seelcted langage is Java, in version 6 or higher.

 How do I build it ?
 -------------------

This is quite easy : you just need Maven 3 installed locally, and the source code in a directory.

You can download the source code by checking it out with this command :

$ svn co http://svn.apache.org/repos/asf/labs/mavibot/trunk/

and to buid the code, type the following command :

$ cd trunk
$ mvn clean install

That's it !

 how do I try it?
 ----------------

Not yet available

      
                                   - o -


Thanks for your interest in Apache Mavibot.