Aspects of the disclosure relate to transliteration of machine interpretable languages. A computing platform may train a machine learning model using source syntax trees and target dialect syntax trees, which may configure the model to output source dialect keys and their corresponding target dialect queries. The computing platform may execute the corresponding target dialect queries to identify whether they are valid. For a valid target dialect query, the computing platform may store the valid target dialect query and first source dialect keys corresponding to the valid target dialect query in a lookup table. For an invalid target dialect query resulting in error, the computing platform may: 1) identify a cause of the error; 2) generate a transliteration rule to correct the error; and 3) store, in the lookup table, the invalid target dialect query, second source dialect keys corresponding to the invalid target dialect query, and the transliteration rule.

Aspects of the disclosure relate to transliteration of machine interpretable languages. A computing platform may receive a request to perform a data migration from a first database configured in a first format to a second database configured in a second format. The computing platform may receive, from the client application and at an abstraction layer, a query. Based on identifying that the query is formatted for execution at the second database, the computing platform may route the query to the second database for execution. Based on identifying that the query is not formatted for execution at the second database, the computing platform may: 1) translate the query from the first format to the second format by using pre-verified query keys to convert the query from the first format into the second format, and 2) route the translated query to the second database for execution.

Aspects of the disclosure relate to transliteration of machine interpretable languages. A computing platform may configure a client application to use a custom driver when communicating with an enterprise database. The computing platform may receive a database query formatted in a first database format corresponding to a first database. The computing platform may translate, using a query translation library, the database query from the first database format into a second database format corresponding to a second database, which may cause the custom driver to execute a transliteration process using pre-verified query keys stored in the query translation library to convert the database query from the first database format into the second database format. The computing platform may execute the translated database query on the second database to obtain a query result, and may send the query result to the client application.

Embodiments permit searching across different system landscapes, for data associated with master data objects. A map is constructed comprising (explicit, inferred) connections between different pieces of data located in various databases, systems, and landscapes. In certain embodiments the map is constructed utilizing a parameter (e.g., family name) present in a received query, as a boundary condition. The map may be in tabular form, and may conform to a particular notation scheme. Once the map is constructed, the query is executed thereupon to search for relevant data. The corresponding query result is received and stored, ultimately for communication back to the user posing the original query. Embodiments may be particularly suited to returning private data of a unique entity (e.g., natural person, corporation, juristical person) that is stored over a variety of different master data objects (e.g., employee, customer, supplier) and across complex system landscapes.

Techniques support graph pattern matching queries inside a relational database management system (RDBMS) that supports SQL execution. The techniques compile a graph pattern matching query into a SQL query that can then be executed by the relational engine. As a result, techniques enable execution of graph pattern matching queries on top of the relational engine by avoiding any change in the existing SQL engine.

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for index-side synonym expansion. One method includes obtaining a token sequence for a resource and indexing a token in the token sequence. The indexing includes applying one or more stemming rules to the particular token to generate a stemmed form of the token, obtaining a variant of the stemmed form of the token, and storing data associating the resource with both the token and the variant as index terms for the resource in a search engine index.

Embodiments as disclosed may provide a search operator that addresses the problems inherent in the searching based on an entire block of text. Specifically, embodiments as disclosed may provide a search operator that may address the problem of complex query construction and efficient and effective implementation for finding objects based on a block of text.

Provided is a method to obtain a first query indicating a set of fields of a record of a first data store and generate a plurality of queries based on the first query, where the plurality of queries includes a shared set of parameters. The method includes storing a plurality of query values identifying the plurality of queries in an in-memory data store, determining a second query comprising the shared set of parameters based on the plurality of queries, and locking a set of values of the record based on the second query. The method includes retrieving a query response comprising the set of values with the second query, fulfilling the plurality of queries stored in the in-memory data store based on the set of values, and generating a response to the first query based on the fulfilled plurality of queries.

Embodiments as disclosed may provide a search operator that addresses the problems inherent in the searching based on an entire block of text. Specifically, embodiments as disclosed may provide a search operator that may address the problem of complex query construction and efficient and effective implementation for finding objects based on a block of text.

A building system of a building including one or more memory devices having instructions thereon, that, when executed by one or more processors, cause the one or more processors to receive a request to access a portion of a building graph of the building from a system, the building graph including a plurality of nodes and a plurality of edges, the plurality of nodes representing entities of the building and the plurality of edges representing relationships between the entities of the building. The instructions cause one or more processors to determine whether the system has access to the portion of the building graph based on a policy indicated by the plurality of nodes and edges of the building graph and provide the portion of the building graph to the system in response to a determination that the system has access to the portion of the building graph.