Abstract: A method, computer system, and a computer program product for compressing at least one delta file for a plurality of genomic data files is provided. The present invention may include receiving the plurality of genomic data files as input. The present invention may also include determining a plurality of rows by traversing the received plurality of genomic data files. The present invention may then include comparing the plurality of rows associated with the traversed plurality of genomic data files. The present invention may further include generating a plurality of resulting delta files based on the compared plurality of rows. The present invention may also include compressing the generated plurality of resulting delta files by utilizing a general purpose file compressor.

Abstract: A method, computer system, and a computer program product for compressing at least one delta file for a plurality of genomic data files is provided. The present invention may include receiving the plurality of genomic data files as input. The present invention may also include determining a plurality of rows by traversing the received plurality of genomic data files. The present invention may then include comparing the plurality of rows associated with the traversed plurality of genomic data files. The present invention may further include generating a plurality of resulting delta files based on the compared plurality of rows. The present invention may also include compressing the generated plurality of resulting delta files by utilizing a general purpose file compressor.

Abstract: Embodiments of the invention relate to a method and computer program product for providing a scalable representation of metadata for deduplicated storage systems. The method includes identifying shared data segments that are contained in a plurality of data objects in a deduplicated storage system. A data object centric graph is generated. The generating includes creating vertices that represent the data objects and creating edges between the data objects. An edge connecting two data objects indicates that the two data objects contain at least one shared data segment in common. Each shared data segment between any two data objects is represented by at most one of the edges. At least one of the data objects is manipulated based on the data object centric graph.

Abstract: Embodiments of the invention relate to a method and computer program product for providing a scalable representation of metadata for deduplicated storage systems. The method includes identifying shared data segments that are contained in a plurality of data objects in a deduplicated storage system. A data object centric graph is generated. The generating includes creating vertices that represent the data objects and creating edges between the data objects. An edge connecting two data objects indicates that the two data objects contain at least one shared data segment in common. Each shared data segment between any two data objects is represented by at most one of the edges. At least one of the data objects is manipulated based on the data object centric graph.

Abstract: The invention provides a method for reducing identification of chunk portions in data de-duplication. The method includes detecting sequences of stored identification of chunk portions of at least one data object, indexing the detected stored identification of chunk portions based on a sequence type, encoding first repeated sequences of the stored identifications with a first encoding, encoding second repeated sequences of the stored identifications with a second encoding, and avoiding repeated stored identifications of chunk portions.

Abstract: Embodiments of the invention are directed to streaming virtual machine boot services over a network. An aspect of the invention includes booting a first virtual machine and recording data and metadata from a virtual machine boot image into a virtual machine boot file. The data and metadata are accessed in the process of booting the first virtual machine. The virtual machine boot image has setup information of the virtual machine type of the first virtual machine. The virtual machine boot file is configured for the virtual machine type of the first virtual machine. A descriptor is added to metadata of the virtual machine boot image, which references a location of the virtual machine boot file for the virtual machine type of the first virtual machine.

Abstract: An exemplary embodiment includes partitioning a data message to be communicated from a first data site to a second data site into data chunks; generating a data chunk identifier for each data chunk; determining whether the data chunks are stored at the second data site; when at least one data chunk is not stored at the second data site, adding the data chunk identifier for each data chunk not stored at the second data site to a data structure at the first data site; sending a transformed data message from the first date site to the second data site; wherein, when at least one data chunk is already stored at the second data site, rather than including that data chunk, the transformed data message instead includes at least one tuple to enable the data message to be reconstructed at the second data site without sending the previously stored data chunk, the transformed data message also includes each data chunk not stored at the second data site.

Abstract: Embodiments of the invention relate to co-migration in a shared pool of resources with similarity across data sets of a migrating application. The data sets are processed and profiled. Metadata is reviewed to remove duplicate elements and to distribute the processing load across available nodes. At the same time, a ranking may be assigned to select metadata to support a prioritized migration. Non-duplicate data chunks are migrated across the shared pool of resources responsive to the assigned prioritization.

Abstract: The invention provides a method and apparatus for determining sizing of chunk portions in data de-duplication. The method chunks input data into segments where each segment has a first size, assigns an identifier to each of the data segments, assigns an index to each of the identifiers, creates a suffix structure and a longest common prefix structure from the indexes, detects repeated sequences of indexes and non-repeated indexes from the suffix structure and the longest common prefix structure, determines a second size based on said detected repeated sequences and non-repeated indexes, and chunks the input data into a second plurality of data segments each having the second size.

Abstract: An exemplary embodiment includes partitioning a data message to be communicated from a first data site to a second data site into data chunks; generating a data chunk identifier for each data chunk; determining whether the data chunks are stored at the second data site; when at least one data chunk is not stored at the second data site, adding the data chunk identifier for each data chunk not stored at the second data site to a data structure at the first data site; sending a transformed data message from the first date site to the second data site; wherein, when at least one data chunk is already stored at the second data site, rather than including that data chunk, the transformed data message instead includes at least one tuple to enable the data message to be reconstructed at the second data site without sending the previously stored data chunk, the transformed data message also includes each data chunk not stored at the second data site.

Abstract: The invention provides a method and apparatus for determining sizing of chunk portions in data de-duplication. The method chunks input data into segments where each segment has a first size, assigns an identifier to each of the data segments, assigns an index to each of the identifiers, creates a suffix structure and a longest common prefix structure from the indexes, detects repeated sequences of indexes and non-repeated indexes from the suffix structure and the longest common prefix structure, determines a second size based on said detected repeated sequences and non-repeated indexes, and chunks the input data into a second plurality of data segments each having the second size.

Abstract: The invention provides a method for reducing identification of chunk portions in data de-duplication. The method includes detecting sequences of stored identification of chunk portions of at least one data object, indexing the detected stored identification of chunk portions based on a sequence type, encoding first repeated sequences of the stored identifications with a first encoding, encoding second repeated sequences of the stored identifications with a second encoding, and avoiding repeated stored identifications of chunk portions.

Abstract: A method and apparatus incorporating a binary function correlation of run edges for compressing periodic halftoned digital images while increasing compression ratios over currently known one- and two-dimensional and adaptive arithmetic methods and decreasing the time required to perform the operation. In one embodiment, the invention horizontally encodes an image's run edges located at or near least &tgr; pixels ahead of a reference run edge in raster sequential image data. After the image is divided into lines of digital bits containing digital information indicative of binary values, the lines are encoded. A value for &tgr;—where &tgr; is independent of the width of the image and represents the periodicity for an edge of a run—is selected. Thereafter, run edges located &tgr;±n pixels ahead of a designated run edge of a reference run are encoded.