Examples of BTree

Home Package Class Method

com.caucho.db.index.BTree
Structure of the table:
```
 b4 - flags b4 - length b8 - parent b8 - next tuples 
```
Structure of a tuple:
```
 b8  - ptr to the actual data key - the tuple's key 
```
For a non-leaf node, the key is the last matching entry in the subtree.
com.db4o.internal.btree.BTree
@exclude
jdbm.btree.BTree
B+Tree persistent indexing data structure. B+Trees are optimized for block-based, random I/O storage because they store multiple keys on one tree node (called BPage). In addition, the leaf nodes directly contain (inline) the values associated with the keys, allowing a single (or sequential) disk read of all the values on the page.
B+Trees are n-airy, yeilding log(N) search cost. They are self-balancing, preventing search performance degradation when the size of the tree grows.
Keys and associated values must be Serializable objects. The user is responsible to supply a serializable Comparator object to be used for the ordering of entries, which are also called Tuple. The B+Tree allows traversing the keys in forward and reverse order using a TupleBrowser obtained from the browse() methods.
This implementation does not directly support duplicate keys, but it is possible to handle duplicates by inlining or referencing an object collection as a value.
There is no limit on key size or value size, but it is recommended to keep both as small as possible to reduce disk I/O. This is especially true for the key size, which impacts all non-leaf BPage objects. @author Alex Boisvert @version $Id: BTree.java,v 1.6 2005/06/25 23:12:31 doomdark Exp $
org.apache.directory.mavibot.btree.BTree
A B-tree interface, to be implemented by the PersistedBTree or the InMemoryBTree @param < K> The Key type @param < V> The Value type @author Apache Directory Project
org.apache.jackrabbit.oak.plugins.index.BTree
A tree allows to query a value for a given key, similar to {@code java.util.SortedMap}.
org.chaidb.db.index.btree.BTree
This class implements Berkeley DB database format.
There are 3 classes:

BTree
Maintains the actual file handle, and answers requests for pages. Auxiliary classes are instantiated with a reference to this class so that they can access the file.
BTreePage
Most database manipulations are handled here. For example, to search, the top-level BTree object fetches the root page (always page 1) from the page file and asks it to search itself. It will go back to the page file to fetch additional pages as needed.
BTreeNode
A fairly simple class that encapsulates the key/data pairs stored in pages.
org.exist.storage.btree.BTree
A general purpose B+-tree which stores binary keys as instances of {@link org.exist.storage.btree.Value}. The actual value data is not stored in the B+tree itself. Instead, we use long pointers to record the storage address of the value. This class has no methods to locate or modify data records. Data handling is in the responsibilty of the proper subclasses: {@link org.exist.storage.index.BFile} and{@link org.exist.storage.dom.DOMFile}. Both, branch and leaf nodes are represented by the inner class {@link org.exist.storage.btree.BTree.BTreeNode}.
org.neo4j.collections.btree.BTree
A b-tree implementation on top of neo4j (using nodes/relationships and properties).
This implementation is not thread safe (yet). This class isn't ready for general usage yet and use of it is discouraged. The implementation isn't thread safe.
org.openrdf.sail.nativerdf.btree.BTree
tvincent.edu/swd/btree/btree.html
http://bluerwhite.org/btree/
http://semaphorecorp.com/btp/algo.html

The first reference was used to implement this class.

TODO: clean up code @author Arjohn Kampman @author Enrico Minack

uk.ac.open.kmi.smartproducts.sesame.sail.btree.BTree

tvincent.edu/swd/btree/btree.html

http://bluerwhite.org/btree/

, and

http://semaphorecorp.com/btp/algo.html

. The first reference was used to implement this class.

TODO: clean up code @author Arjohn Kampman @author Enrico Minack

xbird.storage.index.BTree

BTree represents a Variable Magnitude Simple-Prefix B+Tree File.

@author Makoto YUI (yuin405+xbird@gmail.com)

Examples of com.caucho.db.index.BTree


      Block rootBlock = allocateIndexBlock();
      long rootBlockId = rootBlock.getBlockId();
      rootBlock.free();


      BTree btree = new BTree(this, rootBlockId, column.getLength(),
                              keyCompare);


      column.setIndex(btree);
    }
  }

View Full Code Here

