Patent ID: 8538929

Claim:
A method comprising: representing a file system as a graph wherein each node in the graph represents a file and each edge in the graph represents file chunks common to the files associated with the nodes connected by each said edge; partitioning the graph into disjoint sub-graphs; if the files and common file chunks respectively represented by the nodes and edges in a first sub-graph fit into a first data storage medium, storing said files and common file chunks in the first data storage medium; if the files and common file chunks respectively represented by the nodes and edges in the first sub-graph do not fit into the first data storage medium, repeatedly partitioning the first sub-graph into disjoint second sub-graphs wherein adjacent nodes in the first sub-graph that have degrees of connectivity above a particular value are in one of the second sub-graphs, wherein degree of connectivity is based on a measure of connectivity among nodes; and storing the files and common file chunks respectively represented by the nodes and edges in said one of the second sub-graphs in a second data storage medium.