Andrew J Rodriguez

US Patent:

20220414100, Dec 29, 2022

Filed:

Jun 29, 2021

Appl. No.:

17/362614

Inventors:

- Redmond WA, US
Andrew RODRIGUEZ - Sunnyvale CA, US
Yiming YANG - Danville CA, US
Dhruvesh RATHORE - San Francisco CA, US
Jiajun YAO - San Jose CA, US
Tiance LIANG - Mountain View CA, US

International Classification:

G06F 16/2453
G06F 16/2458
G06F 11/34

Abstract:

The disclosed technologies are capable of decentralized query evaluation for a distributed graph database. In one technique, a query is divided into first and second sets of operations. The query comprises variables and constraints that correspond to at least two nodes and at least one edge of a graph in a graph database. The first set of operations for processing the query is assigned to multiple shards. A limit is communicated to the shards. The second set of operations for processing the query is executed. A list of completed operations is received from each shard. The lists of operations received from the shards are merged into a merged set of operations, which is used to determine whether query processing is finished. If query processing is not finished, then an updated limit is communicated to the shards; otherwise, query results are provided in response to the query.

US Patent:

20220251128, Aug 11, 2022

Filed:

May 15, 2020

Appl. No.:

17/611765

Inventors:

- Carlsbad CA, US
Andrew A. Rodriguez - San Diego CA, US
Daniel C. Capaldi - Carlsbad CA, US

Assignee:

Ionis Pharmaceuticals, Inc. - Carlsbad CA

International Classification:

C07H 1/00
C07H 21/02
C07H 21/04

Abstract:

The present disclosure provides methods for synthesizing oligomeric compounds having at least one phosphorothioate diester linkage and at least one phosphate diester internucleoside linkage. In certain embodiments, the present disclosure provides oxidation reagents that produce low amounts of unwanted phosphate diester impurities in oligomeric compounds having at least one phosphorothioate diester linkage and at least one phosphate diester internucleoside linkage.

US Patent:

20210397601, Dec 23, 2021

Filed:

Sep 3, 2021

Appl. No.:

17/466717

Inventors:

- Redmond WA, US
Ying Lu - Sunnyvale CA, US
Siddharth Shah - Mountain View CA, US
Andrew Rodriguez - Sunnyvale CA, US
Scott M. Meyer - Berkeley CA, US

International Classification:

G06F 16/23
G06F 16/901
G06F 16/248
G06F 17/16
G06F 16/28
G06F 16/22

Abstract:

The disclosed embodiments provide a system for processing queries of a graph database. During operation, the system stores intermediate results of the query in a structure comprising rows in a set of tables and links between pairs of rows in different tables in the set of tables. Next, the system tracks, in the structure, representations of data, relationships, and path consistency in the query. The system then applies one or more operations to existing rows in the structure to generate a final result of the query. Finally, the system provides the final result in a response to the query.

US Patent:

20210097054, Apr 1, 2021

Filed:

Sep 30, 2019

Appl. No.:

16/588644

Inventors:

- Redmond WA, US
Ying Lu - Sunnyvale CA, US
Siddharth Shah - Mountain View CA, US
Andrew Rodriguez - Palo Alto CA, US
Scott M. Meyer - Berkeley CA, US

International Classification:

G06F 16/23
G06F 16/901
G06F 16/22
G06F 17/16
G06F 16/28
G06F 16/248

Abstract:

The disclosed embodiments provide a system for processing queries of a graph database. During operation, the system stores intermediate results of the query in a structure comprising rows in a set of tables and links between pairs of rows in different tables in the set of tables. Next, the system tracks, in the structure, representations of data, relationships, and path consistency in the query. The system then applies one or more operations to existing rows in the structure to generate a final result of the query. Finally, the system provides the final result in a response to the query.

US Patent:

20210026894, Jan 28, 2021

Filed:

Jul 26, 2019

Appl. No.:

16/523095

Inventors:

- Redmond WA, US
Andrew Rodriguez - Palo Alto CA, US
Andrew J. Carter - Mountain View CA, US
Scott M. Meyer - Berkeley CA, US

Assignee:

Microsoft Technology Licensing, LLC - Redmond WA

International Classification:

G06F 16/901
G06F 16/903

Abstract:

The disclosed embodiments provide a system for processing queries of a graph database storing a graph, wherein the graph comprises a set of edges defined by a first linkage, a second linkage, and a third linkage. During operation, the system maintains the base version of an index of the graph database. Upon branching a version of the graph database from a first offset representing a virtual time in the base version of the graph database, the system creates a branched version of the index from a second offset corresponding to the virtual time in the base version of the index. The system then processes queries of the graph database based on the offsets and references from the branched version of the index to the base version of the index.

US Patent:

20200364100, Nov 19, 2020

Filed:

May 14, 2019

Appl. No.:

16/412160

Inventors:

- Redmond WA, US
Andrew Rodriguez - Palo Alto CA, US
Andrew J. Carter - Mountain View CA, US
Scott M. Meyer - Berkeley CA, US

Assignee:

Microsoft Technology Licensing, LLC - Redmond WA

International Classification:

G06F 9/54
G06F 3/06
G06F 16/176
G06F 16/901
G06F 12/1009

Abstract:

The disclosed embodiments provide a system for managing inter-process communication. During operation, the system executes a block storage manager for managing shared memory that is accessed by a write process and multiple read processes. Next, the block storage manager manages one or more data structures storing mappings that include block identifiers (IDs) of blocks representing chunks of the shared memory, files in the blocks, and directories containing the files. The block storage manager then applies an update by the write process to a subset of the blocks by atomically replacing, in the one or more data structures, a first directory containing an old version of the subset of the blocks with a second directory containing a new version of the subset of the blocks.

US Patent:

20190303478, Oct 3, 2019

Filed:

Mar 28, 2018

Appl. No.:

15/939065

Inventors:

- Redmond WA, US
Andrew Rodriguez - Palo Alto CA, US
Scott M. Meyer - Berkeley CA, US
Siddharth Shah - Mountain View CA, US

Assignee:

Microsoft Technology Licensing, LLC - Redmond WA

International Classification:

G06F 17/30

Abstract:

The disclosed embodiments provide a system for processing queries of a graph database. During operation, the system stores intermediate results of a query in a structure comprising rows in a set of tables. Next, the system applies one or more operations to existing rows in the structure to generate additional rows in additional tables of the structure. The system also tracks inputs and outputs associated with the one or more operations in a set of relationships between rows of different tables in the structure. Finally, the system uses the rows and the set of relationships to generate a final result of the query and provides the final result in a response to the query.

US Patent:

20190026334, Jan 24, 2019

Filed:

Jul 20, 2017

Appl. No.:

15/655303

Inventors:

- Sunnyvale CA, US
Scott M. Meyer - Berkeley CA, US
Andrew Rodriguez - Palo Alto CA, US
Walaa Eldin M. Moustafa - Santa Clara CA, US

Assignee:

LinkedIn Corporation - Sunnyvale CA

International Classification:

G06F 17/30
G06F 17/10

Abstract:

The disclosed embodiments provide a system for processing queries of a graph database. During operation, the system executes a set of processes for maintaining the graph database storing a graph, wherein the graph includes a set of nodes, a set of edges between pairs of nodes in the set of nodes, and a set of predicates. When a write query of the graph database is received, the system uses one or more of the processes to process the write query by using a schema of the graph database to validate the write query. Next, the system transmits the validated write query to a set of shards containing the graph database. Finally, the system processes the write query at each shard when a shard identifier representing the shard is matched to one or more attributes in the write query.