Abstract: The disclosed computer-implemented method for backing-up an eventually-consistent database in a production cluster may include (1) forming, on a production node, a stable copy of production data, (2) provisioning storage on a backup node based on an amount of data in the stable copy and a replication factor, (3) transferring information from the stable copy to a backup copy on the backup node, (4) performing record synthesis on the backup copy to merge record updates into complete backup records, (5) identifying and discarding any stale records and any redundant records in the complete backup records, and (6) transferring the complete backup records from the backup node to a cloud storage device. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Quality of service is provided to prioritized VMs and applications, based on the varied quality of different shared computing resources. Each VM or application has an associated priority. A quality rating is dynamically assigned to each shared computing resource. Requests for shared computing resources made by specific VMs or applications are received. For each specific received request, the current priority of the requesting VM or application is identified. In response to each received request, a specific shared computing resource is assigned to the specific requesting VM or application. This assignment is made based on the current priority of the requesting VM or application and the current quality rating of the shared computing resource, thereby providing quality of service to the requesting VM or application corresponding to its current priority.

Abstract: Cloud storage provides for accessible interfaces, near-instant elasticity and scalability, multi-tenancy, and metered resources within a framework of distributed resources acting to provide highly fault tolerant solutions with high data durability. However, cloud storage also has drawbacks and limitations with information uploading and how information is subsequently accessed. To date the lack of automated tools for managing tens, hundreds and thousands of users and/or documents within enterprises and organizations means that for most migrating is a massive undertaking. Accordingly, knowledge workers require a human interface to the data ingested from third-party systems that manages the data in original folder contexts/locations for each knowledge worker within the interfaces.

Abstract: Methods, computer program products, and computer systems for the management of data references in an efficient and effective manner are disclosed. Such methods, computer program products, and computer systems include receiving a change tracking stream at the computer system, identifying a data object group, and performing a deduplication management operation on the data object group. The change tracking stream is received from a client computing system. The change tracking stream identifies one or more changes made to a plurality of data objects of the client computing system. The identifying is based, at least in part, on at least a portion of the change tracking stream. The data object group represents the plurality of data objects.

Abstract: Methods, computer program products, computer systems, and the like for efficient metadata management are disclosed, which can include receiving a subunit of storage, storing a first metadata portion of the subunit of storage in a first unit of storage, and storing a second metadata portion of the subunit of storage in a second unit of storage.

Abstract: Methods, computer program products, computer systems, and the like are disclosed that provide for scalable deduplication in an efficient and effective manner. For example, such methods, computer program products, and computer systems can include determining whether a source data store and a replicated data store are unsynchronized and, in response to a determination that the source data store and the replicated data store are unsynchronized, performing a resynchronization operation. The source data stored in the source data store is replicated to replicated data in the replicated data store. The resynchronization operation resynchronizes the source data and the replicated data.

Abstract: Provided computer-implemented methods for prioritizing cache objects for deletion may include (1) tracking, at a computing device, a respective time an externally-accessed object spends in an external cache, (2) queuing, when the externally-accessed object is purged from the external cache, the externally-accessed object in a first queue, (3) queuing, when an internally-accessed object is released, the internally-accessed object in a second queue, (4) prioritizing objects within the first queue, based on a cache-defined internal age factor and on respective times the objects spend in the external cache and respective times the objects spend in an internal cache, (5) prioritizing objects within the second queue based on respective times the objects spend in the internal cache, (6) selecting an oldest object having a longest time in any of the first queue and the second queue, and (7) deleting the oldest object. Various other methods, systems, and computer-readable media are disclosed.

Abstract: Disclosed herein are methods, systems, and processes to provide coherency across disjoint caches in clustered environments. It is determined whether a data object is owned by an owner node, where the owner node is one of multiple nodes of a cluster. If the owner node for the data object is identified by the determining, a request is sent to the owner node for the data object. However, if the owner node for the data object is not identified by the determining, selects a node in the cluster is selected as the owner node, and the request for the data object is sent to the owner node.

Abstract: The disclosed computer-implemented method for prioritizing and detecting file datasets based on metadata may include (i) receive a group of files from a data storage, (ii) train a machine-learning model utilizing a set of properties derived from metadata associated with the files, (iii) identify, utilizing the machine-learning model, a dataset including at least one candidate file that performs an action in a set of predetermined actions, and (iv) prioritize the action based on the dataset. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Disclosed are techniques that provide for eventually-complete backups, and restoration thereof. For example, such methods, computer program products, and computer systems can include initiating a backup operation (where the backup operation is configured back up a dataset), detecting termination of the backup operation, detecting termination of the backup operation, and determining whether the backup operation backed up the dataset completely. In response to a determination that the backup operation did not backup the dataset completely, generating an indication that the backup is not complete. In response to a determination that the backup operation did not backup the dataset completely, generating an indication that the backup is complete.

