Messages in this thread | | | Date | Thu, 16 Oct 2003 16:18:19 -0400 | From | Jeff Garzik <> | Subject | Re: Transparent compression in the FS |
| |
Robert Love wrote: > On Thu, 2003-10-16 at 14:28, John Bradford wrote: > > >>Surely it's just common sense to say that you have to verify the whole >>block - any algorithm that can compress N values into <N values is >>lossy by definition. A mathematical proof for that is easy. > > > That is the problem. > > But those pushing this approach argue that the chance of collision is > less than the chance of hardware errors, et cetera.
Nod. And there are certainly ways to avoid hash collisions...
Jeff
- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
| |