TRAVERSING A SPARQL QUERY AND TRANSLATION TO A SEMANTIC EQUIVALENT SQL

摘要

In an approach for semantically translating data. Aspects of an embodiment of the present invention include an approach for semantically translating data, wherein the approach includes a processor selecting a first node. A processor identifies a parent node of the first node. A processor determines that a value of the first node is unknown. A processor responsive to determining that the value of the first node is unknown, annotates the first node to indicate that the first node is at least partially unknown. A processor identifies a common table expression of the first node. A processor determines that the common table expression of the first node matches, within a predetermined threshold, a common table expression of the second node. A processor merges information from the common table expression of the second node with the common table expression of the first node.

主权项

1. A method for semantically translating data, the method comprising:
selecting, by one or more processors, a first node; identifying, by one or more processors, a parent node of the first node; determining, by one or more processors, that a value of the first node is unknown; responsive to determining that the value of the first node is unknown, annotating, by one or more processors, the first node to indicate that the first node is at least partially unknown; identifying, by one or more processors, a common table expression of the first node; determining, by one or more processors, that the common table expression of the first node matches, within a first predetermined threshold, a common table expression of a second node; determining, by one or more processors, that the common table expression of the first node matches, within a second predetermined threshold, the common table expression of the second node and a common table expression of a third node concurrently; merging, by one or more processors, information from the common table expression of the first node with information from the common table expression of the second node and information from the common table expression of the third node concurrently; merging, by one or more processors, information from the common table expression of the second node with the common table expression of the first node; determining, by one or more processors, that the value of the first node can be relocated to a third node; merging, by one or more processors, the value of the first node with the third node; identifying, by one or more processors, a common table expression of the third node; determining, by one or more processors, that the common table expression of the third node matches, within a third predetermined threshold, a common table expression of a fourth node; merging, by one or more processors, information from the common table expression of the third node with the common table expression of the first node; determining, by one or more processors, the value of the first node can be relocated to the second node and the third node concurrently; responsive to merging the information from the common table expression of the second node with the common table expression of the first node, annotating, by one or more processors, the common table expression of the first node to indicate that the information from the common table expression of the second node has been merged with the common table expression of the first node; determining, by one or more processors, whether a triple associated with the first node is evaluated; and responsive to determining, whether the triple associated with the first node is evaluated, merging, by one or more processors, at least a portion of the triple associated with the first node with at least a portion of the second node.