Opttech Sort : Java Glossary

go to home page O words local find full screen, hide local find menu Google search web for more information on this topic jump to foot of page translate this page with Babelfish punctuation 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z (all) ©1996-2009 Roedy Green, Canadian Mind Products
Opttech Sort
née Opt-Tech, If you have too much data to sort to fit in RAM at once, you will need to use an external sort such as Opttech. It works by sorting RAM-fulls of records, then doing an N-way merge on the sorted batches, to create fewer larger sorted batches. Eventually it ends up with one large sorted batch. It can sort tags records even more quickly. Tag records are short records consisting of the sorting key fields plus a reference back to the original record. Abundance uses Op-Tech sort. It rolls itself out to disk, calls in Opt-Tech sort, giving it all of RAM, then rolls itself back in. It is surprisingly fast. Unfortuately it does not currently support Java via the callable interface. You would have to call it via JNI or via exec.

CMP homejump to top You can get the freshest copy of this page from: or possibly from your local J: drive (Java virtual drive/mindprod.com website mirror)
http://mindprod.com/jgloss/opttech.html J:\mindprod\jgloss\opttech.html
CMP logofeedback Please email your feedback for publication, errors, omissions, typos, formatting errors, ambiguities, unclear wording, broken/redirected link reports, suggestions to improve this page or comments to Roedy Green : feedback email
mindprod.com IP:[65.110.21.43]
view BlogYour face IP:[38.107.191.107]
You are visitor number 8,639.