Re: compressing short XML messages without including dictionary or huffman table

1. I am looking for advice on a general approach to compressing short
messages, to be transmitted without dictionary/table overhead.

I'm no expert, by far... but just a guess... perhaps use the deflate
algorithm, on it's -9 setting. It's a good start.

If your XML was of a specific vocabulary, let's say it was svg files
you were transmitting, you could refer to a specific svg dictionary
for compression. :) Of course, if your XML files are of many different
vocabs.... I don't think this will help you.

I don't understand the sudden large steps up and down in compressed
sizes.

An inefficient algorithm, simply. The code to detect patterns is sub
optimal. It loses patterns and misses them due to limitations of the
code.


.

Relevant Pages

  • Re: BWAAHAHA!!! 51L questions answered...
    ... and therefore be based on an unprocessed algorithm seems to be based more on ... "Playbacks of MCC data from the STS 51-L launch were analyzed by a second ... The SRB data at least from the right SRB ... beyond the timeframe in which either SRB could actually be transmitting ...
    (sci.space.history)
  • Re: Cohens paper on byte order
    ... Couldn't one say the same for the quicksort algorithm, ... bits in the AES document and maps them ... Whether these hardware bits are ... has somehow to observe in transmitting 'any' chunks ...
    (sci.crypt)