Package org.apache.derby.impl.store.access.sort

Class Summary
ExternalSortFactory  
MergeInserter  
MergeScan A sort scan that is capable of merging as many merge runs as will fit in the passed-in sort buffer.
MergeScanRowSource Wrapping the output of a MergeScan in a RowSource for the benefit of the createAndLoadConglomerate and loadConglomerate interface.
MergeSort A sort implementation which does the sort in-memory if it can, but which can do an external merge sort so that it can sort an arbitrary number of rows.
MergeSortInfo This object provides performance information related to a sort.
Node A node in a balanced binary tree.
NodeAllocator NodeAllocator manages an array of nodes which can be reused.
Scan Abstract base class for all sort classes which return rows from the sort.
SortBuffer This class implements an in-memory ordered set based on the balanced binary tree algorithm from Knuth Vol. 3, Sec. 6.2.3, pp. 451-471.
SortBufferRowSource Wrapping the output of a SortBuffer in a RowSource for the benefit of the createAndLoadConglomerate and loadConglomerate interface.
SortBufferScan A sort scan that just reads rows out of a sorter.
SortScan Abstract base class for merge sort scans.
UniqueWithDuplicateNullsExternalSortFactory Method factory to support sorting of Almost unique index.
UniqueWithDuplicateNullsMergeSort This class extends and customizes MergeSort to support unique indexes with duplicate nulls.
 


Built on Thu 2010-12-23 20:49:13+0000, from revision ???

Apache Derby V10.6 Internals - Copyright © 2004,2007 The Apache Software Foundation. All Rights Reserved.