Ludovic Drolez wrote:
>  
> Yes, and that's why a database would be more efficient than hard
> links...
> I've just read that Diligent ProtecTIER can store all the links for a
> 1 PB pool (yes ! peta bytes !), in just 4GB of memory. With the links in 
> memory, they can
> achieve very high backup speeds and doing on the fly deduplication.
> 
> Maybe the way to go for BackupPC ?
> 

Usually if you read the fine print you'll find that the fast block-based 
schemes just hash the blocks and assume that all hash matches are 
identical, and the ones that bother to check for hash collisions aren't 
so fast.

-- 
   Les Mikesell
    lesmikesell AT gmail DOT com

-------------------------------------------------------------------------
This SF.net email is sponsored by the 2008 JavaOne(SM) Conference 
Don't miss this year's exciting event. There's still time to save $100. 
Use priority code J8TL2D2. 
http://ad.doubleclick.net/clk;198757673;13503038;p?http://java.sun.com/javaone
_______________________________________________
BackupPC-users mailing list
BackupPC-users AT lists.sourceforge DOT net
List:    https://lists.sourceforge.net/lists/listinfo/backuppc-users
Wiki:    http://backuppc.wiki.sourceforge.net
Project: http://backuppc.sourceforge.net/