Re: Compression related performance

Observation: almost all of the difference in file size 
between the compressed and non-compressed cases
can be accounted for by the free bytes in leaf pages.
Therefore, if the file were to be re-built inserting all the keys
in key sort order, the resulting file (sans compression)
should be quite close in size to the compressed one.
I believe it should be possible to test this theory
using db_dump and db_load back-to-back.

>   436043776 Jan 15 00:00 db.words.db
...
>   113773568 Jan 14 09:36 db.words.db
...
>188M    Number of bytes free in tree leaf pages (57% ff).




-------------------------------------------------------
This SF.Net email is sponsored by: IntelliVIEW -- Interactive Reporting
Tool for open source databases. Create drag-&-drop reports. Save time
by over 75%! Publish reports on the web. Export to DOC, XLS, RTF, etc.
Download a FREE copy at http://www.intelliview.com/go/osdn_nl
_______________________________________________
ht://Dig Developer mailing list:
[email protected]
List information (subscribe/unsubscribe, etc.)
https://lists.sourceforge.net/lists/listinfo/htdig-dev