Subject | Re: [firebird-support] Varchar size overhead |
---|---|
Author | Ann W. Harrison |
Post date | 2009-01-22T15:29:40Z |
Ivan Prenosil wrote:
algorithm for duplicates were <n * -1 + 3> for n <=0.
But I don't think it is.
Best,
Ann
> "Ann W. Harrison" wrote:No, and the compression would be slightly better if the
>>
>> Thus the string "abcddddef" becomes <3>abc<-4>d<2>ef
>
> And the range of values in one signed byte is -128..127,
> thus allowing to compress up to 128 same bytes into two.
>
> (can "-1" be used as repeat count ??)
algorithm for duplicates were <n * -1 + 3> for n <=0.
But I don't think it is.
Best,
Ann