From: David B. <dav...@bo...> - 2005-01-26 06:16:01
|
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). |