Examples of org.chaidb.db.index.btree.bufmgr.PageNumber

Package org.chaidb.db.index.btree.bufmgr

Examples of org.chaidb.db.index.btree.bufmgr.PageNumber

org.chaidb.db.index.btree.bufmgr.PageNumber
(file number,page number) reference one page in storagespace.

        OperResult result;


        if (level == endLevel) {
            if (keys[level - 1] == null) {
                deleteSubTreeRecursively(root, level, kContext);
                result = new OperResult(true, new PageNumber(BTreeSpec.INVALID_PAGENO));
            } else result = delete(keys[level - 1], root, kContext);
        } else {
            BTreePage rootPage = getPage(root);
            if (rootPage.getPage() != null) {
                BTreePage leafPage = rootPage.getLeaf(keys[level - 1], kContext, BTreePage.INSERT);

View Full Code Here

        }
    }


    //here all keys beyond key[endLevel] exclusive are not null. While remenat are all null.
    private boolean deleteWithQulifiedKey(Key keys[], int endLevel, KernelContext kContext) throws ChaiDBException {
        PageNumber topRoot = new PageNumber(getTopRoot());
        OperResult result = delete(keys, 1, topRoot, endLevel, kContext);
        if (result.success & result.newRoot != null) updateRootOnMetaPage(result.newRoot, kContext);
        return result.success;
    }

