Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!uupsi!sunic!news.funet.fi!funic!nntp.hut.fi!nntp!jok From: jok@niksula.hut.fi (Jouni Kosonen) Newsgroups: comp.compression Subject: In Search Of a key compression algorithm! (redirected) Keywords: Non-lexigraphically destructive. Message-ID: Date: 31 May 91 02:54:55 GMT Sender: usenet@nntp.hut.fi (Usenet pseudouser id) Reply-To: jerryw@tove.cs.umd.edu (Jerry Wieber) Followup-To: comp.databases Distribution: comp Organization: Helsinki University of Technology, Finland Lines: 21 Nntp-Posting-Host: batgirl.hut.fi I found this article in alt.comp.compression, and thought that this might be a better place. So, here goes: From: jerryw@tove.cs.umd.edu (Jerry Wieber) Organization: U of Maryland, Dept. of Computer Science, Coll. Pk., MD 20742 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" \_|.|-,