Andrew Rodriguez

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.

US Patent:

20180349443, Dec 6, 2018

Filed:

May 31, 2017

Appl. No.:

15/609250

Inventors:

- Sunnyvale CA, US
Andrew Rodriguez - Palo Alto CA, US
Srinath Shankar - Mountain View CA, US
Scott M. Meyer - Berkeley CA, US

Assignee:

LinkedIn Corporation - Sunnyvale CA

International Classification:

G06F 17/30

Abstract:

The disclosed embodiments provide a system for processing and storing data. During operation, the system obtains a set of records sorted by a first integer value, with each record containing the first integer value and one or more additional integer values. The system sets, for each integer value in each record, a delta encoding bit that indicates whether the integer value is delta encoded with respect to at least one other integer value in the records. Next, the system uses a delta encoding state represented by the delta encoding bit to calculate an encoded value from the integer value. The system then encodes a length of the encoded value in a length tag for the integer value and replaces the integer value in the record with an encoded version containing the delta encoding bit, the length tag, and the encoded value.

US Patent:

20180144060, May 24, 2018

Filed:

Nov 23, 2016

Appl. No.:

15/360318

Inventors:

- Sunnyvale CA, US
Andrew Rodriguez - Palo Alto CA, US
Srinath Shankar - Mountain View CA, US
Scott M. Meyer - Berkeley CA, US

Assignee:

LinkedIn Corporation - Sunnyvale CA

International Classification:

G06F 17/30

Abstract:

The disclosed embodiments provide a system for processing queries of a graph database. During operation, the system executes one or more processes for processing queries of a graph database storing a graph, wherein the graph comprises a set of nodes, a set of edges between pairs of nodes in the set of nodes, and a set of predicates. When a query of the graph database is received, the system processes the query by matching a query time of the query to a virtual time in a log-based representation of the graph database. Next, the system uses an edge store for the graph database to access a subset of the edges matching the query. The system then generates a result of the query by materializing updates to the subset of the edges before the virtual time and provides the result in a response to the query.