Examples of BTreeIndex

com.coyotegulch.jisp.BTreeIndex
org.apache.kahadb.index.BTreeIndex
BTreeIndex represents a Variable Magnitude B+Tree in a Page File. A BTree is a bit flexible in that it can be used for set or map-based indexing. Leaf nodes are linked together for faster iteration of the values.
The Variable Magnitude attribute means that the BTree attempts to store as many values and pointers on one page as is possible.
The implementation can optionally a be Simple-Prefix B+Tree.
For those who don't know how a Simple-Prefix B+Tree works, the primary distinction is that instead of promoting actual keys to branch pages, when leaves are split, a shortest-possible separator is generated at the pivot. That separator is what is promoted to the parent branch (and continuing up the list). As a result, actual keys and pointers can only be found at the leaf level. This also affords the index the ability to ignore costly merging and redistribution of pages when deletions occur. Deletions only affect leaf pages in this implementation, and so it is entirely possible for a leaf page to be completely empty after all of its keys have been removed. , $Date: 2011-02-16 14:58:54 +0100 (Wed, 16 Feb 2011) $

Examples of com.coyotegulch.jisp.BTreeIndex

            {
                getLogger().debug("initialize(): Datafile exists: " + isOld);
            }


            if (!isOld) {
                m_Index = new BTreeIndex(indexFile.toString(),
                                         order, super.getNullKey(), false);
            } else {
                m_Index = new BTreeIndex(indexFile.toString());
            }
            m_Database = new IndexedObjectDatabase(databaseFile.toString(), !isOld);
            m_Database.attachIndex(m_Index);
        } 
        catch (KeyNotFound ignore)

View Full Code Here

Examples of com.coyotegulch.jisp.BTreeIndex

            super.m_Database = new IndexedObjectDatabase(databaseFile.toString(),
                                                         !databaseExists);


            if (!databaseExists) {
                // Create new index
                super.m_Index = new BTreeIndex(indexFile.toString(),
                                               order, super.getNullKey(), false);
            } else {
                // Open existing index
                super.m_Index = new BTreeIndex(indexFile.toString());
            }
            super.m_Database.attachIndex(super.m_Index);
        } catch (KeyNotFound ignore) {
        } catch (Exception e) {
            getLogger().error("Exception during initialization of jisp store.", e);

View Full Code Here

Examples of com.coyotegulch.jisp.BTreeIndex

            if (databaseFile.exists()) {
                if (getLogger().isDebugEnabled()) {
                    this.getLogger().debug("initialize(): Datafile exists");
                }
                mDatabase = new IndexedObjectDatabase(databaseFile.toString(), false);
                mIndex = new BTreeIndex(indexFile.toString());
                mDatabase.attachIndex(mIndex);
            } else {
                if (getLogger().isDebugEnabled()) {
                    this.getLogger().debug("initialize(): Datafile does not exist");
                }
                mDatabase = new IndexedObjectDatabase(databaseFile.toString(), false);
                mIndex = new BTreeIndex(indexFile.toString(),
                                        mOrder, new JispStringKey(), false);
                mDatabase.attachIndex(mIndex);
            }
        } catch (KeyNotFound ignore) {
        } catch (Exception e) {

View Full Code Here

Examples of com.coyotegulch.jisp.BTreeIndex

            indexFile.append(indexDef.getName());


            File killit = new File(indexFile.toString());
            if (killit.exists()) killit.delete();


            final BTreeIndex index = new BTreeIndex(
                    indexFile.toString(),
                    INDEX_ORDER,
                    (KeyObject)factory.newInstance(),
                    false, m_loader);

View Full Code Here

Examples of com.coyotegulch.jisp.BTreeIndex

            final StringBuffer indexFile = new StringBuffer();
            indexFile.append(m_databaseDir);
            indexFile.append(File.separator);
            indexFile.append(indexDef.getName());


            final BTreeIndex index = new BTreeIndex(indexFile.toString(), m_loader);
            indexes.add(index);


            m_jispIndexes.put(indexDef.getName(), index);


            final Class indexType = m_loader.loadClass(

View Full Code Here

Examples of com.coyotegulch.jisp.BTreeIndex

            indexFile.append(indexDef.getName());


            File killit = new File(indexFile.toString());
            if (killit.exists()) killit.delete();


            final BTreeIndex index = new BTreeIndex(
                    indexFile.toString(),
                    INDEX_ORDER,
                    (KeyObject)factory.newInstance(),
                    false, m_loader);

View Full Code Here

Examples of com.coyotegulch.jisp.BTreeIndex

            final StringBuffer indexFile = new StringBuffer();
            indexFile.append(m_databaseDir);
            indexFile.append(File.separator);
            indexFile.append(indexDef.getName());


            final BTreeIndex index = new BTreeIndex(indexFile.toString(), m_loader);
            indexes.add(index);


            m_jispIndexes.put(indexDef.getName(), index);


            final Class indexType = m_loader.loadClass(

View Full Code Here

Examples of com.coyotegulch.jisp.BTreeIndex

            indexFile.append(indexDef.getName());


            File killit = new File(indexFile.toString());
            if (killit.exists()) killit.delete();


            final BTreeIndex index = new BTreeIndex(
                    indexFile.toString(),
                    INDEX_ORDER,
                    (KeyObject)factory.newInstance(),
                    false, m_loader);

View Full Code Here

Examples of com.coyotegulch.jisp.BTreeIndex

            final StringBuffer indexFile = new StringBuffer();
            indexFile.append(m_databaseDir);
            indexFile.append(File.separator);
            indexFile.append(indexDef.getName());


            final BTreeIndex index = new BTreeIndex(indexFile.toString(), m_loader);
            indexes.add(index);


            m_jispIndexes.put(indexDef.getName(), index);


            final Class indexType = m_loader.loadClass(

View Full Code Here

Examples of org.apache.kahadb.index.BTreeIndex

     * @throws Exception
     */
    public void disabled_testTreeBalancing() throws Exception {
        createPageFileAndIndex(100);


        BTreeIndex index = ((BTreeIndex)this.index);
        this.index.load(tx);
        tx.commit();
        
        doInsert(50);
        
        int minLeafDepth = index.getMinLeafDepth(tx);
        int maxLeafDepth = index.getMaxLeafDepth(tx);
        assertTrue("Tree is balanced", maxLeafDepth-minLeafDepth <= 1);


        // Remove some of the data
        doRemove(16);
        minLeafDepth = index.getMinLeafDepth(tx);
        maxLeafDepth = index.getMaxLeafDepth(tx);


        System.out.println( "min:"+minLeafDepth );
        System.out.println( "max:"+maxLeafDepth );
        index.printStructure(tx, new PrintWriter(System.out));


        assertTrue("Tree is balanced", maxLeafDepth-minLeafDepth <= 1);


        this.index.unload(tx);
    }

View Full Code Here

0 1 2

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.