Abstract: Exemplary method, system, and computer program product embodiments for increased in-line deduplication efficiency in a computing environment are provided. In one embodiment, by way of example only hash values are calculated in nth iterations for accumulative data chunks extracted from an object requested for in-line deduplication. For each of the nth iterations, the calculated hash values for the accumulative data chunks are matched in a nth hash index table with a corresponding hash value of existing objects in storage. The nth hash index table is exited upon detecting a mismatch during the matching. The mismatch is determined to be a unique object and is stored. A hash value for the object is calculated. A master hash index table is updated with the calculated hash value for the object and the calculated hash values for the unique object. Additional system and computer program product embodiments are disclosed and provide related advantages.

Abstract: Methods, systems, and computer program products are provided for performing a secure delete operation in a wide area network (WAN) including a cache site and a home site. A method includes identifying a file for deletion at the cache site, determining whether the file has a copy stored at the home site, detecting a location of the copy at the home site prior to a disconnection event of the cache site from the home site, deleting the file from the cache site during the disconnection event, and performing a secure deletion of the copy at the home site immediately after a reconnection event of the cache site to the home site.

Abstract: A mechanism is provided to optimize cooling of a data center having a plurality of computer systems. A dataset is classified into a plurality of data storage regions hosted by at least one of the plurality of computer systems. A plurality of cooling devices is grouped into groups. Each group of the plurality of cooling devices cools at least one of the plurality of data storage regions. The classified dataset is analyzed to identify one of the plurality of data storage regions having heat-intensive data. An operating parameter is selectively adjusted for one of the group of the plurality of cooling devices that corresponds to cooling the identified one of the plurality of data storage regions having the heat-intensive data.

Abstract: Systems and computer program products are provided for optimizing selection of files for deletion from one or more data storage devices to free up a predetermined amount of space in the one or more data storage devices. A method includes analyzing an effective space occupied by each file of a plurality of files in the one or more data storage devices, identifying, from the plurality of files, one or more data blocks making up a file to free up the predetermined amount of space based on the analysis of the effective space of each file of the plurality of files, selecting one or more of the plurality of files as one or more candidate files for deletion, based on the identified one or more data blocks, and deleting the one or more candidate files for deletion from the one or more data storage devices.

Abstract: Systems and computer program products are provided for optimizing selection of files for eviction from a first storage pool to free up a predetermined amount of space in the first storage pool. A method includes analyzing an effective space occupied by each file of a plurality of files in the first storage pool, identifying, from the plurality of files, one or more data blocks making up a file to free up the predetermined amount of space based on the analysis of the effective space of each file of the plurality of files, selecting one or more of the plurality of files as one or more candidate files for eviction, based on the identified one or more data blocks, and evicting the one or more candidate files for eviction from the first storage pool to a second storage pool.

Abstract: One method includes assigning a pointer from multiple logical blocks to the same original physical block if the multiple logical blocks include the same data. The method further includes receiving a command to write data to the first logical block and determining if the first logical block is a frequently accessed logical block. If the first logical block is a frequently accessed logical block, ownership of the original physical block is assigned to the first logical block. If ownership is established, the method includes copying any data stored in the original physical block to a new physical block, assigning a pointer from a second logical block to the new physical block, and performing the write command on the original physical block. A system includes a processor for performing the above method. One computer program product includes computer code for performing the method described above.

Abstract: An embodiment of the invention includes a method for managing media files created by a digital camera. More specifically, a content analyzing module tags a media file with one or more location media tags, event media tags, and/or content media tags. The location media tags are indicative of the geographic location where the media file was created. The event media tags are indicative of an event where the media file was created; and, the content media tags are indicative of individual(s) in the media file. A priority analyzing module connected to the content analyzing module determines a priority of the media file based on priority rules and the location media tags, event media tags, and/or the content media tags. A storage management module connected to the priority analyzing module stores the media file based on the determined priority.

Abstract: Aspects of the present invention reduce a lock wait time in a distributed processing environment. A plurality of wait-for dependencies between a first plurality of transactions and a second plurality of transactions in a distributed processing environment is identified. The first plurality of transactions waits for the second plurality of transactions to release a plurality of locks on a plurality of shared resources. An amount of time the first plurality of transactions will wait for the second plurality of transactions in the distributed processing environment is determined based on the plurality of wait-for dependencies between the first plurality of transactions and the second plurality of transactions. Historical transaction data related to the plurality of wait-for dependencies between the first plurality of transactions and the second plurality of transactions is analyzed.

Abstract: An embodiment of the invention is a program for dynamically managing files to comply with security requirements. In one embodiment, changing security requirements require that the computer system identifies the current storage locations of files along with the files' respective security levels. Files containing changed security levels due to the changed security requirements are relocated to storage locations clustered with storage locations containing files of the same security level. In another embodiment, the computer system receives a file having a certain security level, identifies current storage locations of files with the files' respective security levels, and finally allocates the new file to a storage location clustered with storage locations containing files of the same security level.

Abstract: Virtual file system virtual nodes are grouped in subpools in response to identified resource components and managed as a function of their subpool groupings. Virtual nodes are decomposed into individual components linked to each other within each node. The components that have repetitive accesses by applications within the virtual file system and their respective frequencies of repetitive access are identified. Modules of linked occurrences of the repetitive components within each of the plurality of virtual nodes are formed, and subsets of the virtual nodes sharing common modules are grouped into subpools. Accordingly, in response to an application of the virtual file system requesting a service that is satisfied by a subpool common module, selection of a virtual node for reinitiating for reuse by the application is restricted to virtual nodes within the subpool associated with the common module.

