Subhradyuti Sarkar

US Patent:

20130060780, Mar 7, 2013

Filed:

Sep 2, 2011

Appl. No.:

13/224327

Inventors:

Tirthankar Lahiri - Palo Alto CA, US
Dina Thomas - Palo Alto CA, US
Kirk Meredith Edson - Fremont CA, US
Subhradyuti Sarkar - Fremont CA, US
Mark McAuliffe - Palo Alto CA, US
Marie-Anne Neimat - Atherton CA, US
Chih-Ping Wang - Palo Alto CA, US

Assignee:

ORACLE INTERNATIONAL CORPORATION - Redwood Shores CA

International Classification:

G06F 17/30

US Classification:

707741, 707E17037

Abstract:

In column domain dictionary compression, column values in one or more columns are tokenized by a single dictionary. The domain of the dictionary is the entire set of columns. A dictionary may not only map a token to a tokenized value, but also to a count (“token count”) of the number of occurrences of the token and corresponding tokenized value in the dictionary's domain. Such information may be used to compute queries on the base table.

US Patent:

20220405305, Dec 22, 2022

Filed:

Jun 22, 2021

Appl. No.:

17/355125

Inventors:

- Palo Alto CA, US
Wenguang Wang - Santa Clara CA, US
Pranay Singh - San Ramon CA, US
Subhradyuti Sarkar - Newark CA, US
Nitin Rastogi - San Bruno CA, US

International Classification:

G06F 16/27
G06F 16/22

Abstract:

System and method for managing copy-on-write (COW) B tree structures for metadata of storage objects stored in a storage system determine, when a request to modify a target storage object stored in the storage system that requires a modification of a target leaf node in a B tree structure for metadata of the target storage object is received, whether an operation sequence number of the target leaf node is greater than a snapshot sequence number of a parent snapshot of a running point of the B tree structure. When the operation sequence number is greater than the snapshot sequence number, the target leaf mode is modified in place without copying the target leaf node. When the operation sequence number is not greater than the snapshot sequence number, the target leaf node is copied as a new leaf node for the B tree structure and the new leaf node is modified.

US Patent:

20230104544, Apr 6, 2023

Filed:

Oct 4, 2021

Appl. No.:

17/492950

Inventors:

- Palo Alto CA, US
Enning Xiang - Palo Alto CA, US
Pranay Singh - Palo Alto CA, US
Subhradyuti Sarkar - Palo Alto CA, US

Assignee:

VMware, Inc. - Palo Alto CA

International Classification:

G06F 3/06
G06F 12/02

Abstract:

The present disclosure is related to methods, systems, and machine-readable media for managing extent sharing between snapshots using mapping addresses. A first mapping address can be assigned to a first extent responsive to a request to write the first extent. A second mapping address can be assigned to a second extent responsive to a request to write the second extent. A snapshot can be created. A snapshot mapping address, that is monotonically increased from the second mapping address, can be assigned to the snapshot. A third mapping address, that is monotonically increased from the second mapping address, can be assigned to a third extent of the snapshot responsive to a request to write the third extent. An ownership status of each of the first extent, the second extent, and the third extent can be determined based respectively on: a comparison between the first mapping address and the snapshot mapping address, a comparison between the second mapping address and the snapshot mapping address, and a comparison between the third mapping address and the snapshot mapping address.

US Patent:

20230028678, Jan 26, 2023

Filed:

Jul 22, 2021

Appl. No.:

17/383087

Inventors:

- Palo Alto CA, US
Wenguang Wang - Santa Clara CA, US
Pranay Singh - Palo Alto CA, US
Subhradyuti Sarkar - Palo Alto CA, US
Enning Xiang - Palo Alto CA, US

Assignee:

VMware, Inc. - Palo Alto CA

International Classification:

G06F 16/11
G06F 16/16
G06F 16/188
G06F 16/13
G06F 16/901

Abstract:

