Abstract: In one embodiment, a biosample storage cartridge includes an enclosure having a same form factor as a data tape cartridge configured for use in an automated tape library; and a holder disposed in the enclosure. In another embodiment, a biosample storage cartridge includes an enclosure and a holder disposed in the enclosure; the holder is configured to receive one or more biosamples, the cartridge is structurally configured to be picked by a picker of an access robot that is configured to pick a data tape cartridge in an automated tape library. In still another embodiment, an analytical system includes a bioanalysis drive configured to perform bioanalysis on one or more biosamples received from at least one biosample storage cartridge.

Abstract: Various embodiments are provided for virtualizing and managing a storage virtualization system (SVS) in a storage management architecture. Source data is copied from the source storage media to target data in a target storage media based on a predefined copy policy in a copy mapping table. A relation between the source data and the target data is tracked in a copy mapping table. It is determined if a copy of the requested data exists using the copy mapping table. Tiered storage policies are configured in a migration mapping table pertaining to the SVS, and a source storage media is mapped to a target storage media and a migration policy.

Abstract: In a data management system, examination of first data for malicious content by a malicious content scanner is initiated in response to a request to write first data to a data storage device. In response to the examination revealing no malicious content in the first data, the first data, a first signature representative of a version of the malicious content scanner at a time of the examination of the first data, and second data linking the first signature to the first data as read-only data are written to the data storage device.

Abstract: Various embodiments for autonomic reclamation of data stored on at least one sequential storage media are provided. In one exemplary embodiment, active data is identified, read out, and stored in a sequential order by starting at a beginning block address of the at least one sequential storage media. At least one of a start address, an end address, and a data length of all original blocks of the active data in a backup application is defined. A new start address for each original block of active data to be written to the backup application is generated. A mapping is yielded and sent from the backup application to a sequential storage media device having the at least one sequential storage media, and the active data is read from each original block address in sequential order.

Abstract: An approach for managing a data package is provided. Network throughput is determined to exceed a threshold. A sender computer determines a hash digest of the data package by using a hash function selected based on central processing unit utilization. If the hash digest is in a sender hash table, then without sending the data package, the sender computer sends the hash digest and an index referring to the hash digest so that a recipient computer can use the index to locate a matching hash digest and the data package in a recipient hash table. If the hash digest is not in the sender hash table, then the sender computer adds the data package and the hash digest to the sender hash table and sends the data package and the hash digest to the second computer to check the integrity of the data package based on the hash digest.

Abstract: Method, data processing systems, and computer program products are provided for virtualizing and managing a storage virtualization system (SVS) in a storage management architecture. Source data is copied from the source storage media to target data in a target storage media based on a predefined copy policy in a copy mapping table. A relation between the source data and the target data is tracked in a copy mapping table. It is determined if a copy of the requested data exists using the copy mapping table.

Abstract: For authorizing removable medium access, a reassembly module retrieves a medium portion of an encryption key from a removable medium. The encryption key encrypts encrypted data stored on the removable medium and includes a plurality of portions. The reassembly module further retrieves the user portion of the encryption key assigned to a user requesting the removable medium. The reassembly module reassembles the encryption key using at least the medium portion and the user portion of the plurality of portions. The decryption module decrypts the encrypted data with the reassembled encryption key.

Abstract: A method for cloud computing comprising collecting cloud computing node status information from a cloud computing node connected to the cloud computing network; collecting cloud computing service status information indicative of an attribute of a cloud computing service executed in the node; collecting environmental data sets from computing systems connected to a network connected to the cloud, each environmental data set corresponding to attribute values of the computing systems; building a group of computing systems; storing the node and cloud service status information, the environmental data sets, and the identical attribute value of each computing system in a database; and responsive to a request for characteristic data from one of the computing systems, selecting the respective characteristic data out of the status information and the environmental data sets in the database and sending the characteristic data over the cloud computing network and the network to the requesting computing system.

Abstract: Various embodiments for autonomic reclamation of data stored on at least one sequential storage media are provided. In one exemplary embodiment, active data stored on the at least one sequential storage media is identified. The active data is read out from a reclamation memory. The active data is stored in a sequential order by starting at a beginning block address of the at least one sequential storage media.

Abstract: For authorizing removable medium access, a reassembly module retrieves a medium portion of an encryption key from a removable medium. The encryption key encrypts encrypted data stored on the removable medium and includes a plurality of portions. The reassembly module further retrieves the user portion of the encryption key assigned to a user requesting the removable medium. The reassembly module reassembles the encryption key using at least the medium portion and the user portion of the plurality of portions. The decryption module decrypts the encrypted data with the reassembled encryption key.

