Semantic Link Discovery

• US 20110106836A1
• Filed: 10/30/2009
• Published: 05/05/2011
• Est. Priority Date: 10/30/2009
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Lim, Lipyeow, Kementsietsidis, Anastasios, Hassanzadeh, Oktie, Wang, Min
• Application Number:
  US12/609,657
• Publication Number:
  US 20110106836A1
• Time in Patent Office: Days
• US Class Current: 707/769
• CPC Class Codes: G06F 16/2465 Query processing support for facilitating data mining operations in structured databases

Abstract

A method of semantic link discovery through translation of basic declarative language includes receiving a set of linkage specifications, receiving a set of data sources related to the linkage specifications, the set of data sources and the set of linkage requirements forming a basic declarative language query, translating the basic declarative language query into a standard language query, executing the standard language query, and returning results of the standard language query in response to the executing.

Claims

1. A method of semantic link discovery through translation of basic declarative language, comprising:

receiving a set of linkage specifications;

receiving a set of data sources related to the linkage specifications, the set of data sources and the set of linkage requirements forming a basic declarative language query, the basic declarative language query including specialized terms directed to linkage specifications;

translating the basic declarative language query into a standard language query;

executing the standard language query; and

returning results of the standard language query in response to the executing.

2. The method of claim 1, wherein the set of linkage specifications includes a linkage method and a threshold.

3. The method of claim 2, wherein the threshold is an upper limit of the number of returned results.

4. The method of claim 2, wherein the linkage method is one of a native linkage method and a user-defined linkage method.

5. The method of claim 4, wherein the user-defined linkage method is a Boolean representation of a string matching algorithm.

6. The method of claim 4, wherein the native linkage method is a linkage method native to the standard language query.

7. The method of claim 4, wherein the native linkage method is one of a Jaccard similarity method, an intersection size method, a weighted Jaccard similarity method, and a weighted intersection size method.

8. The method of claim 1, wherein the translating includes dividing the basic declarative language query into a base query template of the standard language used by the standard language query and a link clause expression, wherein:

the link clause expression is a Boolean combination of separate link clauses, and each separate link clause is a semantic Boolean condition of two columns of relational data included in the source data specifications; and

the base query template is a template associated with the standard language query and provides a skeleton for the translation.

9. The method of claim 1, wherein the linkage specifications includes one of a specification to match based on string similarity, a specification to match based on semantic information of type synonyms, and a specification to match based on semantic information of type hyponyms or hypernyms.

10. The method of claim 9, further comprising receiving parameters describing the string similarity, the semantic specification of type synonyms, or the semantic information of type hyponyms or hypernyms.

11. The method of claim 10, further comprising determining a generic standard language rewrite of the string similarity, the semantic specification of type synonyms, or the semantic information of type hyponyms or hypernyms.

12. The method of claim 11, further comprising replacing parameters of the standard language rewrite with parameters included in the received linkage specifications.

17. The method of claim 1, wherein the primitive linkage specifications includes one of a specification to match based on string similarity, a specification to match based on semantic information of type synonyms, and a specification to match based on semantic information of type hyponyms or hypernyms, and wherein the method further comprises:

receiving parameters describing the string similarity, the semantic specification of type synonyms, or the semantic information of type hyponyms or hypernyms; and

determining a generic standard language rewrite of the string similarity, the semantic specification of type synonyms, or the semantic information of type hyponyms or hypernyms.

13. A method of semantic link discovery through translation of basic declarative language, comprising:

receiving a set of linkage requirements;

receiving a set of primitive linkage specifications;

receiving a set of data sources related to the primitive linkage specifications and linkage requirements, the set of data sources, the set of primitive linkage requirements, and the set of linkage requirements forming a basic declarative language query, the basic declarative language query including specialized terms directed to linkage specifications;

translating the basic declarative language query into a standard language query;

executing the standard language query; and

returning results of the standard language query in response to the executing.

14. The method of claim 13, wherein the translating includes dividing the basic declarative language query into a base query template of the standard language used by the standard language query and a link clause expression representing the set of linkage requirements and the primitive linkage specifications.

15. The method of claim 14, wherein the link clause expression is a Boolean combination of separate link clauses, and each separate link clause is a semantic Boolean condition of two columns of relational data included in the source data specifications.

16. The method of claim 15, wherein the base query template is a template associated with the standard language query and provides a skeleton for the translation.

18. A computer readable storage medium including computer executable instructions that, when executed on a computer processor, direct the computer processor to perform a method of semantic link discovery through translation of basic declarative language, the method comprising:

receiving a set of linkage specifications;

receiving a set of data sources related to the linkage specifications, the set of data sources and the set of linkage requirements forming a basic declarative language query, the basic declarative language query including specialized terms directed to linkage specifications;

translating the basic declarative language query into a standard language query;

executing the standard language query; and

returning results of the standard language query in response to the executing.

19. The computer readable storage medium of claim 18, wherein the set of linkage specifications includes a linkage method and a threshold.

20. The computer readable storage medium of claim 19, wherein the threshold is an upper limit of the number of returned results and wherein the linkage method is one of a native linkage method and a user-defined linkage method.