Abstract: The disclosed embodiments provide a system for managing code and data in a multi-cluster environment. During operation, storage nodes in a first cluster execute instances of a scheduler that initiates actions including creating a database image, copying the database image, and loading the database image. Next, the scheduler issues, to a synchronization service, a first action to be performed by a second cluster based on a deployment schedule for data in a distributed database. Upon receiving a confirmation that the first action has been completed, the first cluster performs a second action received from the synchronization service to manage deployment of data in the distributed database on the first cluster. Upon completing the second action at a storage node in the first cluster, the storage node issues a completion of the second action to the synchronization service.

Abstract: The disclosed embodiments provide a system for performing difference-based comparisons in log-structured graph databases. During operation, the system performs a first write of a first set of graph data to a first log-structured graph database followed by a second write of a second set of graph data to the first log-structured graph database to determine a first difference between the two sets of graph data. Next, the system performs a third write of the second set of graph data to a second log-structured graph database followed by a fourth write of the first set of graph data to the second log-structured graph database to determine a second difference between the two sets of graph data. The system then determines, based on the differences, a comparison result containing a set-based relationship between the two sets of graph data. Finally, the system outputs the comparison result.

Abstract: The disclosed embodiments provide a system for performing multi-tenancy distribution of a graph database cache. During operation, the system obtains a cache of a set of records in a 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. Next, the system identifies one or more records in the cache that fail a validation test. The system then merges a remainder of the cache with online updates to the subset of records to produce a merged version of the cache. Finally, the system distributes the merged version to one or more instances of the graph database for use in processing queries of the graph database.

Abstract: The disclosed embodiments provide a system for performing multi-tenancy distribution of a graph database cache. During operation, the system obtains a cache of a set of records in a 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. Next, the system identifies one or more records in the cache that fail a validation test. The system then merges a remainder of the cache with online updates to the subset of records to produce a merged version of the cache. Finally, the system distributes the merged version to one or more instances of the graph database for use in processing queries of the graph database.

Abstract: A system executes a query associated with an application against a graph database by providing, to a first shard of the graph database, the query and a first query header that specifies the first shard. The query includes a subject, a predicate and an object, and the graph database stores a graph that includes nodes, edges between the nodes, and predicates to represent and store data. In response to the query, the system receives results and associated result headers from the first shard and a second shard, where the result headers specify that the results are partial results that are particular fractions of a total result. Furthermore, a combination of the partial results provides the total result to the query that includes a subset of the graph. Note that the subset of the graph may include desired information expressed within an associated structure of the graph.

Abstract: The disclosed embodiments provide a system for processing data. During operation, the system obtains, for a time interval, a set of performance metrics for one or more monitored systems. Next, the system aggregates the performance metrics by a processing factor associated with execution of the monitored system(s). The system then uses the aggregated performance metrics to calculate a performance score associated with the processing factor. Finally, the system outputs the performance score with other performance scores for other performance factors associated with execution of the one or more monitored systems for use in assessing the performance of the monitored system(s).

Abstract: The disclosed embodiments provide a system for processing data. During operation, the system launches a set of child 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 transmits the query to one or more of the child processes. Next, the system receives a result of the query from the one or more child processes. The system then provides the result in a response to the query.

Abstract: A system executes a query associated with an application against a graph database by providing, to a first shard of the graph database, the query and a first query header that specifies the first shard. The query includes a subject, a predicate and an object, and the graph database stores a graph that includes nodes, edges between the nodes, and predicates to represent and store data. In response to the query, the system receives results and associated result headers from the first shard and a second shard, where the result headers specify that the results are partial results that are particular fractions of a total result. Furthermore, a combination of the partial results provides the total result to the query that includes a subset of the graph. Note that the subset of the graph may include desired information expressed within an associated structure of the graph.

Abstract: A system executes a query associated with an application against a graph database by providing, to a first shard of the graph database, the query and a first query header that specifies the first shard. The query includes a subject, a predicate and an object, and the graph database stores a graph that includes nodes, edges between the nodes, and predicates to represent and store data. In response to the query, the system receives results and associated result headers from the first shard and a second shard, where the result headers specify that the results are partial results that are particular fractions of a total result. Furthermore, a combination of the partial results provides the total result to the query that includes a subset of the graph. Note that the subset of the graph may include desired information expressed within an associated structure of the graph.