View Full Code Here

        boolean succ = false;
        this.getBTreeSpec().setModified(true);
        for (int retry = 0; retry < BTreeLock.MAX_RETRYS + 1 && !succ; retry++) {
            try {


                PageNumber topRoot = new PageNumber(getTopRoot());


                //here explictly lock metapage again, to implement tree-level lock.
                succ = this.fillKeyAndDelete(tmpKeys, 1, endLevel, topRoot, kContext);
            } catch (ChaiDBException e) {
                if (e.getErrorCode() != ErrorCode.LOCK_NO_GRANT || retry == BTreeLock.MAX_RETRYS) throw e;

View Full Code Here

        ValueList values = new ValueList(false);
//        for (int retry=0;retry<BTreeLock.MAX_RETRYS+1 && !succ; retry++) {
        for (int retry = 0; retry < 3; retry++) {
            try {


                PageNumber topRoot = new PageNumber(getTopRoot());
                rangeLookup(minKeys, maxKeys, 1, topRoot, includeMinKey, includeMaxKey, values, kContext);
            } catch (ChaiDBException e) {
//                if (e.getErrorCode()!=ErrorCode.LOCK_NO_GRANT || retry==BTreeLock.MAX_RETRYS)
//                    throw e;
                if (retry == 2) {

View Full Code Here

        int count = 0;
        while (page.pageNumber.getPageInFile() > BTreeSpec.INVALID_PAGENO) {
            if (layer >= getLayers()) count += page.getCurrNodeNumbers();
            else {
                for (int i = 0; i < page.getCurrNodeNumbers(); i++) {
                    PageNumber newRoot = new PageNumber(ByteTool.bytesToInt(page.getNode(i).getData(kc), 0, btreeSpec.isMsbFirst()));
                    newRoot.setTreeId(id);


                    count += countValuesOfTree(newRoot, layer + 1, kc);
                }
            }
            getBuffer().releasePage(id, page.pageNumber, false);

View Full Code Here

     * @return
     * @throws ChaiDBException
     */
    public int countValues(KernelContext kc) throws ChaiDBException {


        PageNumber root = new PageNumber(getTopRoot());
        return countValuesOfTree(root, 1, kc);
    }

View Full Code Here

        bTree.getBTreeSpec().setRootPageNumber(ByteTool.bytesToInt(metaData, BTreeSpec.ROOT_OFF, bTree.getBTreeSpec().getMsbFirst()));


        bTree.getBTreeSpec().setNodeSize(ByteTool.bytesToInt(metaData, BTreeSpec.NODE_SIZE_OFF, bTree.getBTreeSpec().getMsbFirst()));


        // set latest dataPage PageNumber in bufferedPage
        PageNumber ldpReservedPage = new PageNumber(ByteTool.bytesToInt(metaData, BTreeSpec.LATEST_DATA_PAGE_LIST_OFF, bTree.getBTreeSpec().getMsbFirst()));
        ldpReservedPage.setTreeId(bTree.getBtreeId());


        LinkedList reservedList = new LinkedList();


        if (ldpReservedPage.getPageNumber() > 0) {
            // (page size - page number - next page number) / 4
            int pageTotalSpace = (bTree.getBTreeSpec().getPageSize() - BTreeSpec.PAGENUMBER_BYTE_SIZE - BTreeSpec.PAGENUMBER_BYTE_SIZE) / BTreeSpec.PAGENUMBER_BYTE_SIZE;
            int nextLDPReservedPageNum = ldpReservedPage.getPageNumber();
            byte[] page = bTree.getBuffer().getPage(bTree.getBtreeId(), ldpReservedPage);
            if (page != null) {
                int ldpNumOffset = BTreeSpec.OFF_PAGENUMBER + BTreeSpec.PAGENUMBER_BYTE_SIZE;
                int ldpNum = ByteTool.bytesToInt(page, ldpNumOffset, bTree.getBTreeSpec().getMsbFirst());
                while (nextLDPReservedPageNum > 0) {
                    for (int i = 0; i < ldpNum; i++) {
                        PageNumber latestDataPage = new PageNumber(ByteTool.bytesToInt(page, ldpNumOffset + 4 + i * BTreeSpec.PAGENUMBER_BYTE_SIZE, bTree.getBTreeSpec().getMsbFirst()));
                        latestDataPage.setTreeId(bTree.getBtreeId());
                        bTree.getBuffer().addToLatestDataPageListWhenOpenBTree(bTree.getBtreeId(), latestDataPage);
                    }
                    if ((ldpNum < pageTotalSpace - 1) || (ldpNum == pageTotalSpace)) {
                        nextLDPReservedPageNum = -1;
                    } else {
                        nextLDPReservedPageNum = ByteTool.bytesToInt(page, bTree.getBTreeSpec()
                                .getPageSize() - 4, bTree.getBTreeSpec().getMsbFirst());
                    }
                    /*              this page can't be used because if btree is closed abnormally in the way
                                    metapage contains old info whereas other pages has been updated. Thus maybe
                                    this "ldpReservedPage" is reused and occurs in some BTree(Data)Node's links. Then
                                    btree reopen we read obsolete data from meta page and put this "ldpReservedPage" to
                                    free page list, which later may cause to "Used Freed page" exception. The same
                                    thing happens to pages storing free pages. We prefer to losing these "savePages".
                    */
                    bTree.getBuffer().releasePage(bTree.getBtreeId(), ldpReservedPage, false);
                    reservedList.add(ldpReservedPage);
                    if (nextLDPReservedPageNum > 0) {
                        ldpReservedPage = new PageNumber(nextLDPReservedPageNum);
                        ldpReservedPage.setTreeId(bTree.getBtreeId());
                        page = bTree.getBuffer().getPage(bTree.getBtreeId(), ldpReservedPage);
                        if (page == null) {
                            break;
                        }
                        ldpNum = ByteTool.bytesToInt(page, ldpNumOffset, bTree.getBTreeSpec().getMsbFirst());
                    }
                }
            }
        }


        // set free list in buffererdPage


        int freePageNums = ByteTool.bytesToInt(metaData, BTreeSpec.FREE_PAGE_LIST_OFF, bTree.getBTreeSpec().getMsbFirst());
        if (freePageNums == 0) {
            bTree.getBuffer().setReserveredList(bTree.getBtreeId(), reservedList);
            return;
        }


        logger.debug("freePageNums = " + freePageNums);
        int leftSpace = (bTree.getBTreeSpec().getPageSize() - BTreeSpec.FREE_PAGE_LIST_OFF - 4) / BTreeSpec.PAGENUMBER_BYTE_SIZE;
        int size = (freePageNums <= leftSpace) ? freePageNums : (leftSpace - 1);


        for (int i = 0; i < size; i++) {
            PageNumber freePage = new PageNumber(ByteTool.bytesToInt(metaData, BTreeSpec.FREE_PAGE_LIST_OFF + 4 + i * BTreeSpec.PAGENUMBER_BYTE_SIZE, bTree.getBTreeSpec().getMsbFirst()));
            freePage.setTreeId(bTree.getBtreeId());
            bTree.getBuffer().addToFreeListWhenOpenBTree(bTree.getBtreeId(), freePage);
        }


        if (freePageNums > leftSpace) {
            //(page size - free page number - next page number)/ 4
            int pageTotalSpace = (bTree.getBTreeSpec().getPageSize() - 4 - BTreeSpec.PAGENUMBER_BYTE_SIZE) / BTreeSpec.PAGENUMBER_BYTE_SIZE;


            int nextFPReservedPageNum = ByteTool.bytesToInt(metaData, BTreeSpec.FREE_PAGE_LIST_OFF + 4 + size * BTreeSpec.PAGENUMBER_BYTE_SIZE, bTree.getBTreeSpec().getMsbFirst());
            PageNumber fpReservedPage = new PageNumber(nextFPReservedPageNum);
            fpReservedPage.setTreeId(bTree.getBtreeId());
            byte[] page = bTree.getBuffer().getPage(bTree.getBtreeId(), fpReservedPage);
            if (page != null) {
                int freePageNumOffset = BTreeSpec.OFF_PAGENUMBER + BTreeSpec.PAGENUMBER_BYTE_SIZE;
                int freeNum = ByteTool.bytesToInt(page, freePageNumOffset, bTree.getBTreeSpec().getMsbFirst());
                while (nextFPReservedPageNum > 0) {
                    for (int i = 0; i < freeNum; i++) {
                        PageNumber freePage = new PageNumber(ByteTool.bytesToInt(page, freePageNumOffset + 4 + i * BTreeSpec.PAGENUMBER_BYTE_SIZE, bTree.getBTreeSpec().getMsbFirst()));
                        freePage.setTreeId(bTree.getBtreeId());
                        bTree.getBuffer().addToFreeListWhenOpenBTree(bTree.getBtreeId(), freePage);
                    }
                    if ((freeNum < pageTotalSpace - 1) || (freeNum == pageTotalSpace)) {
                        nextFPReservedPageNum = -1;
                    } else {
                        nextFPReservedPageNum = ByteTool.bytesToInt(page, bTree.getBTreeSpec().getPageSize() - BTreeSpec.PAGENUMBER_BYTE_SIZE, bTree.getBTreeSpec().getMsbFirst());
                    }
                    /* add the page which save freelist to freelist,becuase it's unuseful later */
                    fpReservedPage.setTreeId(bTree.getBtreeId());
                    reservedList.add(fpReservedPage);
                    bTree.getBuffer().releasePage(bTree.getBtreeId(), fpReservedPage, false);
                    if (nextFPReservedPageNum > 0) {
                        fpReservedPage = new PageNumber(nextFPReservedPageNum);
                        fpReservedPage.setTreeId(bTree.getBtreeId());
                        page = bTree.getBuffer().getPage(bTree.getBtreeId(), fpReservedPage);
                        if (page == null) {
                            break;
                        }

View Full Code Here

        BTreePage page = new BTreePage(getBtreeId(), root, getBTreeSpec(), getBuffer());
        while (true) {
            if (page.getPage() == null || page.isLeaf()) {
                return page;
            }
            PageNumber pg = (page.getNode(page.getCurrNodeNumbers() - 1)).getPageNumber();
            getBuffer().releasePage(getBtreeId(), page.pageNumber, false);
            page = new BTreePage(getBtreeId(), pg, getBTreeSpec(), getBuffer());
        }
    }

View Full Code Here

            page = new BTreePage(getBtreeId(), pg, getBTreeSpec(), getBuffer());
        }
    }


    public Key getMinKey() throws ChaiDBException {
        PageNumber root = getBTreeSpec().getRootPageNumber();
        BTreePage page = findLeftMostLeaf(root);
        Key key = (page.getNode(0)).getKey();
        return key;
    }

View Full Code Here

    /**
     * @return null if BTree is empty
     * @throws ChaiDBException
     */
    public Key getMaxKey() throws ChaiDBException {
        PageNumber root = getBTreeSpec().getRootPageNumber();
        BTreePage page = findRightMostLeaf(root);
        Key key = (page.getNode(page.getCurrNodeNumbers() - 1).getKey());
        return key;
    }

View Full Code Here

0 1 2 3 4 5 6 7

TOP

Related Classes of org.chaidb.db.index.btree.bufmgr.PageNumber

org.chaidb.db.index.btree.AbstractBTree

org.chaidb.db.index.btree.BTree

org.chaidb.db.index.btree.BTreeChanges

org.chaidb.db.index.btree.BTreeEnumerator

org.chaidb.db.index.btree.BTreeNode

org.chaidb.db.index.btree.BTreePage

org.chaidb.db.index.btree.BTreeSpec

org.chaidb.db.index.btree.DataNode

org.chaidb.db.index.btree.DataPage

org.chaidb.db.index.btree.Debug

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.