Examples of com.sleepycat.je.tree.Tree

• com.sleepycat.je.tree.Tree
  Tree implements the JE B+Tree. A note on tree search patterns: There's a set of Tree.search* methods. Some clients of the tree use those search methods directly, whereas other clients of the tree tend to use methods built on top of search. The semantics of search* are they leave you pointing at a BIN or IN they don't tell you where the reference of interest is. The semantics of the get* methods are: they leave you pointing at a BIN or IN they return the index of the slot of interest they traverse down to whatever level is needed they are built on top of search* methods. For the future: Over time, we need to clarify which methods are to be used by clients of the tree. Preferably clients that call the tree use get*, although their are cases where they need visibility into the tree structure. Also, search* should return the location of the slot to save us a second binary search. Search Method Call Hierarchy ---------------------------- getFirst/LastNode search CALLED BY: CursorImpl.getFirstOrLast getNext/PrevBin getParentINForChildIN searchSubTree CALLED BY: DupConvert CursorImpl.getNext getParentINForChildIN IN.findParent does not use shared latching CALLED BY: Checkpointer.flushIN (doFetch=false, targetLevel=-1) FileProcessor.processIN (doFetch=true, targetLevel=LEVEL) Evictor.evictIN (doFetch=true, targetLevel=-1) RecoveryManager.replaceOrInsertChild (doFetch=true, targetLevel=-1) getNext/PrevBin (doFetch=true, targetLevel=-1) search searchSubTree CALLED BY: CursorImpl.searchAndPosition INCompressor to find BIN searchSubTree uses shared grandparent latching getParentBINForChildLN searchSplitsAllowed CALLED BY: RecoveryManager.redo RecoveryManager.recoveryUndo search CALLED BY: RecoveryManager.abortUndo RecoveryManager.rollbackUndo FileProcessor.processLN Cleaner.processPendingLN UtilizationProfile.verifyLsnIsObsolete (utility) findBinForInsert searchSplitsAllowed CALLED BY: CursorImpl.putInternal searchSplitsAllowed uses shared non-grandparent latching CALLED BY: DupConvert (instead of findBinForInsert, which needs a cursor) Possible Shared Latching Improvements ------------------------------------- By implementing grandparent latching in searchSplitsAllowed we would increase performance slightly in these cases: Insertions By implementing shared latching in getParentINForChildIN we would get better concurrency in these cases: Cursor scan, when moving between BINs Eviction Checkpoints Cleaning INs By implementing shared latching for BINs we would get better concurrency in these cases: Reads when LN is in cache, or LN is not needed (key-only op, e.g., dups)

Related Classes of com.sleepycat.je.tree.Tree