Abstract: A computer-implemented method for efficiently backing up large datasets may include (i) identifying data on an application server to be deduplicated by a deduplication server and then stored on a backup server, (ii) dividing the data into subsets, and (iii) for each subset of data subsequent to an initial subset of data, (a) transferring the subset of data to the deduplication server in response to detecting that a previous subset of data has completed transfer to the deduplication server, (b) deduplicating the subset of data in response to detecting that the previous subset of data has completed deduplication, and (c) transferring a deduplicated version of the subset of data to the backup server in response to detecting that the subset of data has completed deduplication and the previous subset of data has completed transfer to the backup server. Various other methods, systems, and computer-readable media are also disclosed.

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: The disclosed computer-implemented method for agentless and accelerated backup of a database may include, receiving, by a data backup device from a data server, blocks of data that provide a full backup of data of the data server. The method additionally includes receiving, by the data backup device from the data server, one or more native logs indicating one or more transactions performed by the data server. The method also includes determining, by the data backup device and based on the native logs, one or more changed blocks of the blocks of data. The method further includes providing, by the data backup device, a point in time restore of the data server by creating a synthetic full backup that overlays one or more of the blocks of data with the one or more changed blocks, and that shares remaining blocks of the blocks of data with the full backup.

Abstract: The disclosed computer-implemented method for marking application-consistent points-in-time may include intercepting, by an I/O filter, a write request from a guest virtual machine to a virtual machine disk and queueing the write request in an I/O filter queue. The method may include sending the write request to the virtual machine disk and receiving a write completion message from the virtual machine disk. The method may also include sending, in response to the write completion message, the write request to an I/O daemon, and queueing the write request in an I/O daemon queue. The method may further include sending the write completion message to the guest virtual machine, and sending the write request to a backup gateway such that the backup gateway mimics writes to the virtual machine disk. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: The disclosed computer-implemented method for agentless and accelerated backup of a database may include, receiving, by a data backup device from a data server, blocks of data that provide a full backup of data of the data server. The method additionally includes receiving, by the data backup device from the data server, one or more native logs indicating one or more transactions performed by the data server. The method also includes determining, by the data backup device and based on the native logs, one or more changed blocks of the blocks of data. The method further includes providing, by the data backup device, a point in time restore of the data server by creating a synthetic full backup that overlays one or more of the blocks of data with the one or more changed blocks, and that shares remaining blocks of the blocks of data with the full backup.

Abstract: A computer-implemented method for efficiently backing up large datasets may include (i) identifying data on an application server to be deduplicated by a deduplication server and then stored on a backup server, (ii) dividing the data into subsets, and (iii) for each subset of data subsequent to an initial subset of data, (a) transferring the subset of data to the deduplication server in response to detecting that a previous subset of data has completed transfer to the deduplication server, (b) deduplicating the subset of data in response to detecting that the previous subset of data has completed deduplication, and (c) transferring a deduplicated version of the subset of data to the backup server in response to detecting that the subset of data has completed deduplication and the previous subset of data has completed transfer to the backup server. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: The disclosed computer-implemented method for marking application-consistent points-in-time may include intercepting, by an I/O filter, a write request from a guest virtual machine to a virtual machine disk and queueing the write request in an I/O filter queue. The method may include sending the write request to the virtual machine disk and receiving a write completion message from the virtual machine disk. The method may also include sending, in response to the write completion message, the write request to an I/O daemon, and queueing the write request in an I/O daemon queue. The method may further include sending the write completion message to the guest virtual machine, and sending the write request to a backup gateway such that the backup gateway mimics writes to the virtual machine disk. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: The disclosed computer-implemented method for performing a database backup for repairless restore may include (1) receiving replica data records representing copies of a database from each of a group of data storage nodes in a production cluster, (2) processing the replica data records in parallel without inter-node communication between the data storage nodes, (3) merging updates to the replica data records, (4) identifying stale or redundant data records in the updated replica data records, (5) discarding the stale or redundant data records from the updated replica data records to create a single copy of updated data records, and (6) restoring the copy of the updated data records to the production cluster by replicating the updated data records to the data storage nodes such that each of the updated data records is consistent thereby obviating subsequent repair. Various other methods, systems, and computer-readable media are also disclosed.

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: Various systems, methods, and processes for accelerating data access in application and testing environments are disclosed. A production dataset is received from a storage system, and cached in a consolidated cache. The consolidated cache is implemented by an accelerator virtual machine. A file system client intercepts a request for the production dataset from one or more application virtual machines, and transmits the request to the accelerator virtual machine. The accelerator virtual machine serves the production dataset to the one or more application virtual machines from the consolidated cache.

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: The disclosed computer-implemented method for performing a database backup for repairless restore may include (1) receiving replica data records representing copies of a database from each of a group of data storage nodes in a production cluster, (2) processing the replica data records in parallel without inter-node communication between the data storage nodes, (3) merging updates to the replica data records, (4) identifying stale or redundant data records in the updated replica data records, (5) discarding the stale or redundant data records from the updated replica data records to create a single copy of updated data records, and (6) restoring the copy of the updated data records to the production cluster by replicating the updated data records to the data storage nodes such that each of the updated data records is consistent thereby obviating subsequent repair. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: The disclosed computer-implemented method for provisioning distributed datasets may include (1) identifying a dataset, where a production cluster stores a primary instance of the dataset by distributing data objects within the dataset across the production cluster according to a first partitioning scheme, (2) receiving a request for a testing instance of the dataset on a testing cluster, where the testing cluster is to distribute storage of data objects across the testing cluster according to a second partitioning scheme, (3) locating a copied instance of the dataset, (4) partitioning the copied instance of the dataset according to the second partitioning scheme, thereby generating a plurality of partitions, and (5) providing the testing instance of the dataset by providing storage access for each node within the testing cluster to a corresponding partition within the plurality of partitions. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Systems, apparatuses, methods, and computer readable mediums for implementing a scalable distributed email threading algorithm. A database is created for storing a plurality of emails organized by subjects and relaxed checksums. Each node of a plurality of nodes retrieves a different subject for processing, and each node reconstructs an email discussion thread from a corresponding retrieved subject. A given node may merge incomplete threads which are related but which have different subjects. Then, the nodes may write the reconstructed threads back to the database.

