DETERMINING DATA ELEMENTS IN HETEROGENEOUS SCHEMA DEFINITIONS FOR POSSIBLE MAPPING

• US 20070239742A1
• Filed: 05/25/2006
• Published: 10/11/2007
• Est. Priority Date: 04/06/2006
• Status: Abandoned Application

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: SENGUPTA, Aninda, SAHA, Rakesh
• Application Number:
  US11/308,911
• Publication Number:
  US 20070239742A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/36 Creation of semantic tools, e.g. ontology or thesauri
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence

Abstract

Determining data elements for possible mapping in heterogeneous schema definitions. According to one aspect of the present invention, a user indicates whether two non-leaf elements (in respective schemas) are structurally similar, and the probability of possible match of a first element (in a first schema) and a second element (in a second schema) as a synonym pair is computed to be more if the two elements are below the respective ones of the structurally similar nodes, compared to in a situation in which the elements are not present in such hierarchies.

Claims

1. A method of generating a plurality of synonym pairs from a first schema and a second schema, said first schema including a first plurality of elements according to a first hierarchy and said second schema including a second plurality of elements according to a second hierarchy, wherein each synonym pair contains a leaf element from each of said first schema and said second schema and wherein the two leaf elements correspond to each other, said method comprising:

receiving a first data indicating that a pair of non-leaf elements are structurally similar, said pair of non-leaf elements containing a first non-leaf element and a second non-leaf element respectively contained in said first schema and said second schema; and

computing a probability of possible match between a first leaf element and a second leaf element respectively contained in said first schema and said second schema,

wherein said probability of possible match as a synonym pair is greater if said first leaf element is in a branch from said first non-leaf element in said first hierarchy and said second leaf element is in another branch from said second non-leaf element in said second hierarchy, than otherwise.

2. The method of claim 1, wherein said computing comprises:

receiving a second data indicating a plurality of similarity conditions of said first leaf element and said second leaf element to consider for performing said computing;

determining a corresponding one of a plurality of indicative values representing a level of match between said first leaf element and said second leaf element only based on respective one of said plurality of similarity conditions; and

calculating said probability of possible match using said plurality of indicative values.

3. The method of claim 2, wherein said probability of match is computed according to a weighted average of said plurality of indicative values.

4. The method of claim 3, wherein said plurality of similarity conditions comprise a structural similarity representing whether said leaf element is in said branch from a corresponding hierarchy and a linguistic similarity between said first leaf element and said second leaf element.

5. A computer readable medium carrying one or more sequences of instructions causing a system to generate a plurality of synonym pairs from a first schema and a second schema, said first schema including a first plurality of elements according to a first hierarchy and said second schema including a second plurality of elements according to a second hierarchy, wherein each synonym pair contains a leaf element from each of said first schema and said second schema and wherein the two leaf elements correspond to each other, and execution of said one or more sequences of instructions by one or more processors contained in said server causes said one or more processors to perform the actions of:

receiving a first data indicating that a pair of non-leaf elements are structurally similar, said pair of non-leaf elements containing a first non-leaf element and a second non-leaf element respectively contained in said first schema and said second schema; and

computing a probability of possible match between a first leaf element and a second leaf element respectively contained in said first schema and said second schema,

wherein said probability of possible match as a synonym pair is greater if said first leaf element is in a branch from said first non-leaf element in said first hierarchy and said second leaf element is in another branch from said second non-leaf element in said second hierarchy, than otherwise.

6. The computer readable medium of claim 5, wherein said computing comprises:

receiving a second data indicating a plurality of similarity conditions of said first leaf element and said second leaf element to consider for performing said computing;

determining a corresponding one of a plurality of indicative values representing a level of match between said first leaf element and said second leaf element only based on respective one of said plurality of similarity conditions; and

calculating said probability of possible match using said plurality of indicative values.

7. The computer readable medium of claim 6, wherein said probability of match is computed according to a weighted average of said plurality of indicative values.

8. The computer readable medium of claim 7, wherein said plurality of similarity conditions comprise a structural similarity representing whether said leaf element is in said branch from a corresponding hierarchy and a linguistic similarity between said first leaf element and said second leaf element.