In Search Of a key compression algorithm!

Article View: alt.comp.compression

Article #22

Back to alt.comp.compression Previous Next

#22

From: Jerry Wieber
Date: Wed, 29 May 1991 18:38

15 lines
1331 bytes

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"            \_|.|-,  
                                                                     ` -

Technical Details

Message-ID: <35014@mimsy.umd.edu>

Path:

arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!rpi!usc!wuarchive!ukma!usenet.ins.cwru.edu!gatech!udel!haven.umd.edu!mimsy!tove.cs.umd.edu!jerryw

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!rpi!usc!wuarchive!ukma!usenet.ins.cwru.edu!gatech!udel!haven.umd.edu!mimsy!tove.cs.umd.edu!jerryw
From: jerryw@tove.cs.umd.edu (Jerry Wieber)
Newsgroups: alt.comp.compression,comp.databases
Subject: In Search Of a key compression algorithm!
Keywords: Non-lexigraphically destructive.
Message-ID: <35014@mimsy.umd.edu>
Date: 29 May 91 18:38:39 GMT
Sender: news@mimsy.umd.edu
Reply-To: jerryw@tove.cs.umd.edu (Jerry Wieber)
Followup-To: comp.databases
Organization: U of Maryland, Dept. of Computer Science, Coll. Pk., MD 20742
Lines: 15