PUBLISHING RDF QUADS AS RELATIONAL VIEWS

• US 20140214857A1
• Filed: 01/29/2013
• Published: 07/31/2014
• Est. Priority Date: 01/29/2013
• Status: Active Grant

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: SRINIVASAN, Jagannathan, BANERJEE, Jayanta, NGUYEN, Vinh Thi Kim
• Granted Patent: US 9,710,568 B2
• Time in Patent Office: Days
• US Class Current: 707/748
• CPC Class Codes: G06F 16/80 of semi-structured data, e.g. markup language structured data such as SGML, XML or HTML content-based retrieval of web data G06F16/95
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques
• CPC Class Codes: G06F 16/9535 Search customisation based on user profiles and personalisation

Abstract

A method, system, and computer program product for transforming RDF quads to relational views. The method commences by receiving a named graph, the named graph comprising at least one RDF quad, and analyzing the named graph to produce analysis metadata. The method uses the analysis metadata to generate relational views. The method further comprises publishing a relational view in the form of a SPARQL query. The quality of the results can be quantitatively measured and reported by calculating a goodness score based at least in part on aspects of the relational view definitions. Several variants for transformation include generating relational view definitions formed using a named-graph strict variant, or a named-graph relaxed variant, or a named-graph agnostic variant. The transformations can form outputs responsive to characteristics or properties such as a number of classes, a number of single-valued properties, a number of nullability properties, or a number of type-uniformed ranges.

Claims

1. A computer implemented method for transforming RDF quads to relational views, the method comprising:

receiving, into a memory, a named graph, the named graph comprising at least one RDF quad;

analyzing, using a processor, the named graph using at least one SPARQL query to produce analysis metadata; and

using the analysis metadata to generate at least one relational view definition.

2. The method of claim 1, further comprising publishing the relational view definition in the form of a SPARQL query.

3. The method of claim 1, further comprising calculating a goodness score based at least in part on aspects of the relational view definition.

4. The method of claim 1, wherein the generated relational view definition is formed as at least one of, a named-graph strict variant, or a named-graph relaxed variant, or a named-graph agnostic variant.

5. The method of claim 1, further comprising identifying at least one of, a set of classes, a set of domains and ranges, a set of properties.

6. The method of claim 1, further comprising computing at least one of, a number of classes, a number of single-valued properties, a number of nullability properties, or a number of type-uniformed ranges.

7. The method of claim 1, wherein using the analysis metadata to generate at least one relational view definition comprises accessing user-defined rules.

8. A computer system for transforming RDF quads to relational views, comprising:

a computer processor to execute a set of program code instructions; and

a memory to hold the program code instructions, in which the program code instructions comprises program code to perform,

receiving a named graph, the named graph comprising at least one RDF quad;

analyzing the named graph using at least one SPARQL query to produce analysis metadata; and

using the analysis metadata to generate at least one relational view definition.

9. The computer system of claim 8, further comprising program code to perform publishing the relational view definition in the form of a SPARQL query.

10. The computer system of claim 8, further comprising program code to perform calculating a goodness score based at least in part on aspects of the relational view definition.

11. The computer system of claim 8, wherein the generated relational view definition is formed as at least one of, a named-graph strict variant, or a named-graph relaxed variant, or a named-graph agnostic variant.

12. The computer system of claim 8, further comprising program code to perform identifying at least one of, a set of classes, a set of domains and ranges, a set of properties.

13. The computer system of claim 8, further comprising program code to perform computing at least one of, a number of classes, a number of single-valued properties, a number of nullability properties, or a number of type-uniformed ranges.

14. The computer system of claim 8, wherein using the analysis metadata to generate at least one relational view definition comprises accessing user-defined rules.

15. A computer program product embodied in a non-transitory computer readable medium, the computer readable medium having stored thereon a sequence of instructions which, when executed by a processor causes the processor to execute a process to transform RDF quads to relational views, the process comprising:

receiving a named graph, the named graph comprising at least one RDF quad;

analyzing the named graph using at least one SPARQL query to produce analysis metadata; and

using the analysis metadata to generate at least one relational view definition.

16. The computer program product of claim 15, wherein the instructions further comprise publishing the relational view definition in the form of a SPARQL query.

17. The computer program product of claim 15, wherein the instructions further comprise calculating a goodness score based at least in part on aspects of the relational view definition.

18. The computer program product of claim 15, wherein the generated relational view definition is formed as at least one of, a named-graph strict variant, or a named-graph relaxed variant, or a named-graph agnostic variant.

19. The computer program product of claim 15, wherein the instructions further comprise identifying at least one of, a set of classes, a set of domains and ranges, a set of properties.

20. The computer program product of claim 15, wherein the instructions further comprise computing at least one of, a number of classes, a number of single-valued properties, a number of nullability properties, or a number of type-uniformed ranges.