Sentence examples for by a query graph from inspiring English sources

We also represent a given SPARQL query by a query graph Q (Fig. 1b).

A SPARQL statement is the input to the SPARQL Parser, which is generated by a parser generator library called ANTLR3.10 The SPARQL query is parsed into a syntax tree, based on which, we build a query graph Q and encode it into a query signature graph (Q^*) as discussed earlier.

Given a query graph Q and the data graph G, a distance join query returns all the subgraphs from G that satisfy every pairwise distance constraint in Q.

An induced subgraph isomorphism between a query graph G1 and a target graph G2 exists if G1 is isomorphic to an induced subgraph of G2, i.e., the query graph G1 is a subgraph of the target graph G2.

Intuitively, a querying graph is an undirected graph which regroups all the entities (abstract and concrete) and the links (between concrete or abstract entities) necessary to compute all the alternative queries from an intermediate query.

For each intermediate query, we build a querying graph where each abstract entity is linked to all its corresponding concrete entities (Fig. 5).

A mixed query graph is a directed graph where vertices are abstract or concrete entities chosen in the general graph, and edges are associations between these entities, taken from the general graph of entities.

OrChem further improves VF2 performance by reorganizing the query graph beforehand by sorting the nodes (atoms) and edges (bonds).

This interface allows to construct a mixed query graph, guided by the general graph of entities.

Specifically, we interpret a natural language question N as a semantic query graph (Q^mathrm{S}).

If the match results in a connected graph, it is accepted as a logical query graph and sent to query generator.