[I received this as a newsgroups post on my email account] ??

I've tried it on Spanish, and it works quite nicely, too. It requires two
passes on compression, though (unlike RLE).

I found particular gains by encoding not one character per leaf in the
decoding tree, but character pairs. The tree is much larger, but it doesn't
double, and byte pairs are (on text anyway) very uneven (the ea pair is
found much more often than the Wp, for example, if the latter appears at
all).

Marcelo Lopez Ruiz

Craig Stuntz <ib-architect@...> wrote in message
news:3A12D5B2.D262A27B@no_spam.vertexsoftware.com...

>
> Jason Wharton wrote:
> >
> > Which, leads me to another thought, perhaps we could introduce another
> > algorithm more suited for a string of bytes that don't have lengthy
> > repetitions. One that, like the varchar whitespace removal, takes

advantage

> > of the knowledge of the datatype that it has.
>
> Huffman encoding works very nicely for English text. I don't know how
> useful it would be for mixed languages.
>
> -Craig
>
> --
> Craig Stuntz Vertex Systems Corporation
> Senior Developer http://www.vertexsoftware.com
>
> Delphi/InterBase weblog: http://delphi.weblogs.com
> _______________________________________________
> Ib-architect mailing list
> Ib-architect@...
> http://mers.com/mailman/listinfo/ib-architect
>
> To unsubscribe from this group, send an email to:
> IB-Architect-unsubscribe@onelist.com
>
>
>
>