Scalable graph modeling of metadata for deduplicated storage systems

A computer program product for providing a scalable representation of metadata for a deduplicated storage system, the computer program product comprising:

• a computer readable storage medium having program code embodied therewith, the program code executable by a processor to:
• identify shared data segments that are contained in a plurality of data objects in a deduplicated storage system;
• generate a data object centric graph, the generating comprising:
• creating vertices that represent the data objects;
• and
• creating edges between the data objects, wherein an edge connecting two data objects indicates that the two data objects contain at least one shared data segment in common and each shared data segment between any two of the data objects is represented by at most one of the edges;
• and
• manipulate at least one of the data objects based on the data object centric graph.

A system for providing a scalable representation of metadata for deduplicated storage systems, the system comprising:

• a memory having computer readable computer instructions;
• and
• a processor for executing the computer readable instructions, the instructions including:
• identifying shared data segments that are contained in a plurality of data objects in a deduplicated storage system;
• generating a data object centric graph, the generating comprising:
• creating vertices that represent the data objects;
• and
• creating edges between the data objects, wherein an edge connecting two data objects indicates that the two data objects contain at least one shared data segment in common and each shared data segment between any two of the data objects is represented by at most one of the edges;
• and
• manipulating at least one of the data objects based on the data object centric graph.

A method of providing a scalable representation of metadata for deduplicated storage systems, the method comprising:

• identifying shared data segments that are contained in a plurality of data objects in a deduplicated storage system;
• generating a data segment centric bipartite graph, the generating comprising:
• creating vertices that represent the data objects and the shared data segments;
• and
• creating edges between the data objects and the shared data segments, wherein an edge between a data object and a shared data segment indicates that the data object contains the shared data segment;
• and
• manipulating at least one of the data objects based on the data segment centric bipartite graph.