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 org.openrdf.sail.nativerdf.btree.BTree

        data = iter.next();
      }
      iter.close();


      for (TripleIndex index : indexes) {
        BTree btree = index.getBTree();


        RecordIterator recIter = recordCache.getRecords();
        try {
          while ((data = recIter.next()) != null) {
            btree.remove(data);
          }
        }
        finally {
          recIter.close();
        }

View Full Code Here

Examples of org.openrdf.sail.nativerdf.btree.BTree

    }


    boolean validCache = updatedTriplesCache.isValid();


    for (TripleIndex index : indexes) {
      BTree btree = index.getBTree();


      RecordIterator iter;
      if (validCache) {
        // Use the cached set of updated triples
        iter = updatedTriplesCache.getRecords();
      }
      else {
        // Cache is invalid; too much updates(?). Iterate over all triples
        iter = btree.iterateAll();
      }


      try {
        byte[] data = null;
        while ((data = iter.next()) != null) {
          byte flags = data[FLAG_IDX];
          boolean added = (flags & ADDED_FLAG) != 0;
          boolean removed = (flags & REMOVED_FLAG) != 0;
          boolean toggled = (flags & TOGGLE_EXPLICIT_FLAG) != 0;


          if (removed) {
            // Record has been discarded earlier, do not put it back in!
            continue;
          }


          if (added || toggled) {
            if (toggled) {
              data[FLAG_IDX] ^= EXPLICIT_FLAG;
            }
            if (added) {
              data[FLAG_IDX] ^= ADDED_FLAG;
            }


            if (validCache) {
              // We're iterating the cache
              btree.insert(data);
            }
            else {
              // We're iterating the BTree itself
              iter.set(data);
            }

View Full Code Here

Examples of org.openrdf.sail.nativerdf.btree.BTree

    boolean validCache = updatedTriplesCache.isValid();


    byte txnFlagsMask = ~(ADDED_FLAG | REMOVED_FLAG | TOGGLE_EXPLICIT_FLAG);


    for (TripleIndex index : indexes) {
      BTree btree = index.getBTree();


      RecordIterator iter;
      if (validCache) {
        // Use the cached set of updated triples
        iter = updatedTriplesCache.getRecords();
      }
      else {
        // Cache is invalid; too much updates(?). Iterate over all triples
        iter = btree.iterateAll();
      }


      try {
        byte[] data = null;
        while ((data = iter.next()) != null) {
          byte flags = data[FLAG_IDX];
          boolean removed = (flags & REMOVED_FLAG) != 0;
          boolean toggled = (flags & TOGGLE_EXPLICIT_FLAG) != 0;


          if (removed || toggled) {
            data[FLAG_IDX] &= txnFlagsMask;


            if (validCache) {
              // We're iterating the cache
              btree.insert(data);
            }
            else {
              // We're iterating the BTree itself
              iter.set(data);
            }

View Full Code Here

Examples of org.openrdf.sail.nativerdf.btree.BTree


    public TripleIndex(String fieldSeq)
      throws IOException
    {
      tripleComparator = new TripleComparator(fieldSeq);
      btree = new BTree(dir, getFilenamePrefix(fieldSeq), 2048, RECORD_LENGTH, tripleComparator, forceSync);
    }

View Full Code Here

Examples of org.openrdf.sail.nativerdf.btree.BTree


  public SortedRecordCache(File cacheDir, int recordSize, long maxRecords, RecordComparator comparator)
    throws IOException
  {
    super(maxRecords);
    btree = new BTree(cacheDir, "txncache", 4096, recordSize, comparator);
  }

View Full Code Here

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


  public SortedRecordCache(File cacheDir, int recordSize, long maxRecords, RecordComparator comparator)
    throws IOException
  {
    super(maxRecords);
    btree = new BTree(cacheDir, "txncache", 4096, recordSize, comparator);
  }

View Full Code Here

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


      for (String fieldSeq : addedIndexSpecs) {
        logger.debug("Initializing new index '{}'...", fieldSeq);


        TripleIndex addedIndex = new TripleIndex(fieldSeq);
        BTree addedBTree = addedIndex.getBTree();


        RecordIterator sourceIter = sourceIndex.getBTree().iterateAll();
        try {
          byte[] value = null;
          while ((value = sourceIter.next()) != null) {
            addedBTree.insert(value);
          }
        }
        finally {
          sourceIter.close();
        }

View Full Code Here

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


  protected double cardinality(int subj, int pred, int obj, int context)
    throws IOException
  {
    TripleIndex index = getBestIndex(subj, pred, obj, context);
    BTree btree = index.btree;


    double rangeSize;


    if (index.getPatternScore(subj, pred, obj, context) == 0) {
      rangeSize = btree.getValueCountEstimate();
    }
    else {
      byte[] minValue = getMinValue(subj, pred, obj, context);
      byte[] maxValue = getMaxValue(subj, pred, obj, context);
      rangeSize = btree.getValueCountEstimate(minValue, maxValue);
    }


    return rangeSize;
  }

View Full Code Here

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

      count = (int)removedTriplesCache.getRecordCount();
      updatedTriplesCache.storeRecords(removedTriplesCache);


      // Set the REMOVED flag by overwriting the affected records
      for (TripleIndex index : indexes) {
        BTree btree = index.getBTree();


        RecordIterator recIter = removedTriplesCache.getRecords();
        try {
          while ((data = recIter.next()) != null) {
            btree.insert(data);
          }
        }
        finally {
          recIter.close();
        }

View Full Code Here

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


    // updatedTriplesCache will be null when recovering from a crashed commit
    boolean validCache = updatedTriplesCache != null && updatedTriplesCache.isValid();


    for (TripleIndex index : indexes) {
      BTree btree = index.getBTree();


      RecordIterator iter;
      if (validCache) {
        // Use the cached set of updated triples
        iter = updatedTriplesCache.getRecords();
      }
      else {
        // Cache is invalid; too much updates(?). Iterate over all triples
        iter = btree.iterateAll();
      }


      try {
        byte[] data;
        while ((data = iter.next()) != null) {
          byte flags = data[FLAG_IDX];
          boolean wasAdded = (flags & ADDED_FLAG) != 0;
          boolean wasRemoved = (flags & REMOVED_FLAG) != 0;
          boolean wasToggled = (flags & TOGGLE_EXPLICIT_FLAG) != 0;


          if (wasRemoved) {
            btree.remove(data);
          }
          else if (wasAdded || wasToggled) {
            if (wasToggled) {
              data[FLAG_IDX] ^= EXPLICIT_FLAG;
            }
            if (wasAdded) {
              data[FLAG_IDX] ^= ADDED_FLAG;
            }


            if (validCache) {
              // We're iterating the cache
              btree.insert(data);
            }
            else {
              // We're iterating the BTree itself
              iter.set(data);
            }

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.