Examples of com.caucho.db.index.BTree

    throws IOException
  {
    Column []columns = _row.getColumns();


    for (int i = 0; i < columns.length; i++) {
      BTree index = columns[i].getIndex();


      if (index == null)
        continue;


      long rootAddr = index.getIndexRoot();


      Block block = readBlock(addressToBlockId(rootAddr));


      try {
        byte []blockBuffer = block.getBuffer();

View Full Code Here

Examples of com.caucho.db.index.BTree

    Column []columns = _row.getColumns();
    for (int i = 0; i < columns.length; i++) {
      if (! columns[i].isUnique())
        continue;


      BTree index = columns[i].getIndex();


      if (index != null) {
        writeLong(os, index.getIndexRoot());
      }
      else {
        writeLong(os, 0);
      }
    }

View Full Code Here

Examples of com.caucho.db.index.BTree

   */
  @Override
  void deleteIndex(DbTransaction xa, byte []block, int rowOffset)
    throws SQLException
  {
    BTree index = getIndex();


    if (index != null)
      index.remove(block, rowOffset + _columnOffset, 4);
  }

View Full Code Here

Examples of com.db4o.internal.btree.BTree

        // overridden in YapObjectCarrier to do nothing
        classCollection().initTables(1);
    }
    
    public final BTree createBTreeClassIndex(int id){
        return new BTree(i_trans, id, new IDHandler(this));
    }

View Full Code Here

Examples of jdbm.btree.BTree


                return set.getFirst();
            }


            // Handle values if they are stored in another BTree
            BTree tree = getBTree( values.getBTreeRedirect() );


            jdbm.helper.Tuple tuple = new jdbm.helper.Tuple();
            TupleBrowser<K, V> browser = tree.browse();
            browser.getNext( tuple );


            return ( V ) tuple.getKey();
        }
        catch ( IOException ioe )

View Full Code Here

Examples of jdbm.btree.BTree

                    return;
                }


                if ( set.size() > numDupLimit )
                {
                    BTree tree = convertToBTree( set );
                    BTreeRedirect redirect = new BTreeRedirect( tree.getRecordId() );
                    bt.insert( key, ( V ) BTreeRedirectMarshaller.INSTANCE.serialize( redirect ), true );


                    if ( LOG.isDebugEnabled() )
                    {
                        LOG.debug( "<--- Add new BTREE {} = {}", name, key );
                    }
                }
                else
                {
                    bt.insert( key, ( V ) marshaller.serialize( set ), true );


                    if ( LOG.isDebugEnabled() )
                    {
                        LOG.debug( "<--- Add AVL {} = {}", name, key );
                    }
                }


                count++;
                commit( recMan );


                return;
            }


            BTree tree = getBTree( values.getBTreeRedirect() );
            replaced = ( V ) tree.insert( value, StringConstants.EMPTY_BYTES, true );


            if ( replaced == null )
            {
                count++;
            }

View Full Code Here

Examples of jdbm.btree.BTree


                return;
            }


            // if the number of duplicates falls below the numDupLimit value
            BTree tree = getBTree( values.getBTreeRedirect() );


            if ( tree.find( value ) != null && tree.remove( value ) != null )
            {
                /*
                 * If we drop below the duplicate limit then we revert from using
                 * a Jdbm BTree to using an in memory AvlTree.
                 */
                if ( tree.size() <= numDupLimit )
                {
                    ArrayTree<V> avlTree = convertToArrayTree( tree );
                    bt.insert( key, ( V ) marshaller.serialize( avlTree ), true );
                    recMan.delete( tree.getRecordId() );
                }


                count--;


                if ( LOG.isDebugEnabled() )

View Full Code Here

Examples of jdbm.btree.BTree


            byte[] serialized = ( byte[] ) returned;


            if ( BTreeRedirectMarshaller.isRedirect( serialized ) )
            {
                BTree tree = getBTree( BTreeRedirectMarshaller.INSTANCE.deserialize( serialized ) );
                this.count -= tree.size();


                if ( LOG.isDebugEnabled() )
                {
                    LOG.debug( "<--- Remove BTree {} = {}", name, key );
                }


                recMan.delete( tree.getRecordId() );
                duplicateBtrees.remove( tree.getRecordId() );


                commit( recMan );


                return;
            }

View Full Code Here

Examples of jdbm.btree.BTree


        byte[] serialized = ( byte[] ) raw;


        if ( BTreeRedirectMarshaller.isRedirect( serialized ) )
        {
            BTree tree = getBTree( BTreeRedirectMarshaller.INSTANCE.deserialize( serialized ) );
            return new KeyTupleBTreeCursor<K, V>( tree, key, valueComparator );
        }


        ArrayTree<V> set = marshaller.deserialize( serialized );

View Full Code Here

0 1 2 3 4 5

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.