Microsoft Technology Licensing, LLC

Linkedin Corporation

Siddharth Rajendra Shah

Alexander Hopmann

Nikita Voronkov

Viktoriya Taranov

Daniel Blood

Tarkan Sevilmis

Andrew Joseph Carter

Andrew Rodriguez

Ramanathan Somasundaram

Scott M Meyer

Bhavesh Anil Doshi

Artsiom Kokhan

Ying Lu

Benjamin Gustav Wilde

Puneet Narula

Arun Keller Krishnamoorthy

Karan Rajen Parikh

Michael Augustine Tavis

Alexei Evdokimov

Yiming Yang

Suruchi H Shah

Andrew Codispoti

Steven Callister

Soyeon Ki

Kenneth Y Li

Kartik Sathyanarayanan

Tushar Goyal

Shrinivas Sivakumar

Indranil Sen

Dhruvesh Rathore

Tiance Liang

Jiajun Yao

Kai Yiu Luk

Antonio Marcos Da Silva, Jr

Robert Lomme

Eric Manuel

Antonio Marco Da Silva

Antonio Marcos Da Silva

The disclosed technologies are capable of reading ingestion configuration data for a client of a plurality of clients of a graph database, transforming the ingestion configuration data from a declarative representation into a graph representation of the ingestion configuration data, storing the graph representation of the ingestion configuration data in the graph database, providing the graph representation of the ingestion configuration data to a data service, where the data service comprises one or more of (i) a physical grouping of at least one computing device configured to store at least a portion of the graph database, (ii) a logical grouping of at least one computing device configured to store at least a portion of the graph database, or (iii) a combination of (i) and (ii).

Ingestion system for distributed graph database

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.

Enforcing path consistency in graph database path query evaluation

The disclosed technologies are capable of selectively using data structure operations for path query evaluation. One technique involves reading a query that traverses at least two nodes and at least one edge of a graph in a graph database; compiling the query into a set of variables and a set of constraints, where the set of variables and the set of constraints correspond to the two nodes and the one edge of the graph; creating an in-memory data structure that comprises a table; using the set of variables and the set of constraints to determine an operation that is performable using the in-memory data structure; checking for an existence of a condition relating to the in-memory data structure or the operation; skipping the operation if the condition exists or executing the operation if the condition does not exist; and storing a set of intermediate query results in the table.

Selective use of data structure operations for path query evaluation

A secondary location is configured as a recovery service for a primary location of the service. The secondary location is maintained in a warm state that is configured to replace the primary location in a case of a failover. During normal operation, the secondary location is automatically updated to reflect a current state of the primary location that is actively servicing user load. Content changes to the primary location are automatically reflected to the secondary location. System changes applied to the primary location are automatically applied to the secondary location. For example, removing/adding machines, updating machine/role assignments, removing adding/database are automatically applied to the secondary location such that the secondary location substantially mirrors the primary location. After a failover to the secondary location, the secondary location becomes the primary location and begins to actively service the user load.

Automatic configuration of a recovery service

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.

Path query evaluation in graph databases

Techniques are provided for minimizing latency due to garbage collection in a distributed system. Time data is stored at a computing device. The time data indicates when each of multiple computing nodes (e.g., servers) in the distributed system might be performing (or is scheduled to perform) a garbage collection operation. The computing device receives a first request and, in response, determines, based on the time data, one or more computing nodes to process a second (e.g., related) request, which may contain identical content as in the first request. The second request is sent to the one or more computing nodes.

Minimizing latency due to garbage collection in a distributed system

Jobs submitted to a primary location of a service within a period of time before and/or after a fail-over event are determined and are resubmitted to a secondary location of the service. For example, jobs that are submitted fifteen minutes before the fail-over event and jobs that are submitted to the primary network before the fail-over to the second location is completed are resubmitted at the secondary location. After the fail-over event occurs, the jobs are updated with the secondary network that is taking the place of the primary location of the service. A mapping of job input parameters (e.g. identifiers and/or secrets) from the primary location to the secondary location are used by the jobs when they are resubmitted to the secondary location. Each job determines what changes are to be made to the job request based on the job being resubmitted.

Replaying jobs at a secondary location of a service

A security trimming system disclosed herein uses intelligent caching of the security trimming information received from a security datastore. The security trimming system uses an access cache to store the security trimming information received from the access datastore together with other parameters associated with such security trimming information. Subsequently, in responding to a request for the security trimming information, the security trimming system uses the cached value of the security trimming information together with the other associated parameters to determine a response to the request from the content providers. In one implementation, if the other parameters associated with a particular security trimming information imply that the security trimming information in the cache is still valid, the cached security trimming information is used in the request response. Otherwise, a new request is sent to the security datastore for an updated value of the security trimming information.

Intelligent caching for security trimming

A secondary location of a network acts as a recovery network for a primary location of the service. The secondary location is maintained in a warm state that is configured to replace the primary location in a case of a failover. During normal operation, the primary location actively services user load and performs backups that include full backups, incremental backups and transaction logs that are automatically replicated to the secondary location. Information is stored (e.g. time, retry count) that may be used to assist in determining when the backups are restored correctly at the secondary location. The backups are restored and the transaction logs are replayed at the secondary location to reflect changes (content and administrative) that are made to the primary location. After failover to the secondary location, the secondary location becomes the primary location and begins to actively service the user load.

Recovery service location for a service

A computing system receives a web services request to invoke a method of web Application Programming Interface (API). In response to receiving the web services request, the computing system invokes a method of a language-dependent API of a client component in a collaboration system. The client component communicates with a collaboration server component in the collaboration system using a proprietary communications protocol. The method of the language-dependent API is a method to obtain data from the collaboration server component. After invoking the method, the computing system sends a web services response whose contents depend on the data obtained from the collaboration server component.

Web services access to content items stored by collaboration systems

Growing community of inventors

Bothell, WA, United States of America

Siddharth Rajendra Shah