Method and apparatus for functional integration of metadata

• US 8,972,463 B2
• Filed: 09/29/2010
• Issued: 03/03/2015
• Est. Priority Date: 07/25/2008
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Mohan, Mukund
• Primary Examiner(s): Perveen, Rehana
• Assistant Examiner(s): Hershley, Mark E
• Application Number:
  US12/894,136
• Publication Number:
  US 20110022627A1
• Time in Patent Office: 1,616 Days
• Field of Search: 707/769, 707/822
• US Class Current: 707/822
• CPC Class Codes: G06F 16/288 Entity relationship models

Abstract

A computer implemented method for functional integration of metadata for a plurality of databases, includes: creating a single set of classes and instances for the classes for metadata of at least one relational data schema and at least one non-relational data schema for the plurality of databases; defining semantic relationships between the instances based on the structural information in the relational data schema and the non-relational data schema for the plurality of databases; associating the semantic relationships with a property class; creating a single set of triples for the semantic relationships between the instances; storing the single set of triples in a file; and using the set of triples stored in the file to navigate between the plurality of databases to formulate a response to a query.

Claims

1. A computer implemented method for functional integration of metadata for a plurality of databases, comprising:

creating a single set of classes and instances for the classes for metadata of at least one relational data schema and at least one non-relational data schema for the plurality of databases, wherein the single set of classes comprises first classes for the metadata and second classes for the instances of the first classes;

creating a single set of semantic relationships between the instances of the first classes and the second classes based on structural information in the relational data schema and the non-relational data schema;

creating a single set of triples for the semantic relationships between the instances of the first classes and the second classes; and

storing the single set of triples in a single file;

wherein the creating the single set of the semantic relationships between the instances of the first classes and the second classes based on the structural information in the relational data schema and the non-relational data schema comprises;

defining the semantic relationships between the instances of the first classes and the second classes based on the structural information in the relational data schema and the non-relational data schema for the plurality of databases;

creating a first set of triples for the semantic relationships for the at least one relational data schema, wherein a range of one of the first set of triples links to a domain of another of the first set of triples forming a first chain of triples;

creating a second set triples for the semantic relationships for the non-relational data schema, wherein a range of one of the second set of triples links to a domain of another of the second set of triples forming a second chain of triples; and

wherein the first chain and the second chain comprise matching attribute values.

2. The method of claim 1, wherein the creating the single set of classes and instances for the classes for the metadata of the relational data schema and the non-relational data schema for the plurality of databases comprises:

creating the single set of classes for the metadata of the relational data schema and the non-relational data schema for the plurality of databases, wherein the single set of classes comprises the first classes for the metadata and the second classes for the instances of the first classes;

creating the single set of the instances for the classes, wherein the single set of the instances comprises first instances for the first classes and second instances for the second classes;

associating the first instances with the first classes; and

associating the second instances with the second classes.

3. The method of claim 1, wherein each of the triples comprise a pair of instances of the set of instances and a property stating a relationship between the pair of instances.

4. The method of claim 1, further comprising:

storing the first chain and the second chain in the single file; and

using the matching attribute values of the first chain and the second chain to navigate between the plurality of databases to formulate a response to a query.

5. The method of claim 1, wherein the at least one non-relational data schema comprises a data schema for data derived from a relational database.

6. A computer program product for functional integration of metadata for a plurality of databases, the computer program product comprising:

a computer readable memory having computer readable program code embodied therewith, the computer readable program code configured to;

create a single set of classes and instances for the classes for metadata of at least one relational data schema and at least one non-relational data schema for the plurality of databases, wherein the single set of classes comprises first classes for the metadata and second classes for the instances of the first classes;

create a single set of semantic relationships between the instances of the first classes and the second classes based on structural information in the relational data schema and the non-relational data schema;

create a single set of triples for the semantic relationships between the instances of the first classes and the second classes; and

store the single set of triples in a single file;

wherein the computer readable program code configured to create the single set of the semantic relationships between the instances of the first classes and the second classes based on the structural information in the relational data schema and the non-relational data schema is further configured to;

define the semantic relationships between the instances of the first classes and the second classes based on the structural information in the relational data schema and the non-relational data schema for the plurality of databases;

create a first set of triples for the semantic relationships for the at least one relational data schema, wherein a range of one of the first set of triples links to a domain of another of the first set of triples forming a first chain of triples;

create a second set triples for the semantic relationships for the non-relational data schema, wherein a range of one of the second set of triples links to a domain of another of the second set of triples forming a second chain of triples; and

wherein the first chain and the second chain comprise matching attribute values.

7. The computer program product of claim 6, wherein the computer readable program code configured to create the single set of classes and instances for the classes for the metadata of the relational data schema and the non-relational data schema for the plurality of databases is further configured to:

create the single set of classes for the metadata of the relational data schema and the non-relational data schema for the plurality of databases, wherein the single set of classes comprises the first classes for the metadata and the second classes for the instances of the first classes;

create the single set of the instances for the classes, wherein the single set of the instances comprises first instances for the first classes and second instances for the second classes;

associate the first instances with the first classes; and