Abstract: Various embodiments for differentiating between data and stubs pointing to a parent copy of deduplicated data. Undeduplicated data is stored with a checksum of an initial value. A stub pointing to the parent copy of the deduplicated data is stored with an additional checksum of a differing, additional initial value.

Abstract: An approach for managing a data package is provided. Network throughput is determined to exceed a threshold. A sender computer determines a hash digest of the data package by using a hash function selected based on central processing unit utilization. If the hash digest is in a sender hash table, then without sending the data package, the sender computer sends the hash digest and an index referring to the hash digest so that a recipient computer can use the index to locate a matching hash digest and the data package in a recipient hash table. If the hash digest is not in the sender hash table, then the sender computer adds the data package and the hash digest to the sender hash table and sends the data package and the hash digest to the second computer to check the integrity of the data package based on the hash digest.

Abstract: For data backup and recovery based on linked file repositories with each of the linked file repositories representing an individual file system capable of storing at least one version of a file and being connected to at least one server system, each of the linked file repositories are placed in a certain position for storing a certain version of the file. Each position of each of the linked file repositories is continuously numbered. A number of the versions of the file are determined by the position of the one of the linked file repositories.

Abstract: Various embodiments for differentiating between data and stubs pointing to a parent copy of deduplicated data are provided. Undeduplicated data is stored with a checksum of an initial value as a first cyclic redundancy check (CRC) seed. A stub pointing to the parent copy of the deduplicated data is stored with an additional checksum of a differing, additional initial value as a second CRC seed.

Abstract: A storage management application determines that a source virtual tape requires reclamation, identifies all block addresses for active data of a source virtual tape and sorts the block addresses in an ascending order, identifies a target virtual tape which has sufficient free capacity to store the active data of said source virtual tape and the last written block address on said target virtual tape, and sends a command to the VTL-system instructing it to perform reclamation including information about said source and said target virtual tape, the sorted list of block addresses denoting active data on the source virtual tape and the starting block address on the target virtual tape. The reclamation logic references the active data host blocks of said source volume to said target virtual tape starting at said starting block address by just updating the host block to disk block mapping table.

Abstract: For data backup and recovery based on linked file repositories with each of the linked file repositories representing an individual file system capable of storing at least one version of a file and being connected to at least one server system, each of the linked file repositories are placed in a certain position for storing a certain version of the file. Each position of each of the linked file repositories is continuously numbered. A number of the versions of the file are determined by the position of the one of the linked file repositories. A version-movement process over each of the linked file repositories is implemented to perform a read operation of the at least one version of the file.

Abstract: The present invention relates to a method for data access in a storage infrastructure. The storage infrastructure comprises a host system connected to at least a first storage system and a second storage system. The first storage system receives, from the host system, a write request for storing a data chunk, the write request is indicative of a first identifier of the data chunk. The first storage system calculates a hash value of the received data chunk using a hash function. The first storage system determines a first storage location in the first storage system of the data chunk and sends a write message including the hash value, the first identifier and the first storage location to the de-duplication module. The de-duplication module determines whether the hash value exists in the data structure.

Abstract: A data storage system includes a data storage array configured for de-duplication of duplicate data therein by: identification of a plurality of portions of data; a comparison of each portion of the data to identify duplicate data and identification of a link associated with each duplicate data; a determination of whether a Hamming link-separation-distance of the identified link is greater than twice a Hamming radius of an error correction code in the data storage system; and replacement of the duplicate data with the identified link when it is determined that the Hamming link-separation-distance is greater than twice the Hamming radius.

Abstract: An approach for managing a data package is provided. Network utilization is determined to exceed a threshold. A sender computer determines a hash digest of the data package by using a hash function selected based on central processing unit utilization. If the hash digest is in a sender hash table, then without sending the data package, the sender computer sends the hash digest and an index referring to the hash digest so that a recipient computer can use the index to locate a matching hash digest and the data package in a recipient hash table. If the hash digest is not in the sender hash table, then the sender computer adds the data package and the hash digest to the sender hash table and sends the data package and the hash digest to the second computer to check the integrity of the data package based on the hash digest.

Abstract: Various embodiments for autonomic reclamation processing for tapes are provided. Instructions are received to perform reclamation processing on the formatted tape. Formatted tape is loaded into a tape drive for buffering active data during reclamation processing and consolidating all of the active data in capacity optimized manner on the same formatted tape. The formatted tape comprises metadata denoting active and inactive data blocks for files. The meta data of the formatted tape is read into a reclamation memory. The table is sorted and a starting block address is sorted. All active files ordered in the table starting at the starting block address are read into the reclamation memory. The files are written from the reclamation memory to the formatted tape from the starting block address and updating the table with new block addresses of the files. The meta data is updated with the updated table.