Emc IP Holding Company LLC

Emc Corporation

Ron Bigman

Assaf Natanzon

Jehuda Shemer

Amit Lieberman

Leehod Baruch

Adi Hirschtein

Oded Peer

Nir Sela

Yana Vaisman

Amnon Naamad

Anurag Singh Maunder

Kuram T Narayana

Philip Derbeko

Anat Eyal

Tomer Kushnir

Brad Corey Maltz

Boris Novikov

Elena Mikhaylova

Alice Pigul

Dmitri Vasilik

Shay Zukerman

Aleksei Fomin

A plugin is provided to a service that includes a database for storing data corresponding to transactions received by the service and applied to the database. Upon receipt of a transaction to be performed by the service, the plugin receives a message generated by the service and associated with informing another service of the transaction. The message is stored in the database together with the transaction, the message and transaction thereby being in the same transactional context. Upon the transaction being committed, the message is also processed because the transaction and message are in the same single transactional context within the database.

Highly scalable and consistent pluggable messaging system

Instances of client applications running independently on different devices are monitored to generate metadata records that are stored in cloud storage. Metadata records in cloud storage that have an aspect in common are grouped and used for comparative analysis. For example, metadata records for instances of the same client application, database, query or database structure may be grouped. Reports may be generated based on the analysis. The reports may indicate comparative performance, irregular activity, patch version and configurations associated with performance degradation, and recommended actions to improve performance.

Cross-application query analysis to produce database recommendations

A storage system comprises an object store, which comprises a plurality of metadata objects, a plurality of change objects, and a plurality of data objects associated with data stored in at least one logical unit of a production site, and a replication site configured to generate a requested point in time (PIT) based at least in part on the plurality of data objects, by: dividing the plurality of metadata objects into a plurality of respective portions of metadata objects; mapping each respective portion of metadata objects to a respective one of a plurality of reducer nodes; performing map reduce operations on the respective portion of metadata objects, at each respective one of the plurality of reducer nodes, to apply the most recent list of changes that occurred to each offset before the first requested PIT; and merging together the list of changes from each reducer node into the requested PIT.

Methods, systems, and apparatuses to update point in time journal using map reduce to create a highly parallel update

A computer-implemented method is provided. First information is received from at least a first data source. Based at least in part on analysis of the received first information, a determination of a first risk of a first adverse event is made, the risk affecting a first entity associated with a first location. Based at least in part on the first risk, at least a first impact from the first adverse event on the first entity is determined. At least a first action is dynamically caused to occur either before the completion of the first adverse event, the first action configured to substantially mitigate the first impact.

Risk based analysis of adverse event impact on system availability

A bug or problem that occurs during execution of an application is detected and a time at which the problem occurred is stored. An enhanced copy of the application is restored from before the time at which the problem occurred, and the enhanced copy of the application is run. If the problem is reproduced, the application is paused. If the problem is not reproduced, restoration of the enhanced copy, running of the enhanced copy and detection of the problem are repeated for a pre-designated number of times.

Proactive debugging

A computer implemented method, system, and computer program product comprising intercepting an interaction with a data storage capability at the abstraction layer enabled to intercept data interactions for different types of data storage capabilities; wherein the interaction changes data on the data storage capability; sending a copy of the interaction to a replication data storage capability; and sending the interaction to the data storage capability.

Abstraction layer

A multi-dimensional placement methodology, system and computer readable medium is presented. A plurality of data sets is ordered by need. A plurality of storage areas are defined based on a storage device type, an associated compression algorithm, and a plurality of parameters associated with different properties of the particular storage device and the compression algorithm being used. A data set is placed in a selected storage area based on a determination of which storage area provides a desired combination of the storage device type and compression.

Multi-dimensional placement

Techniques for performing data compression in which host application data access patterns are used to determine a compression block size, which is the size of the blocks of data to which compression is applied by a data storage system. A compression block size may be set to the size of the typical data access performed by a host application on the storage data object. The performance resulting from using multiple compression block sizes may be calculated using a detected data access pattern, and the compression block size set to the size of the typical data access pattern performed by the host application in response to the performance resulting from using a compression block size equal to the typical data access performed by the host application on the storage data object exceeding the performance resulting from using the other compression block sizes.

Utilizing data access patterns to determine compression block size in data storage systems

In one embodiment, a method includes replicating a production volume on a plurality of replica volume portions. Each replica volume portion is stored on a respective storage array with a respective journal. The replicating includes distributing data from a write command to a production volume across the replica volume portions using a coding scheme. A subset of replica volume portions, less than a total number of replica volume portions, includes data for a full replica volume of the production volume.

Distributed copy in multi-copy replication where offset and size of I/O requests to replication site is half offset and size of I/O request to production volume

A first cloud is provided with a first abstraction layer between a first instance of an application and a first set of different storage types. A second cloud, remote from the first cloud, is provided with a second abstraction layer between a second instance of the application and a second set of different storage types. A replication protection appliance (RPA) is connected between the first and second abstraction layers. The first abstraction layer intercepts a write command from the first instance of the application to storage of a particular type among the first set of different storage types. The first abstraction layer sends a copy of the write command to the RPA. The RPA replicates the write command to the second abstraction layer for the second abstraction layer to send to corresponding storage of the particular type among the second set of different storage types.

Maintaining an active-active cloud across different types of cloud storage services

A problem that occurs during execution of an application is debugged by building a lightweight container image and an enhanced container image. Data traffic for debugging is selected and the selected data traffic is copied using an enhanced copy. The problem is debugged using the enhanced container image and the selected data traffic.

Debugging using dual container images

A storage system is provided, comprising a processor and a storage array comprising a data storage entity storing computer-accessible data and a container executing within the storage array. The container is configured to run a temporal query service configured to query the data storage entity in the storage array from within the storage array, wherein a structure of a temporal query generated in accordance with the temporal query service comprises a query format configured to be compatible with a temporal structure of the data storage entity. The temporal query service is configured to parse at least a first temporal query received from a requesting entity to determine a set of temporal query parameters relating to data stored on the data storage entity, query the data storage entity with a second temporal query formed in accordance with the set of query parameters, and return temporal query results.

Temporal queries on secondary storage

In one aspect, a method includes migrating a database object from a source database to a target database, updating a storage of the location of the DB object to be the target database, directly accessing one of the target database and the source database during the migrating and executing, during the migrating, a database command by retrieving the DB object from the other one of the target database and the source database.

Database migration

Example embodiments of the present invention relate to methods, systems, and a computer program product for storing data compressed according to available system resources. The method includes evaluating system resources of a data storage system and selecting a compression algorithm according to the system resources. The data set then may be compressed according to the selected compression algorithm and the compressed data stored in the data storage system.

Method and system for choosing an optimal compression algorithm considering resources

Embodiments of the present disclosure relate to a method, an apparatus and a computer program product of recovering from a failure of a first node within a data storage system by receiving notice from the data storage system that the first node has failed; and restoring the first node based on a heat map of data I/O activity to the first node.

Growing community of inventors

Holon, Israel

Ron Bigman