摘要:
A query rewriting processor (processor) analyzes database semantic models (e.g., RDF knowledge graphs) that capture the interconnections (e.g., foreign and primary key links to other tables) present in a relational database. The processor generates an enriched model query given an initial model query (e.g., a SPARQL query) against the semantic model. The processor generates the enriched model query and translates the enriched model query into a relational database query (e.g., an SQL query). The processor may then pass the relational database query to another system or process (e.g., a data virtualization layer) for execution against the individual relational databases. In this manner, the processor automatically translates queries for information about the relational database structure to a corresponding or matching query for data from the relational database structure.
摘要:
Data acquisition is facilitated by way of an intermediate representation of a query expression. The intermediate representation can be generated and subsequently transmitted to, and employed by, a plurality of execution environments with respect to query execution. More particularly, the intermediate representation can be transformed into a locally executable query expression. Furthermore, numerous factors can shape the created and transmitted intermediate representation.
摘要:
The invention relates to a method for performing a query to a database system. In the method metadata relating to a database is retrieved from the database system. A search category is determined based on the metadata. The search category represents relationships between tables in the database. Search terms associated with the columns in the tables and received. A search data structure is obtained based on the search category and the search terms. The data structure comprises different parts corresponding to different tables. Search corresponding to the different parts are executed as separate using information in the different parts of the search data structure. A set operation between key column value sets obtained from the searches.
摘要:
Determining metadata associated with a graph-based computation includes functionally transforming metadata associated with a first portion (2310) of a graph to generate transformed metadata associated with a second portion (2316) of the graph; determining a third portion (2317) of the graph related to the second portion of the graph; and propagating the transformed metadata from the second portion of the graph to the third portion of the graph.
摘要:
The present invention is a method and system for querying a database system. An object query identifies a partial set of properties of an object to be returned. A portion of the relational database containing those properties is identified and only those properties are returned.
摘要:
Computerized tools for modeling database designs and specifying queries of the data contained therein. Once it is determined that an information system needs to be created, the Fact Complier (100) of the present invention is invoked to create it. After creating the information system, the user creates a fact-tree, using the Fact ^_Tree ^_Specification Module (300), as a prelude to generating queries to the system. After creating the fact-tree, the user verifies that it is correct, using the Tree Interpreter, invoked as Fact ^_Tree ^_to ^_Description Module (500), of the present invention. Once the fact-tree has been verified, the Query Mapper of the present invention, invoked as Fact ^_Tree ^_to ^_SQL ^_Query Module (400), is used to generate information system queries.
摘要:
A system for natural language (NL) analyzis is provided which comprises apparatus and method. It has the capability to analyze NL expressions and to resolve ambiguities and present them to the user for verification of correct interpretation. The invention is based on a language independent model of the contents of a data base. The model contains records of information defining entity types and relations between such entity types. The model is created (customizing the system) by the user, and is stored as a conceptual schema. The entities of the schema are linked or connected to natural language terms in a vocabulary. The entities represent objects in the data base, and there is a link or connection between the entities and those objects of the data base. The actual analysis of NL expressions is performed by a Natural Language Engine (NLE) in cooperation with an Analysis Grammar and the schema. The analysis results in an intermediate, language independent logic form representation of the input, which is paraphrased back to NL for verification, and if the input is a query, there is a translation into a query language such as SQL.
摘要:
Facilitating the searching of structured documents by identifying multiple element paths corresponding to multiple elements included in multiple structured documents, and for each of the element paths providing, for inclusion in a first searchable data structure, the element path exclusive of a value of the element corresponding to the element path and exclusive of an identifier of the structured document including the element corresponding to the element path, and providing, for inclusion in a second searchable data structure, the element path in association with a value of the element corresponding to the element path and in association with an identifier of the structured document including the element corresponding to the element path.
摘要:
Embodiments include a querying method for a database of graph data encoded as triples, the triples each comprising values of three triple elements and being stored on a plurality of storage servers, the method comprising: a dividing step comprising dividing a query into a plurality of result criteria, the result criteria comprising a plurality of triple patterns which some or all query results must match, each triple pattern is composed of three triple pattern elements each corresponding to a different one of the three triple elements; each triple pattern element being either: a single value triple pattern element specifying a single value of the corresponding triple element which triples must have to match the triple pattern; or a variable value triple pattern element specifying an ID of a variable, the ID being attributed to values of the corresponding triple elements of triples matching the triple pattern. The method further comprises a sub-query forming step comprising, forming one or more sub-queries each comprising two or more triple patterns having the same single value triple pattern element or specifying the same ID of a variable as a variable value triple pattern element; a sub-query issuing step comprising issuing each formed sub-query to each of the plurality of storage servers; and a query result preparing step comprising receiving triples satisfying at least one formed sub-query as sub-query results from the plurality of storage servers and using the sub-query results to prepare query results as a response to the query.