Examples of org.chaidb.db.index.btree.BTreePage.search()

Class org.chaidb.db.index.btree.BTreePage

Examples of org.chaidb.db.index.btree.BTreePage.search()

org.chaidb.db.index.btree.BTreePage.search()

Locate the indicated key and return a page/offset pair. Note that this is implicitly recursive; to search for a key, typically have to fetch a new page and invoke this same method on that page.

The search is a simple binary search. If this is an internal page, locate the key preceding (or equal to) the search key, then fetch the corresponding page and recurse. If this is a leaf page, look for an exact match.


            BTreePage rootPage = new BTreePage(id, root, btreeSpec, buffer);
            if (rootPage.getPage() == null) {
                return it;
            }
            BTreeNode n = rootPage.search(key, kContext);
            if (n != null) {
                NodePosition firstNode = new NodePosition(n.getPageNumber().getPageNumber(), n.getDataNodeOffset());
                it.initIterator(firstNode);
            }
            // unfix root and leaf page.

View Full Code Here

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.