Abstract: Various examples of improving an in-memory graph query engine using a persisted storage component are provided. The method includes updating data stored in an in-memory graph query engine and, based on updating the data, converting the data to a plain text form that may be more efficiently stored in the persistent storage component. The method further includes updates to additional in-memory graph query engines from the persistent storage component such that in-memory data stored in the graph query engines is synchronized.

Abstract: Databases are often provided according to various organizational models (e.g., document-oriented storage, key/value stores, and relational database), and are accessed through various access models (e.g., SQL, XPath, and schemaless queries). As data is shared across sources and applications, the dependency of a data service upon a particular organizational and/or access models may become confining. Instead, data services may store data in a base representation format, such as an atom-record-sequence model. New data received in a native item format may be converted into the base representation format for storage, and converted into a requested format to fulfill data requests. Queries may be translated from a native query format into a base query format that is applicable to the base representation format of the data set, e.g., via translation into an query intermediate language (such as JavaScript) and compilation into opcodes that are executed by a virtual machine within the database engine.

Abstract: In embodiments of the present disclosure, there is provided a scheme for translating a functional graph traversal language to an extended Structured Query Language (SQL). After a first query compiled with the functional graph traversal language is obtained, the first query is translated to a second query in the form of the extended Structured Query Language based on the translating rules. By extending the standard Structured Query Language, embodiments of the present disclosure enable retaining directed edges between vertices in the graph database in the second query and retaining flow control, iteration, temporary variable definition, advanced data structure, side effect, and dependency between steps included in the first query.

Abstract: Databases are often provided according to various organizational models (e.g., document-oriented storage, key/value stores, and relational database), and are accessed through various access models (e.g., SQL, XPath, and schemaless queries). As data is shared across sources and applications, the dependency of a data service upon a particular organizational and/or access models may become confining. Instead, data services may store data in a base representation format, such as an atom-record-sequence model. New data received in a native item format may be converted into the base representation format for storage, and converted into a requested format to fulfill data requests. Queries may be translated from a native query format into a base query format that is applicable to the base representation format of the data set, e.g., via translation into an query intermediate language (such as JavaScript) and compilation into opcodes that are executed by a virtual machine within the database engine.

Abstract: A partitioning advisor for online transaction processing (OLTP) workloads generates a workload dependency graph based on a schema defining a structure of a relational database and a workload associated with an OLTP application that accesses the relational database. Based on the workload dependency graph, the partitioning advisor generates one or more partitioning strategy recommendations for sharding the relational database. The partitioning advisor may also render a visualization based on the workload dependency graph, enabling a user to see the impact each recommended partitioning strategy is predicted to have.

Abstract: A partitioning advisor for online transaction processing (OLTP) workloads generates a workload dependency graph based on a schema defining a structure of a relational database and a workload associated with an OLTP application that accesses the relational database. Based on the workload dependency graph, the partitioning advisor generates one or more partitioning strategy recommendations for sharding the relational database. The partitioning advisor may also render a visualization based on the workload dependency graph, enabling a user to see the impact each recommended partitioning strategy is predicted to have.