Emc IP Holding Company LLC

Emc Corporation

Varada Ltd.

David Krakov

Tal Ben-Moshe

Roman Vainbrand

Eli Dorfman

Lior Kamran

Zvi Schneider

Noa Cohen

Kirill Shoikhet

Alex Soukhman

Kobi Luz

Niko Farhi

Marcelo Taube

Tal Ben Moshe

Vladimir Shveidel

Anton Kucherov

Amitai Alkalay

Gilad Braunschvig

Vladislav Weinbaum

Shlomi Alfasi

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

An apparatus comprises at least one processing device comprising a processor coupled to a memory. The processing device is configured to select a stripe column size for stripes of a data storage system, to determine a first compress block size for a first one of the stripes based on compressibility of data to be stored, to select a first prime number for computing parity blocks for the first stripe and a first number of sub-stripes for splitting stripe columns of the first stripe, to generate metadata specifying the first compress block size, the first prime number and the first number of sub-stripes for the first stripe, and to store data compressed using the first compress block size in the first stripe. The first prime number and first number of sub-stripes for the first stripe is different than a second prime number and second number of sub-stripes for a second stripe.

Efficient packing of compressed data in storage system implementing data striping

A storage system in one embodiment comprises a plurality of storage devices and at least one processing device. In conjunction with destaging data corresponding to an entry in a write cache, the at least one processing device determines a value of a release indication of an entry in a destage data structure that corresponds to the entry in the write cache. Responsive to determining that the value is a first value, the at least one processing device adds an entry that corresponds to the entry in the write cache to a release data structure. The storage system polls the release data structure and releases entries in the write cache that correspond to entries found in the release data structure. Responsive to determining that the value is a second value, an entry corresponding to the entry in the write cache is not added to the release data structure.

Storage system with write cache release protection

Described herein are embodiments of a process for efficiently allocating RAID stripes across an array of disks (e.g., SSDs). In some embodiments, the process can be used to allocate RAID stripes across a 'heterogeneous' storage array (i.e., an array of different sized disks). Also described herein are embodiments of a storage system that utilize said processing.

Data protection in a heterogeneous random access storage array

A hiccup management scheme for use within a storage system can maintain low latency on client I/O when a storage device is temporarily unavailable. In some embodiments, a storage using uses double parity data protection can tolerate concurrent hiccups by up to two storage devices within a storage array.

Hiccup management in a storage array

A computer program product, system, and method for generating coded fragments comprises receiving, at a first node of a distributed storage system, an I/O request to write a block; splitting the block into a plurality of sub blocks; generating a sub block error detection hash for each of the sub blocks; sending the block and the sub block error detection hashes to a second node within the distributed storage system; and storing the block and the sub block error detection hashes to a storage device at the second node.

End-to-end data protection for distributed storage

Described herein are embodiments of a process that can be used to balance the allocation of primary memory between different types of information. In some embodiments, the memory allocation is balanced dynamically based on observed I/O patterns. Related system embodiments are also described.

Memory allocation balancing for storage systems

Described herein are several embodiments of systems and processes to decrease startup time for subsystems of a storage system. According to some embodiments, subsystem memory is allocated using memory-mapped files.

Growing community of inventors

Ramat Gan, Israel

David Krakov