Abhishek Rai

US Patent:

20100186014, Jul 22, 2010

Filed:

Jan 21, 2009

Appl. No.:

12/356694

Inventors:

Satyam B. VAGHANI - San Jose CA, US
Mayank RAWAT - Sunnyvale CA, US
Abhishek RAI - Jersey City NJ, US

Assignee:

VMWARE, INC. - Palo Alto CA

International Classification:

G06F 12/12
G06F 12/02
G06F 9/46

US Classification:

718101, 711165, 711166, 711156, 711 6, 711E12002, 711E12069

Abstract:

In a computer system with a disk array that has physical storage devices arranged as logical storage units and is capable of carrying out hardware storage operations on a per logical storage unit basis, data movement operations can be carried out on a per-file basis. A data mover software component for use in a computer or storage system enables cloning and initialization of data to provide high data throughput without moving the data between the kernel and application levels.

US Patent:

8560747, Oct 15, 2013

Filed:

Feb 16, 2007

Appl. No.:

11/676109

Inventors:

Satyam Vaghani - San Jose CA, US
Dragan Stancevic - Colbert WA, US
Abhishek Rai - Palo Alto CA, US
Daniel J. Scales - Mountain View CA, US

Assignee:

VMware, Inc. - Palo Alto CA

International Classification:

G06F 12/14

US Classification:

710200, 711152

Abstract:

A method, system and program code for implementing distributed locks to be maintained through the use of on disk heartbeats. An instance of a node need only maintain a single heartbeat for all locks associated with the node and all of its processes. The node updates its heartbeat by accessing common storage, either virtual or physical, and updating a timestamp value in its heartbeat within a predetermined time interval, otherwise the heartbeat becomes stale. Expired heartbeats can be cleared or broken to allow redistribution of any locks associated therewith. The inventive technique may be implemented in a traditional computer environment or in a fully or partially virtualized environment and requires no use of an IP network or a separate network based lock manager.

US Patent:

20220253421, Aug 11, 2022

Filed:

Apr 18, 2022

Appl. No.:

17/722754

Inventors:

- San Jose CA, US
Naresh Kumar - Santa Clara CA, US
Satyam Shekhar - San Jose CA, US
Amit Prakash - Saratoga CA, US
Abhishek Rai - Palo Alto CA, US

International Classification:

G06F 16/22
G06F 16/27

Abstract:

Indexing in a low-latency data access and analysis system includes accessing, by an indexing unit of a low-latency data access and analysis system, constituent data from a data source of the low-latency data access and analysis system and indexing the constituent data in an index of the low-latency data access and analysis system by an indexing unit of the low-latency data access and analysis system. Indexing includes partitioning the constituent data based on a characteristic of the constituent data into at least a first partition and a second partition, segmenting the first partition into a first segment of the first partition, sharding the first segment into a first shard of the first segment of the first partition, segmenting, using hash-partitioning, the second partition into one or more segments of the second partition, and for respective segments of the second partition, sharding the respective segment into one or more respective shards.

US Patent:

20210109974, Apr 15, 2021

Filed:

Oct 13, 2020

Appl. No.:

17/069162

Inventors:

- Sunnyvale CA, US
Prateek Gaur - Mountain View CA, US
Amit Prakash - Saratoga CA, US
Abhishek Rai - Mountain View CA, US

International Classification:

G06F 16/903
G06F 3/06

Abstract:

Query execution on compressed in-memory data includes receiving, at a processor of an instance of a distributed in-memory database, a query for data from a table stored in the distributed in-memory database as compressed table data, obtaining results data responsive to the query from the table, and outputting the results data for presentation to a user. Obtaining results data includes allocating memory to identify allocated memory for decompressing the compressed table data, obtaining uncompressed table data by decompressing the compressed table data into the allocated memory, and obtaining the results data from the uncompressed table data. The allocated memory is deallocated in response to obtaining the results data. Compressing a table to form compressed table data is also described.

US Patent:

20200250163, Aug 6, 2020

Filed:

Aug 30, 2019

Appl. No.:

16/556719

Inventors:

- Sunnyvale CA, US
Naresh Kumar - Sunnyvale CA, US
Satyam Shekhar - San Jose CA, US
Amit Prakash - Saratoga CA, US
Abhishek Rai - Mountain View CA, US

International Classification:

G06F 16/22
G06F 16/27

Abstract:

Index sharding in a low-latency database analysis system includes obtaining index configuration data for indexing constituent data, the constituent data including a plurality of logical tables, and indexing, by an indexing unit, the constituent data by partitioning the constituent data based on a characteristic of the constituent data into at least a first partition and a second partition, segmenting the first partition into a first segment of the first partition, sharding the first segment into a first shard of the first segment of the first partition, segmenting, using hash-partitioning, the second partition into one or more segments of the second partition, and for each segment of the second partition, sharding the segment into one or more respective shards.

US Patent:

20170124112, May 4, 2017

Filed:

Jan 18, 2017

Appl. No.:

15/409294

Inventors:

- Palo Alto CA, US
Mayank Rawat - Sunnyvale CA, US
Abhishek Rai - Jersey City NJ, US

Assignee:

VMware, Inc. - Palo Alto CA

International Classification:

G06F 17/30
G06F 3/06

Abstract:

In a computer system with a disk array that has physical storage devices arranged as logical storage units and is capable of carrying out hardware storage operations on a per logical storage unit basis, data movement operations can be carried out on a per-file basis. A data mover software component for use in a computer or storage system enables cloning and initialization of data to provide high data throughput without moving the data between the kernel and application levels.

US Patent:

20160378773, Dec 29, 2016

Filed:

Sep 12, 2016

Appl. No.:

15/263202

Inventors:

- Palo Alto CA, US
Mayank Rawat - Sunnyvale CA, US
Abhishek Rai - Jersey City NJ, US

Assignee:

VMware, Inc. - Palo Alto CA

International Classification:

G06F 17/30
G06F 3/06

Abstract:

In a computer system with a disk array that has physical storage devices arranged as logical storage units and is capable of carrying out hardware storage operations on a per logical storage unit basis, data movement operations can be carried out on a per-file basis. A data mover software component for use in a computer or storage system enables cloning and initialization of data to provide high data throughput without moving the data between the kernel and application levels.

US Patent:

20150026145, Jan 22, 2015

Filed:

Jul 17, 2013

Appl. No.:

13/944491

Inventors:

- Redwood City CA, US
Ajeet Singh - Redwood City CA, US
Priyendra Singh Deshwal - Redwood City CA, US
Joy Dutta - Redwood City CA, US
Shashank Gupta - Redwood City CA, US
Vijay Krishnan Ganesan - Redwood City CA, US
Abhishek Rai - Redwood City CA, US
Sanjay Agrawal - Redwood City CA, US
Vibhor Nanavati - Redwood City CA, US
Stephane Antonin Kiss - Redwood City CA, US

Assignee:

Scaligent Inc. - Redwood City CA

International Classification:

G06F 17/30

US Classification:

707706, 707736, 707722, 707723, 707748, 707769

Abstract:

An information retrieval system converts unstructured ad-hoc search queries into structured search instructions that retrieve data in a structured relational database or an unstructured database. Data from the database is uploaded into a distributed in-memory database system. Tokens are automatically generated based on attributes, measures, and other metadata extracted from the relational database. The tokens are then compared with the non-structured ad-hoc user search queries. The information retrieval system uses the tokens to identify or predict what structured data is associated with user search queries. The tokens guide the user through a set of search terms that the system then uses to generate the structured query instructions. The structured query instructions retrieve specific data and answers from in the database system.