Posted by Stephen Auerbach on February 18, 2009 at 07:27:18:
Recently I've been dealing with fixing and rebuilding LARGE files. Copying and/or key building large files in Comet takes a LONG LONG time. Hours and Hours and Hours.
Seems I once learned that writing a balanced Index Key Tree in reverse order (highest first) results in a smaller, more compact, more efficient key tree.
Does anyone know if a build from high to low would take less time than a "normal" FIFO build?
I'd test the notion if I could figure our how to sort a test file into descending order. Any ideas??
Each file can be a maximum of 1MB in length Uploaded files will be purged from the server on a regular basis.