Abstract: The disclosed computer-implemented method for accelerating access to data may include (1) monitoring, at a data-caching system, read requests of a first data-accessing system for a dataset managed by a data-management system, (2) identifying a pattern of the read requests of the first data-accessing system, (3) monitoring, at the data-caching system, read requests of a second data-accessing system for the dataset managed by the data-management system, (4) determining that a pattern of the read requests of the second data-accessing system resembles the pattern of the read requests of the first data-accessing system, and (5) using a portion of the dataset accessed by the read requests of the first data-accessing system to pre-warm a cache of the second data-accessing system. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: A processor-based method for flash-friendly caching is provided. The method includes reading data from a first memory and writing the data to a second memory, in a cache. The method includes performing an aligned block write of data from the second memory in the cache to a flash memory in the cache, responsive to accumulating sufficient data for the aligned block write.

Abstract: A computer-implemented method for coordinating data caching on virtual storage appliances may include (1) receiving, at a first virtual storage appliance, a request for data from a virtual machine in a first set of virtual machines served by the first virtual storage appliance, (2) determining that the requested data is not cached at the first virtual storage appliance, (3) determining that a second virtual storage appliance is responsible for caching the requested data from a remote data source, (4) transferring the requested data from the second virtual storage appliance to the first virtual storage appliance, and (5) providing the requested data from the first virtual storage appliance to the virtual machine. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Various systems, methods, and processes for accelerating data access in application and testing environments are disclosed. A production dataset is received from a storage system, and cached in a consolidated cache. The consolidated cache is implemented by an accelerator virtual machine. A file system client intercepts a request for the production dataset from one or more application virtual machines, and transmits the request to the accelerator virtual machine. The accelerator virtual machine serves the production dataset to the one or more application virtual machines from the consolidated cache.

Abstract: Systems, apparatuses, methods, and computer readable mediums for implementing a scalable distributed email threading algorithm. A database is created for storing a plurality of emails organized by subjects and relaxed checksums. Each node of a plurality of nodes retrieves a different subject for processing, and each node reconstructs an email discussion thread from a corresponding retrieved subject. A given node may merge incomplete threads which are related but which have different subjects. Then, the nodes may write the reconstructed threads back to the database.

Abstract: Systems and methods for hierarchical reference counting via sibling trees are provided. The hierarchical data structure, together with its associated operations, can efficiently maintain reference counts and significantly reduce input/output (IO) operations compared to traditional techniques. The data structure presented here is applicable to any directed acyclic graph (DAG-type) structure where reference counts are used. Various embodiments of the present invention use a data structure to maintain a “sibling pointer” (pointing to the sibling node as a way to avoid reference count updates) and a “sibling count.” When nodes in the tree diverge, the sibling pointer and sibling count are updated as opposed to directly manipulating the reference counts of the children of the diverging nodes. Various other embodiments can use additional entries or fields that allow for improved efficiency and advantages.