The present disclosure is related to methods, systems, and machine-readable media for determining shared nodes between snapshots using probabilistic data structures. A unique identifier can be assigned to each node of a first tree data structure corresponding to a first snapshot of a virtual computing instance (VCI). A first probabilistic data structure representing the first tree data structure can be created that includes hashes of the identifiers assigned to the nodes of the first tree data structure. A unique identifier can be assigned to each node of a second tree data structure corresponding to a second snapshot of the VCI. A second probabilistic data structure representing the second tree data structure can be created that includes hashes of the identifiers assigned to the nodes of the second tree data structure. A particular node of the second tree data structure can be determined to be shared by the first tree data structure responsive to a determination that the first probabilistic data structure includes a hash of an identifier assigned to the particular node.

US Patent:

20230010516, Jan 12, 2023

Filed:

Jul 6, 2021

Appl. No.:

17/368254

Inventors:

- Palo Alto CA, US
Wenguang WANG - Santa Clara CA, US
Nitin RASTOGI - San Bruno CA, US
Pranay SINGH - San Ramon CA, US
Subhradyuti SARKAR - Newark CA, US

International Classification:

G06F 3/06

Abstract:

A method for of input/output (I/O) quiescing in a write-ahead-log (WAL)-based storage system comprising a WAL, is provided. The method generally includes receiving a request to process a control operation for the storage system, determining whether a memory buffer includes payload data for one or more write requests previously received for the storage system and added to the WAL, forcing a flush of the payload data in the memory buffer to a persistent layer of the storage system when the memory buffer includes the payload data, and processing the control operation subsequent to completing the asynchronous flush, without waiting for processing of one or more other write requests in the WAL corresponding to payload data that was not added to the memory buffer prior to receiving the request to process the control operation.

US Patent:

20190197026, Jun 27, 2019

Filed:

Feb 27, 2019

Appl. No.:

16/287569

Inventors:

- Redwood Shores CA, US
MARTIN A. REAMES - Minneapolis MN, US
KIRK EDSON - Fremont CA, US
NEELAM GOYAL - San Mateo CA, US
KAO MAKINO - San Carlos CA, US
ANINDYA PATTHAK - Fremont CA, US
DINA THOMAS - Palo Alto CA, US
SUBHRADYUTI SARKAR - Fremont CA, US
QINGCHUN JIANG - Foster City CA, US

International Classification:

G06F 16/21
G06F 16/27

Abstract:

Columns of a table are stored in either row-major format or column-major format in an in-memory DBMS. For a given table, one set of columns is stored in column-major format; another set of columns for a table are stored in row-major format. This way of storing columns of a table is referred to herein as dual-major format. In addition, a row in a dual-major table is updated “in-place”, that is, updates are made directly to column-major columns without creating an interim row-major form of the column-major columns of the row. Users may submit database definition language (“DDL”) commands that declare the row-major columns and column-major columns of a table.

US Patent:

20150088813, Mar 26, 2015

Filed:

Dec 5, 2013

Appl. No.:

14/097575

Inventors:

- Redwood Shores CA, US
Martin A. Reames - Minneapolis MN, US
Kirk Edson - Fremont CA, US
Neelam Goyal - San Mateo CA, US
Kao Makino - San Carlos CA, US
Anindya Patthak - Fremont CA, US
Dina Thomas - Palo Alto CA, US
Subhradyuti Sarkar - Fremont CA, US
Qingchun Jiang - Foster City CA, US

Assignee:

Oracle International Corporation - Redwood Shores CA

International Classification:

G06F 17/30

US Classification:

707609, 707803

Abstract:

Columns of a table are stored in either row-major format or column-major format in an in-memory DBMS. For a given table, one set of columns is stored in column-major format; another set of columns for a table are stored in row-major format. This way of storing columns of a table is referred to herein as dual-major format. In addition, a row in a dual-major table is updated “in-place”, that is, updates are made directly to column-major columns without creating an interim row-major form of the column-major columns of the row. Users may submit database definition language (“DDL”) commands that declare the row-major columns and column-major columns of a table.