Abstract: The disclosed computer-implemented method for write-once-read-many storage may include (1) receiving, at a file system on the computing device, a request to assign a write-once-read-many (WORM) attribute to a file, wherein the request is received from an application, (2) setting, in response to the request to assign the WORM attribute to the file, a WORM flag in an extended attribute associated with the file, and (3) associating with the file, in response to the setting of the WORM flag, a retention period attribute and read-only access until the end of the retention period. The provided systems and methods may provide per-file WORM support at a file system level using extended attributes of the file system. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Disclosed herein are methods, systems, and processes for migration between storage tiers. Such a method, for example, can include extracting one or more characteristics of a replication workload, determining one or more storage costs of each storage tier of a plurality of storage tiers (where the one or more storage costs are determined for the replication workload and the one or more storage costs are determined based, at least in part, on the one or more characteristics), identifying one or more storage tiers of the plurality of storage tiers (where the identifying is based, at least in part, on the one or more storage costs), and migrating at least a portion of the replication workload from a target storage unit in an initial storage tier to a storage unit in the one or more storage tiers.

Abstract: Disclosed herein are methods, systems, and processes that can include performing a replication operation, receiving a backup operation instruction at a replication agent, and, in response to receipt of the backup operation instruction, performing an application quiescing operation and invoking an action of a backup agent. The replication operation sends data of an application executed by a virtual machine at a primary site, to a secondary site. The virtual machine is executed by a computing system at the primary site. The backup operation instruction is received from the backup agent. The application quiescing operation is performed by the replication agent. The application quiescing operation quiesces the replication operation, at least in part, by quiescing the application.

Abstract: Methods, computer program products, computer systems, and the like are disclosed that provide for scalable deduplication in an efficient and effective manner. For example, such methods, computer program products, and computer systems can include tracking one or more write operations executed on a target data store and sending metadata regarding the one or more write operations to a source site. The tracking comprises storing information regarding the one or more write operations in a data structure. The one or more write operations cause one or more units of data to be written to the target data store. The target data store is at a target site. The metadata comprises the information.

Abstract: Disclosed herein is the creation of probabilistic data structures for container reclamation. One method involves retrieving a segment object list of a data container and creating a probabilistic data structure. The segment object list comprises a plurality of segment objects, the data container comprises the plurality of segment objects and a plurality of data objects, and each segment object of the plurality of segment objects comprises a hash value determined by performing a hashing function on a corresponding data object of the plurality of data objects. The creating includes, for each segment object in the segment object list, identifying an element of a plurality of elements of the probabilistic data structure using a hash value of the each segment object and setting the element to indicate the segment object references a corresponding data object of the plurality of data objects.

Abstract: Disclosed herein are systems, methods, and processes to perform context-driven (or context-based) data backup and recovery operations. A request to perform a backup operation on a dataset is received. Current external context datasets related to the dataset and generated based on prioritization techniques are collected from computing devices. a saved context dataset is generated based on the current external context datasets. The backup operation is performed by storing a backup image that includes at least a portion of the dataset and the saved context dataset.

Abstract: Disclosed herein are systems, methods, and processes to optimize the storage of pre-allocated units of storage during a backup operation. Null units of storage are identified in pre-allocated units of storage prior to the backup operation. Upon being identified, the null units of storage are inhibited from being written to a backup image during the backup operation.

Abstract: The disclosed computer-implemented method for managing replication of data to a remote storage device may include (1) maintaining a first bitmap and a second bitmap storing data acknowledging persistence of target data, respectively, at source and target gateways, where the target gateway serves the remote storage device, (2) sending replication data from a computing device to the source gateway, (3) setting a bit in the first bitmap, where the set bit corresponds to the replication data sent to the source gateway, (4) receiving a first acknowledgement indicating the source gateway received the replication data, (5) copying, in response to the first acknowledgement, the bit to the second bitmap, (6) clearing, in response to the first acknowledgement, the bit in the first bitmap, and (7) receiving a second acknowledgement indicating the target gateway received the replication data. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Methods, computer program products, computer systems, and the like are disclosed that provide for the tracking of access patterns of inodes, and the issuing of inode read-ahead instructions, in order to pre-fetch inodes. Such a method can include, for example, identifying a unit of metadata in a file system, identifying a file system structure in the file system, determining whether a file structure of the file system structure is non-sequential, and, in response to a determination that the file structure is non-sequential, retrieving a list of units of metadata. In such embodiments, the file system structure is associated with the unit of metadata, and the determining includes accessing the file system structure. Further, in certain embodiments, the units of metadata identified in the list of units of metadata are stored in a storage device of the computer system.

Abstract: Various systems and methods are provided for using various in-core and on-disk data structures to improve the file creation process through the use of previously-occupied inodes. For example, one method involves updating an in-core data structure in response to receiving a command to delete a first file, such that a first node is assigned to the first file, the in-core data structure is stored in a non-persistent computer-readable storage medium, the in-core data structure comprises a plurality of entries, each of the entries comprises information identifying a respective inode of a plurality of inodes as being available, and the updating the in-core data structure comprises storing information regarding the first inode in a first entry of the plurality of entries; and creating a second file, where the creating comprises assigning the first inode to the second file using the information regarding the first inode stored in the first entry.