Methods and systems may be associated with a cloud platform computing environment. A mapping expression data store may contain mapping expressions previously created by customer tenants of the cloud platform. Each mapping expression may be associated with at least one source mapping element and at least one target mapping element. A mapping expression generator may receive, from a user of a first customer tenant, a mapping expression search request that includes at least one requested source mapping element and at least one requested target mapping element. The mapping expression generator may then search the mapping expression data store based on the at least one requested source mapping element and at the least one requested target mapping element and output a result of the search to the user. The result of the search may include at least one mapping expression created by a customer tenant other than the first customer tenant.

Methods and systems may be associated with a cloud platform computing environment. A mapping expression data store may contain mapping expressions previously created by customer tenants of the cloud platform. Each mapping expression may be associated with at least one source mapping element and at least one target mapping element. A mapping expression generator may receive, from a user of a first customer tenant, a mapping expression search request that includes at least one requested source mapping element and at least one requested target mapping element. The mapping expression generator may then search the mapping expression data store based on the at least one requested source mapping element and at the least one requested target mapping element and output a result of the search to the user. The result of the search may include at least one mapping expression created by a customer tenant other than the first customer tenant.

Systems and methods of block computation are disclosed. An example of a method includes buffering a plurality of tuples in a build phase. The method also includes, after buffering a last of the plurality of tuples, applying a computation to all of the buffered tuples in a compute phase. The method also includes returning results of the computation one tuple at a time to a query processing pipeline in a stream-out phase.

This disclosure relates generally to information retrieval, and more particularly to a system and method for verifiable query of semantic data. In one embodiment, a method is provided for performing verifiable query on semantic data. The method comprises rendering a visualization of an ontology of the semantic data, acquiring one or more user interactions with the visualization, generating a semantic query and a natural language interpretation based on the one or more user interactions, and presenting the semantic query and the natural language interpretation to a user for validation.

Methods and arrangements for displaying results of one or more query searches. Query search results are obtained and there are determined, from the query search results, a best object type, a best instance of the best object type and one or more alternative object types, wherein determining a best object type includes consulting a collection of domain ontologies. The search results are displayed on a single screen via showing the best object type, the best instance of the best object type and the one or more alternative object types. Other variants and embodiments are broadly contemplated herein.

Techniques are described for unified indexing of semi-structured data. In an embodiment, a database management system (DBMS) stores a number of semi-structured data documents in its tables. Such documents include section(s) of nodes arranged in a hierarchy, having a root node and one or more leaf nodes. DBMS may receive a query specifying a path expression for the documents. Based on the path expression, the DBMS generates a query path identifier. The query path identifier is used as a lookup into the index store to determine that the query path identifier is a section path identifier for a partial hierarchical path. If so, the DBMS retrieves from the identified document at least one result node by evaluating nodes hierarchically belonging to the particular root node according to the query.

Techniques are described for unified indexing of semi-structured data. In an embodiment, a database management system (DBMS) stores a number of semi-structured data documents in its tables. Such documents include section(s) of nodes arranged in a hierarchy, having a root node and one or more leaf nodes. DBMS may receive a query specifying a path expression for the documents. Based on the path expression, the DBMS generates a query path identifier. The query path identifier is used as a lookup into the index store to determine that the query path identifier is a section path identifier for a partial hierarchical path. If so, the DBMS retrieves from the identified document at least one result node by evaluating nodes hierarchically belonging to the particular root node according to the query.