Abstract: Exemplary embodiments for increased in-line deduplication efficiency in a computing environment are provided. In one embodiment, by way of example only, hash values are calculated in nth iterations on data samples from fixed size data chunks extracted from an object requested for in-line deduplication. For each of the nth iterations, the calculated hash values for the data samples from the fixed size data chunks are matched in an nth hash index table with a corresponding hash value of existing objects in storage. The nth hash index table is exited upon detecting a mismatch during the matching. The mismatch is determined to be a unique object and is stored. A hash value for the object is calculated. A master hash index table is updated with the calculated hash value for the object and the calculated hash values for the unique object.

Abstract: Exemplary method, system, and computer program product embodiments for increased in-line deduplication efficiency in a computing environment are provided. In one embodiment, by way of example only hash values are calculated in nth iterations for accumulative data chunks extracted from an object requested for in-line deduplication. For each of the nth iterations, the calculated hash values for the accumulative data chunks are matched in a nth hash index table with a corresponding hash value of existing objects in storage. The nth hash index table is exited upon detecting a mismatch during the matching. The mismatch is determined to be a unique object and is stored. A hash value for the object is calculated. A master hash index table is updated with the calculated hash value for the object and the calculated hash values for the unique object. Additional system and computer program product embodiments are disclosed and provide related advantages.

Abstract: Methods, systems, and physical computer-readable storage medium are provided to optimize WAN traffic on cloud networking sites. In an embodiment, by way of example only, a method includes fetching deduplication information from a home site to build a repository comprising duplicate peer file sets, one or more of the duplicate peer file sets including one or more peer files, referring to the repository to determine whether a target file corresponds with a cache copy of a peer file of the one or more peer files included in the duplicate peer file sets, and creating a local copy of the peer file of the one or more peer files, if a determination is made that the target file corresponds with the cache copy of the peer file of the one or more peer files included in the duplicate peer file sets.

Abstract: A file server receives a request from a client to mount an encrypted file system. The file server informs the client that the requested file system is encrypted and, in turn, receives a session ticket from the client that includes a security protocol mounting selection. The file server decrypts the client's user's encrypted private key, and then decrypts the requested encrypted file system using the private key. In turn, the file server sends the decrypted file system to the client over a secure channel, which is based upon the security protocol mounting selection. In one embodiment, a key distribution center server receives a request from the client for the client's user to access the encrypted file system at the file server. The key distribution center server retrieves an intermediate key; includes the intermediate key in a session ticket; and sends the session ticket to the client.

Abstract: A file server receives a request from a client to mount an encrypted file system. The file server informs the client that the requested file system is encrypted and, in turn, receives a session ticket from the client that includes a security protocol mounting selection. The file server decrypts the client's user's encrypted private key, and then decrypts the requested encrypted file system using the private key. In turn, the file server sends the decrypted file system to the client over a secure channel, which is based upon the security protocol mounting selection. In one embodiment, a key distribution center server receives a request from the client for the client's user to access the encrypted file system at the file server. The key distribution center server retrieves an intermediate key; includes the intermediate key in a session ticket; and sends the session ticket to the client.

Abstract: Aspects of the present invention reduce a lock wait time in a distributed processing environment. A plurality of wait-for dependencies between a first plurality of transactions and a second plurality of transactions in a distributed processing environment is identified. The first plurality of transactions waits for the second plurality of transactions to release a plurality of locks on a plurality of shared resources. An amount of time the first plurality of transactions will wait for the second plurality of transactions in the distributed processing environment is determined based on the plurality of wait-for dependencies between the first plurality of transactions and the second plurality of transactions. Historical transaction data related to the plurality of wait-for dependencies between the first plurality of transactions and the second plurality of transactions is analyzed.

Abstract: An embodiment of the invention is a program for dynamically managing files to comply with security requirements. In one embodiment, changing security requirements require that the computer system identifies the current storage locations of files along with the files' respective security levels. Files containing changed security levels due to the changed security requirements are relocated to storage locations clustered with storage locations containing files of the same security level. In another embodiment, the computer system receives a file having a certain security level, identifies current storage locations of files with the files' respective security levels, and finally allocates the new file to a storage location clustered with storage locations containing files of the same security level.

Abstract: A method, computer program product, and system for rebalancing database table space in a hybrid storage environment of heterogeneous storage units used by a plurality of users to store associated extents. The storage units are ranked according to various performance characteristics such as IOPS rates and power consumption, and the users are ranked according to various characteristics such as whether they have subscribed to standard or premium storage subscriptions. Upon detection of a change in the relative ranking of the users or the storage units, the stored extents are mapped, characterized as standard or priority extents, and redistributed across the storage units if needed to provide higher ranked storage for priority extents and for higher ranked users.

Abstract: A file server receives a request from a client to mount an encrypted file system. The file server informs the client that the requested file system is encrypted and, in turn, receives a session ticket from the client that includes a security protocol mounting selection. The file server decrypts the client's user's encrypted private key, and then decrypts the requested encrypted file system using the private key. In turn, the file server sends the decrypted file system to the client over a secure channel, which is based upon the security protocol mounting selection. In one embodiment, a key distribution center server receives a request from the client for the client's user to access the encrypted file system at the file server. The key distribution center server retrieves an intermediate key; includes the intermediate key in a session ticket; and sends the session ticket to the client.

Abstract: A method, computer program product, and system for rebalancing database table space in a hybrid storage environment of heterogeneous storage units used by a plurality of users to store associated extents. The storage units are ranked according to various performance characteristics such as IOPS rates and power consumption, and the users are ranked according to various characteristics such as whether they have subscribed to standard or premium storage subscriptions. Upon detection of a change in the relative ranking of the users or the storage units, the stored extents are mapped, characterized as standard or priority extents, and redistributed across the storage units if needed to provide higher ranked storage for priority extents and for higher ranked users.