Method and system for mapping multi-dimensional model to data warehouse schema

• US 8,099,382 B2
• Filed: 04/10/2008
• Issued: 01/17/2012
• Est. Priority Date: 04/13/2007
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Liu, Sheng Ping, Qiu, Zhao Ming, Xie, Guo Tong, Yang, Yang
• Primary Examiner(s): Breene, John E
• Assistant Examiner(s): Kerzhner, Aleksandr
• Application Number:
  US12/100,749
• Publication Number:
  US 20080256121A1
• Time in Patent Office: 1,377 Days
• Field of Search: 707/601, 707/999.102
• US Class Current: 707/601
• CPC Class Codes: G06F 16/283 Multi-dimensional databases or data warehouses, e.g. MOLAP or ROLAP

Abstract

A system maps a multidimensional model to data warehouse schema. The system includes a multidimensional model editor for defining a multidimensional model based on a conceptual model; a mapping reasoner for generating more simple mappings from basic mappings by reasoning on the conceptual model so as to provide mappings for concerning elements in an ontology path in the multidimensional model; a data warehouse schema analyzer for generating a data structure capable of indicating information of the data warehouse schema by making an analysis on the information of the data warehouse schema; and a mapping composition engine for generating result mappings according to mappings for the concerning elements of the ontology path in the multidimensional model and by searching in the data structure paths corresponding to the concerning elements of the ontology path in the multidimensional model. A method and computer program product are also disclosed.

Claims

1. An information processing system for mapping a multidimensional model to a data warehouse schema, comprising:

a memory;

a processor communicatively coupled to the memory; and

a system for a mapping multidimensional model to a data warehouse schema, the system being communicatively coupled to the memory and the processor, and wherein the system is configured to perform a method comprising;

defining a multidimensional model based on a conceptual model represented by an ontology;

receiving, from a user, a selection of an ontology path expression from the multidimensional model, wherein the ontology path expression comprises one or more basic ontology expressions and one or more composite ontology expressions;

generating one or more simple mappings from one or more basic mappings by reasoning on the conceptual model so as to provide one or more mappings for concerning elements in an ontology path in the multidimensional model;

generating a data structure capable of indicating information of the data warehouse schema by performing an analysis on the information of the data warehouse schema; and

generating one or more result mappings according to the one or more mappings for the concerning elements of the ontology path in the multidimensional model and by searching in one or more data structure paths corresponding to the concerning elements of the ontology path in the multidimensional model, wherein generating the one or more result mappings comprises;

obtaining one or more start nodes of the ontology path from the data structure;

obtaining one or more end nodes corresponding to the one or more start nodes from the data structure;

adjusting a weight of each edge of the data structure;

identifying, in response to the adjusting, a maximally returned number of shortest paths in the data structure based on the one or more start nodes and one or more end nodes; and

translating the maximally returned number of shortest paths into one or more mapping expressions.

2. The information processing system according to claim 1, wherein the system comprises:

a user interface for supporting selection of the result mappings.

3. The information processing system according to claim 1, wherein the one or more basic mappings comprise mappings from each element in the conceptual model to the data warehouse schema, and wherein the one or more basic mappings are built in advance.

4. The information processing system according to claim 1, wherein the one or more simple mappings are generated based at least on the following reasoning rules:

a class inherits all mappings of its subclasses; and

a property inherits all mappings of its sub-properties.

5. The information processing system according to claim 1, wherein the data structure is a functional dependency graph.

6. The information processing system according to claim 5, wherein the functional dependency graph is a weighted and directed graph, and weights of the respective edges in the directed graph are adjustable, and wherein the one or more result mappings are ranked according to current weights in the functional dependency graph so as to be selected by the user.

7. The information processing system according to claim 6, wherein one or more the result mappings are ranked according to the following expression:

Rank(p)=weight(p)+α

×

(1−

|S_m∩

S_p|/|S_m|), 0<

α

<

1

wherein p is the obtained shortest path, S_m is the set of nodes in the functional dependency graph corresponding to a class and properties other than a start class (C1) and end property, and S_p is a set of the nodes which a path p covers.

8. A method for mapping a multidimensional model to data warehouse schema, comprising:

defining a multidimensional model based on a conceptual model represented by an ontology;

receiving, from a user, a selection of an ontology path expression from the multidimensional model, wherein the ontology path expression comprises one or more basic ontology expressions and one or more composite ontology expressions;

generating one or more simple mappings from one or more basic mappings by reasoning on the conceptual model so as to provide one or more mappings for concerning elements in an ontology path in the multidimensional model;

generating a data structure capable of indicating information of the data warehouse schema by performing an analysis on the information of the data warehouse schema; and

generating one or more result mappings according to the one or more mappings for the concerning elements of the ontology path in the multidimensional model and by searching in one or more data structure paths corresponding to the concerning elements of the ontology path in the multidimensional model, wherein generating the one or more result mappings comprises;

obtaining one or more start nodes of the ontology path from the data structure;

obtaining one or more end nodes corresponding to the one or more start nodes from the data structure;

adjusting a weight of each edge of the data structure;

identifying, in response to the adjusting, a maximally returned number of shortest paths in the data structure based on the one or more start nodes and one or more end nodes; and

translating the maximally returned number of shortest paths into one or more mapping expressions.

9. The method according to claim 8, further comprising:

selecting the result mappings.

10. The method according to claim 8, wherein the one or more basic mappings comprise mappings from each element in the conceptual model to the data warehouse schema, and wherein the one or more basic mappings are built in advance.

11. The method according to claim 8, wherein reasoning rules employed in the step of generating more simple mappings from the basic mapping comprise:

a class inherits all mappings of its subclasses; and

a property inherits all mappings of its sub-properties.

12. The method according to claim 8, wherein the data structure is a functional dependency graph.

13. The method according to claim 12, wherein the functional dependency graph is a weighted and directed graph, and weights of the respective edges in the directed graph are adjustable, and wherein the method further comprises:

ranking the one or more result mappings according to current weights in the functional dependency graph so as to be selected by the user.

14. The method according to claim 13, wherein the one or more result mappings are ranked according to the following expression:

Rank(p)=weight(p)+α

×

(1−

|S_m∩

S_p|/|S_m|), 0<

α

<

1

wherein p is the obtained shortest path, S_m is the set of nodes in the functional dependency graph corresponding to a class and properties other than a start class (C1) and end property, and S_p is a set of the nodes which a path p covers.