Emc Corporation

Emc IP Holding Company LLC

Varada Ltd.

Other

Kobi Luz

Renen Hallak

Ehud Rokach

Ronen Kalish

Zvi Schneider

Kirill Shoikhet

Eldad Zinger

Tal Ben-Moshe

David Krakov

Roman Vainbrand

Gilad Braunschvig

Tal Ben Moshe

David Meiri

Xiangping Chen

Anton Kucherov

Shahar Frank

Felix Shvaiger

Erez Webman

Yaron Segev

Eli Dorfman

Irit Yadin-Lempel

Shlomi Alfasi

Example embodiments of the present invention relate and a method and an apparatus for double hashing. The method including receiving a hash signature, including a short hash handle, for a data block. The method then includes determining a bucket with which the hash signature should be associated and associating the hash signature with the bucket.

Using double hashing schema to reduce short hash handle collisions and improve memory allocation in content-addressable storage systems

A managed query execution platform, and methods thereof are provided. The, managed query execution platform includes a plurality of computing machines; a plurality of storage devices; and a communication fabric configured to allow communication of the plurality of computing machines with the plurality of storage devices over a storage communication protocol, wherein the plurality of storage devices are configured to maintain at least one indexed view, and wherein the plurality of computing machines are configured to execute queries on the at least one indexed view.

Managed query execution platform, and methods thereof

A system and method for executing queries on an indexed view are presented. The method includes processing an input query directed to data maintained by the indexed view to generate a plurality of statements responsive to the input query, wherein the indexed view includes index information and a plurality data chunks; verifying a global index to locate segments of the indexed view; verifying a plurality of local indexes to locate data chunks containing values related to the plurality of statements, wherein the index information includes at least one local index per data chunk and at least one global index per the entire indexed view; processing the plurality of statements by accessing the data chunks containing values related to the plurality of statements; and responding to the input query based on the accessed data chunks.

Method and system for executing queries on indexed views

A system, computer program product, and computer-executable method of scheduling replication on a data storage system, the system, the computer program product, and computer-executable method including receiving a request to replicate a portion of data stored on the data storage system, dividing the portion of data into a plurality of portions, scheduling replication of each of the plurality of portions, and replicating each of the plurality of portions.

Framework for scheduling concurrent replication cycles

Example embodiments of the present invention relate and a method and an apparatus for managing a short hash handle. The method including receiving an I/O including a first identifier for a data block and examining the first identifier in comparison with a second identifier. The data block identified in the I/O then may be managed according to the first identifier and the second identifier.

Method and apparatus for creating a short hash handle highly correlated with a globally-unique hash signature

In one aspect, a method includes providing a server that stores a hash digest metadata table and configuring entries in the hash digest metadata table to include entries that include persistent fields and non-persistent fields. The hash digest metadata table maps a hash digest representing X-Page data to its metadata information. The persistent fields include a short hash digest field, a physical layout offset field, a deduplication reference count field and a flags field.

Data structure for hash digest metadata component

In one aspect, a method includes receiving and recording journal data at a client on a first server, providing the data to a journal component, transferring the journal data from the journal component to a reserve memory in a memory of a second server using a remote direct memory access (RDMA), after failure of the client, retrieving the journal data from the reserve memory using the RDMA and replacing the journal data lost from the failure of the client with the journal data from the reserve memory.

Backing up journal data to a memory of another node

In one aspect, a method includes receiving hash signature, determining if there is an existing hash signature that matches the hash signature received, determining if there is an existing short hash handle that matches the hash signature received, designating n-1 least significant bits of the hash signature to be n-1 least significant bits of a n-bit short hash handle if there is not an existing short hash handle that matches the hash signature received and adding a hash handle bit to the n-1 bits to form the n-bit short hash handle.

Generating a short hash handle

A device for scalable block data storage and retrieval uses content addressing. Data storage devices store data blocks, and are connected over a network to computing modules. The modules comprise control modules and data modules and carry out content addressing for both storage and retrieval. The network defines separate control paths via the control modules and data paths via the data modules.

Growing community of inventors

Rehovot, Israel

Kobi Luz