jerryw@tove.cs.umd.edu (Jerry Wieber) (05/30/91)
I am looking for an algorithm that can compress keys without destroying
lexigraphic ordering. A reply to the effect of "this is impossible" is
equally helpful, of course. Any compression, no matter how small, may
be useful. To wit, I have a very large number of variable length keys
from 1 to 64 bytes in length, and I have got to get the size down for
sorting....
All replies gratefully appreciated!
-Jerry
--
__________
UUCP: uunet!cs.umd.edu!jerryw SPOKEN: Jerry Wieber |/ `-. | U of Md
INTERNET: jerryw@cs.umd.edu "Disclaimer" \_|.|-,
` -