Emc Corporation

Emc IP Holding Company LLC

Scott Auchmoody

Scott H Ogata

Eric Olsen

Mark D Malamut

Jennifer Starling

Jeffrey Norton

Junxu Li

Orit Levin-Michael

Erik Shawn Hansen

Stephen J Todd

Grant R Wallace

Frederick Douglis

Vladimir Mandic

Adam E Brenner

Salil Dangi

Jedidiah Yueh

Thomas B Bolt

Qun Fan

Christopher J Hackett

Mark Twomey

Emile Snyder

Yuping Li

Greg H Moulton

Scott Dolim

Clint L McVey

William Crosby

Robert Ramos

One example method includes identifying, in a computing system, an aggregate data set that includes both data used by a first user and data used by a second user, examining file metadata associated with the data in the aggregate data set and, based on the examination of the file metadata, determining whether or not any data in the aggregate data set is shared by the first and second users. When a determination is made that some data in the data set is shared by the first and second users, the method includes further determining how much of the data is shared, assigning a strength of connection between the first user and the second user based on the extent to which the first user and second user share data and, based on the strength of connection, taking an action to improve operation and/or configuration of the computing system.

Generating a social graph from file metadata

A data protection ecosystem-based data valuation methodology includes the following steps. One or more of backup data, metadata, and analytics results maintained by a data protection ecosystem are accessed. The backup data, metadata, and analytics results are obtained during the course of the data protection ecosystem providing data backup and recovery functionalities for a data storage environment that stores one or more data sets. A valuation is calculated for at least one of the one or more data sets of the data storage environment based on at least a portion of the accessed backup data, metadata, and analytics results maintained by the data protection ecosystem.

Calculating data value via data protection analytics

One embodiment is related to a method for transferring device information, comprising: receiving, at a second device, device information of a first device with a close proximity communication technique without requiring manual entry of the device information; storing, at the second device, the device information in a digital text and/or numeric format; and transmitting the device information from the second device to the third device without requiring manual entry of the device information.

Contactless information capture and entry for device management

A method, article of manufacture, system and apparatus for reducing data transfer and backup duration using a client side dataset paging cache. Backups may be associated with given datasets. Loading the same dataset previous backups pages and champions into memory will improve backups performance.

Dataset paging cache for storage system

Protected data is divided into a plurality of segments. For each segment in the plurality of segments, a fingerprint is generated. The plurality of fingerprints is grouped into group(s) of fingerprints and for each group of fingerprints, a group fingerprint is generated. It is determined if the group fingerprint being processed is stored in a cache and if so, the group fingerprint being processed is flagged as one for which a virtual copy will be performed.

Client side cache for deduplication backup systems

Combining a Merkle tree with a graph database by defining a Merkle tree with each node having a hashed value of the metadata for the node and any children of that node, associating non-hashed data with the hashed data for each node, wherein the non-hashed data has an up-pointer from a child node to any of its immediate parent node, and defining bi-directional edges between the nodes of the Merkle tree having a graph database structure to create a reference for the up-pointers associated with each Merkle tree node. The bi-directional edges with up-pointers along with the Merkle tree hash scheme allows efficient traversal of the tree where the hash values indicate non-changed nodes to prevent traversing the database, and further allows efficient path definitions by allowing database processes to walk up edges.

Combining merkle trees in graph databases

Embodiments are described for presenting a backed up data object to a client, in a native file format, in response to a request from the client to retrieve the requested data object. The request includes security attributes of the requested data object. If the security attributes in the request match the security attributes stored with the backed up data object, then the requested data objet is returned to the requesting client. When a backup is performed, metadata associated with each backed up data object is stored in the backup data set. When a request is received to restore a backed up data object, a metadata tree is constructed that represents the directory structure of the backed up data objects, and further includes security attributes for each data object and an offset into the backup data set where the requested data object can be found.

Extended snapshot using backup and microservice

