protected Key getMax() throws JasDBStorageException { TreeNode node = treeNodes.last(); IndexBlock rightBlock = persister.loadBlock(node.getRight()); if(rightBlock instanceof TreeBlock) { return ((TreeBlock) rightBlock).getMax(); } else { return rightBlock.getLast(); } } }
protected Key getMin() throws JasDBStorageException { TreeNode node = treeNodes.first(); IndexBlock leftBlock = persister.loadBlock(node.getLeft()); if(leftBlock instanceof TreeBlock) { return ((TreeBlock)leftBlock).getMin(); } else { return leftBlock.getFirst(); } }
protected void handleBlockUnderflow() throws JasDBStorageException { if(treeNodes.size() < persister.getMinKeys()) { LOG.debug("Handling block underflow"); TreeBlock parentBlock = (TreeBlock) persister.loadBlock(parentPointer); long leftSibblingPointer = parentBlock.getLeftSibbling(this); long rightSibblingPointer = parentBlock.getRightSibbling(this); TreeBlock leftSibbling = null; TreeBlock rightSibbling = null; if(leftSibblingPointer != -1) { leftSibbling = (TreeBlock) persister.loadBlock(leftSibblingPointer); } if(rightSibblingPointer != -1) { rightSibbling = (TreeBlock) persister.loadBlock(rightSibblingPointer); } if(leftSibbling != null && leftSibbling.size() > persister.getMinKeys()) { handleBorrowLeft(parentBlock, leftSibbling); } else if(rightSibbling != null && rightSibbling.size() > persister.getMinKeys()) { handleBorrowRight(parentBlock, rightSibbling); } else { //nothing to borrow we need to merge handleMerge(parentBlock, leftSibbling, rightSibbling); } } }
@Override public LeaveBlock findFirstLeaveBlock(LockIntentType intentType) throws JasDBStorageException { TreeNode firstNode = treeNodes.first(); IndexBlock block = persister.loadBlock(firstNode.getLeft()); persister.getLockManager().acquireLock(intentType, block); return block.findFirstLeaveBlock(intentType); }
protected void addNodes(List<TreeNode> nodes, Key exclude, long parentBlock) throws JasDBStorageException { for(TreeNode node : nodes) { boolean isExcluded = exclude != null && exclude.equals(node.getKey()); if(parentBlock != -1 && (!isExcluded)) { if(node.getLeft() != -1) { IndexBlock block = persister.loadBlock(node.getLeft()); block.setParentPointer(parentBlock); } if(node.getRight() != -1) { IndexBlock block = persister.loadBlock(node.getRight()); block.setParentPointer(parentBlock); } } if(!isExcluded) { treeNodes.put(node.getKey(), node); } } }
@Override public LeaveBlock findLeaveBlock(LockIntentType intent, Key key) throws JasDBStorageException { TreeNode closestNode = treeNodes.getBefore(key); Key nodeKey = closestNode.getKey(); int compare = key.compareTo(nodeKey); long blockPointer; if(compare <= 0) { blockPointer = closestNode.getLeft(); } else { blockPointer = closestNode.getRight(); } IndexBlock block = persister.loadBlock(blockPointer); persister.getLockManager().acquireLock(intent, block); return block.findLeaveBlock(intent, key); }
this.rootBlock.setModified(true); } else { this.rootBlock = (RootBlock) persister.loadBlock(indexHeader.getHeaderSize());
LeaveBlockImpl rightLeave = null; if(leaveProperties.getPreviousBlock() != -1) { leftLeave = (LeaveBlockImpl) persister.loadBlock(leaveProperties.getPreviousBlock()); rightLeave = (LeaveBlockImpl) persister.loadBlock(leaveProperties.getNextBlock()); TreeBlock parentBlock = (TreeBlock) persister.loadBlock(leaveProperties.getParentPointer()); if(leftLeave != null && leftLeave.getParentPointer() == getParentPointer() && leftLeave.size() > persister.getMinKeys()) { log.debug("Borrowing from left leave");
private void handleBlockOverflow() throws JasDBStorageException { if(leaves.size() > persister.getMaxKeys()) { List<Key>[] splittedKeys = leaves.split(); this.leaves.reset(); /* this block keeps representing the right half, the last current block key == max right */ List<Key> rightKeys = splittedKeys[1]; addKeys(rightKeys); List<Key> leftKeys = splittedKeys[0]; long currentPrevious = leaveProperties.getPreviousBlock(); LeaveBlockImpl leftLeaveBlock = (LeaveBlockImpl) persister.createBlock(BlockTypes.LEAVEBLOCK, leaveProperties.getParentPointer()); leftLeaveBlock.setPrevious(currentPrevious); leftLeaveBlock.setNext(getPosition()); leftLeaveBlock.addKeys(leftKeys); this.recalculateMemorySize(); leftLeaveBlock.recalculateMemorySize(); if(currentPrevious != -1) { //we need to relink, there is a previous block present LeaveBlockImpl previousBlock = (LeaveBlockImpl) persister.loadBlock(currentPrevious); previousBlock.setNext(leftLeaveBlock.getPosition()); } leaveProperties.setPreviousBlock(leftLeaveBlock.getPosition()); TreeBlock parentBlock = (TreeBlock) persister.loadBlock(leaveProperties.getParentPointer()); parentBlock.insertBlock(leftLeaveBlock.getLast(), leftLeaveBlock, this); } }
private void handleBorrowRight(TreeBlock parentBlock, TreeBlock rightSibbling) throws JasDBStorageException { //we can borrow from right TreeNode rightFirstNode = rightSibbling.getNodes().first(); IndexBlock danglingBlock = persister.loadBlock(rightFirstNode.getLeft()); danglingBlock.setParentPointer(getPosition()); Key newKey = getMax(); rightSibbling.removeNodeInternal(rightFirstNode); TreeNode newNode = new TreeNode(newKey, treeNodes.last().getRight(), danglingBlock.getPosition()); treeNodes.put(newKey, newNode); Key parentKey = getMax(); parentBlock.updateBlockPointer(parentKey, getPosition(), rightSibbling.getPosition()); }
private void handleBorrowLeft(TreeBlock parentBlock, TreeBlock leftSibbling) throws JasDBStorageException { //we can borrow from left TreeNode node = leftSibbling.getNodes().last(); //this block needs relinking IndexBlock danglingBlock = persister.loadBlock(node.getRight()); danglingBlock.setParentPointer(getPosition()); Key newKey = leftSibbling.getMax(); leftSibbling.removeNodeInternal(node); TreeNode newNode = new TreeNode(newKey, danglingBlock.getPosition(), treeNodes.first().getLeft()); treeNodes.put(newKey, newNode); parentBlock.updateBlockPointer(leftSibbling.getMax(), leftSibbling.getPosition(), getPosition()); }
long nextBlockPointer = currentBlock.getProperties().getNextBlock(); if(nextBlockPointer > 0) { nextBlock = (LeaveBlock) persister.loadBlock(nextBlockPointer);
private void handleBlockOverflow() throws JasDBStorageException { if(treeNodes.size() > persister.getMaxKeys()) { List<TreeNode>[] blockNodeSplit = treeNodes.split(); List<TreeNode> leftBlockNodes = blockNodeSplit[0]; List<TreeNode> rightBlockNodes = blockNodeSplit[1]; treeNodes.reset(); Key promoteKey = rightBlockNodes.get(0).getKey(); TreeBlock leftBlock = (TreeBlock) persister.createBlock(BlockTypes.NODEBLOCK, getParentPointer()); leftBlock.addNodes(leftBlockNodes, null, leftBlock.getPosition()); if(parentPointer != -1) { //add the nodes, we use -1 as parent does not need to be changed addNodes(rightBlockNodes, promoteKey, getPosition()); TreeBlock parentBlock = (TreeBlock) persister.loadBlock(parentPointer); parentBlock.insertBlock(promoteKey, leftBlock, this); } else { //we are at the root TreeBlock rightBlock = (TreeBlock) persister.createBlock(BlockTypes.NODEBLOCK, getPosition()); rightBlock.addNodes(rightBlockNodes, promoteKey, rightBlock.getPosition()); TreeNode node = new TreeNode(promoteKey, leftBlock.getPosition(), rightBlock.getPosition()); treeNodes.put(node.getKey(), node); } } }
currentLeave = nextBlockPointer != -1 ? (LeaveBlock) persister.loadBlock(nextBlockPointer) : null; if(currentLeave != null) { lockManager.acquireLock(LockIntentType.READ, currentLeave);