associate the second instances with the second classes.

8. The computer program product of claim 7, wherein the computer readable program code is further configured to:

storing the first chain and the second chain in the single file; and

use the matching attribute values of the first chain and the second chain to navigate between the plurality of databases to formulate a response to a query.

9. The computer program product of claim 6, wherein each of the triples comprise a pair of instances of the set of instances and a property stating a relationship between the pair of instances.

10. The computer program product of claim 6, wherein the at least one non-relational data schema comprises a data schema for data derived from a relational database.

11. A system, comprising:

a plurality of databases defined by at least one relational data schema and at least one non-relational data schema; and

a server comprising a processor and a computer readable storage medium having computer readable program code embodied therewith, wherein when the computer readable program code is executed by the processor, causes the server to;

create a single set of classes and instances for the classes for metadata of the relational data schema and the non-relational data schema for the plurality of databases, wherein the single set of classes comprises first classes for the metadata and second classes for the instances of the first classes;

create a single set of semantic relationships between the instances of the first classes and the second classes based on structural information in the relational data schema and the non-relational data schema;

create a single set of triples for the semantic relationships between the instances of the first classes and the second classes; and

store the single set of triples in a single file;

wherein when the computer readable program code configured to create the single set of the semantic relationships between the instances of the first classes and the second classes based on the structural information in the relational data schema and the non-relational data schema is executed by the processor, further causes the server to;

define the semantic relationships between the instances of the first classes and the second classes based on the structural information in the relational data schema and the non-relational data schema for the plurality of databases;

creating a first set of triples for the semantic relationships for the at least one relational data schema, wherein a range of one of the first set of triples links to a domain of another of the first set of triples forming a first chain of triples;

creating a second set triples for the semantic relationships for the non-relational data second set of triples forming a second chain of triples; and

wherein the first chain and the second chain comprise matching attribute values.

12. The system of claim 11, wherein when the computer readable program code configured to create the single set of classes and the instances for the classes for the metadata of the relational data schema and the non-relational data schema for the plurality of databases is executed by the processor, further causes the server to:

create the single set of classes for the metadata of the relational data schema and the non-relational data schema for the plurality of databases, wherein the single set of classes comprises the first classes for the metadata and the second classes for the instances of the first classes;

create the single set of the instances for the classes, wherein the single set of the instances comprises first instances for the first classes and second instances for the second classes;

associate the first instances with the first classes; and

associate the second instances with the second classes.

13. The system of claim 11, wherein each of the triples comprise a pair of instances of the set of instances and a property stating a relationship between the pair of instances.

14. The system of claim 11, wherein when the computer readable program code is executed by the processor, further causes the server to:

storing the first chain and the second chain in the single file; and

use the matching attribute values of the first chain and the second chain to navigate between the plurality of databases to formulate a response to a query.

15. The system of claim 11, wherein the at least one non-relational data schema comprises a data schema for data derived from a relational database.

16. A computer implemented method for functional integration of metadata for a plurality of databases, comprising:

creating a single set of classes and instances for the classes for metadata of at least one relational data schema and at least one non-relational data schema for the plurality of databases, wherein the single set of classes comprises first classes for the metadata and second classes for the instances of the first classes;

defining semantic relationships between the instances of the first classes and the second classes based on the structural information in the relational data schema and the non-relational data schema for the plurality of databases;

creating a first set of triples for the semantic relationships for the at least one relational data schema, wherein a range of one of the first set of triples links to a domain of another of the first set of triples forming a first chain of triples;

creating a second set triples for the semantic relationships or the non-relational data schema, wherein a range of one of the second set of triples links to a domain of another of the second set of triples forming a second chain of triples, wherein the first chain and the second chain comprise matching attribute values;

storing the first chain and the second chain in a single file; and

using the matching attribute values of the first chain and the second chain to navigate between the plurality of databases to formulate a response to a query.

17. The method of claim 16, wherein the at least one non-relational data schema comprises a data schema for data derived from a relational database.

18. A computer program product for functional integration of metadata for a plurality of databases, comprising:

a computer readable memory having computer readable program code embodied therewith, the computer readable program code configured to;

create a single set of classes and instances for the classes for metadata of at least one relational data schema and at least one non-relational data schema for the plurality of databases, wherein the single set of classes comprises first classes for the metadata and second classes for the instances of the first classes;

define semantic relationships between the instances of the first classes and the second classes based on the structural information in the relational data schema and the non-relational data schema for the plurality of databases;

create a first set of triples for the semantic relationships for the at least one relational data schema, wherein a range of one of the first set of triples links to a domain of another of the first set of triples forming a first chain of triples;

create a second set triples for the semantic relationships for the non-relational data schema, wherein a range of one of the second set of triples links to a domain of another of the second set of triples forming a second chain of triples, wherein the first chain and the second chain comprise matching attribute values;

store the first chain and the second chain in a single file; and

use the matching attribute values of the first chain and the second chain to navigate between the plurality of databases to formulate a response to a query.

19. The method of claim 18, wherein the at least one non-relational data schema comprises a data schema for data derived from a relational database.