One example method is directed to generating a data sampling parameter, and includes identifying an incremental billing rate for data storage, where the data storage includes a data set having a multiple data pieces that each correspond with a respective unique indicator, and the unique indicators reside in a space. The example method further includes identifying a threshold billing increment, and determining an acceptable error in the threshold billing increment. Finally, the method includes determining a sub sample ratio based upon the threshold billing increment and the acceptable error. The sub sample ratio has a variable value 'X' which indicates that sampling of one unique indicator in every 'X' unique indicators in the space is sufficient to determine the size of the entire data set.

Backend capacity evaluation for deduplicated storage systems

In one example method, a hash space is identified that includes hashes that each point to a respective piece of data in the customer data set. A first hash is selected using a sub sample ratio, and the first hash is checked to determine if the first hash points to data previously observed in an associated backup stream. If the first hash points to data not previously observed in the associated backup stream, the number of data pieces to which the first hash points are recorded, and if the first hash points to data previously observed in the associated backup stream, a second hash is selected using the sub sample ratio. The method can be repeated until the entire hash space has been sampled. The required storage capacity is calculated using the sub sample ratio and a sum of the recorded number of data pieces.

Backend capacity requirements for deduplicated storage systems

A method, article of manufacture, apparatus, and system for a paging cache is disclosed. The backup cache may be broken into pages, and a subset of these pages may be memory resident. The pages may be sequentially loaded into memory to improve cache performance.

Paging cache for storage system

Backup objects, native security descriptors that describe access rights to the backup objects, and object metadata are received from platforms where each backup object has corresponding object metadata. Each native security descriptor is transformed into a platform independent security descriptor. A partitioned structure is generated, including by associating each platform independent security descriptor with those object metadata that correspond to the plurality of backup objects for which that platform independent security descriptor describes access rights to.

Secure search

A set of pages including a set of entries are stored on disk. A set of page headers are stored in memory. Each page header corresponds to a page on disk. A page header includes a page number identifying a corresponding page on disk, a first guide word, and a second guide word. The first and second guide words define minimum and maximum name values, respectively, of entries on the page. Upon a request to determine if an entry associated with a name value exists, the page headers are scanned to identify a page number in a header where the name value is between the guide words. The page, if not resident in memory, is located on disk, loaded into memory, and examined to determine whether the entry exists on the page.

Guide word paged hash table

Views of files in an archival data storage system are generated by a backup view generator. A storage application generates and stores archival data in an archive system, the archival data corresponding to client data stored on a server or in memory associated with one or more client nodes. The storage application also generates backup files of the archival data which may be stored in a local memory. A set of metadata attributes are associated with each of the backup files. The backup views are generated by comparing metadata values in a view definition file to the sets of attributes associated with the backup files. Generated backup views can be exported for processing, including searching the backup views or displaying the backup views in a user interface.

View generator for managing data storage

Techniques for reducing and discouraging sending large scale emails are described herein. According to one embodiment, in response to a first email received from a sender to be sent to a list of recipients, a distribution cost of the first email is determined based on content of the first email and the recipients. An email client application is to present a first graphical user interface (GUI) page to the sender prompting a confirmation from the sender, where the first GUI page includes information indicating a size of the first email and a number of recipients, if the distribution cost of the first email is above a first predetermined threshold. In response to a positive confirmation from the sender, the first email is sent to the intended recipient.

Method and system for processing large scale emails and limiting resource consumption and interruption therefrom

Embodiments for a method of interfacing with a remote application programming interface (API) by defining an execution plan using an interface definition language and a dependency configuration file to generate a constrained directed graph of hierarchically dependent functions of the API, and executing the execution plan using an executing engine that traverses the graph to call the API functions in a defined order and convert data output by a parent function call to input required by a child function call until a terminal vertex is reached that results in directing the resulting in an action such as data to persist and/or affecting the state of a system.

Growing community of inventors

Irvine, CA, United States of America

Scott Auchmoody