Pawel Jakub Dawidek wrote:
On Mon, Jan 08, 2007 at 11:00:36AM -0600, [EMAIL PROTECTED] wrote:
I have been looking at zfs source trying to get up to speed on the
internals. One thing that interests me about the fs is what appears to be
a low hanging fruit for block squishing CAS (Content
On 1/10/07, [EMAIL PROTECTED] [EMAIL PROTECTED] wrote:
Dick Davies [EMAIL PROTECTED] wrote on 01/10/2007 05:26:45 AM:
On 08/01/07, [EMAIL PROTECTED] [EMAIL PROTECTED] wrote:
I think that in addition to lzjb compression, squishing blocks that
contain
the same data would buy a lot of space
On Mon, Jan 08, 2007 at 11:00:36AM -0600, [EMAIL PROTECTED] wrote:
I have been looking at zfs source trying to get up to speed on the
internals. One thing that interests me about the fs is what appears to be
a low hanging fruit for block squishing CAS (Content Addressable Storage).
I think
Dick Davies [EMAIL PROTECTED] wrote on 01/10/2007 05:26:45 AM:
On 08/01/07, [EMAIL PROTECTED] [EMAIL PROTECTED] wrote:
I think that in addition to lzjb compression, squishing blocks that
contain
the same data would buy a lot of space for administrators working in
many
common
I have been looking at zfs source trying to get up to speed on the
internals. One thing that interests me about the fs is what appears to be
a low hanging fruit for block squishing CAS (Content Addressable Storage).
I think that in addition to lzjb compression, squishing blocks that contain
[EMAIL PROTECTED] wrote:
I have been looking at zfs source trying to get up to speed on the
internals. One thing that interests me about the fs is what appears to be
a low hanging fruit for block squishing CAS (Content Addressable Storage).
I think that in addition to lzjb compression,
Note that you'd actually have to verify that the blocks were the same;
you cannot count on the hash function. If you didn't do this, anyone
discovering a collision could destroy the colliding blocks/files.
Given that nobody knows how to find sha256 collisions, you'd of course
need to test
Does this seem feasible? Are there any blocking points that I am
missing
or unaware of? I am just posting this for discussion, it seems very
interesting to me.
Note that you'd actually have to verify that the blocks were the same;
you cannot count on the hash function. If you
[EMAIL PROTECTED] wrote:
Does this seem feasible? Are there any blocking points that I am
missing
or unaware of? I am just posting this for discussion, it seems very
interesting to me.
Note that you'd actually have to verify that the blocks were the same;
you
Bill Sommerfeld [EMAIL PROTECTED] wrote on 01/08/2007 03:41:53 PM:
Note that you'd actually have to verify that the blocks were the same;
you cannot count on the hash function. If you didn't do this, anyone
discovering a collision could destroy the colliding blocks/files.
Given that
10 matches
Mail list logo
