Generating a synonym dictionary representing a mapping of elements in different data models

• US 7,600,186 B2
• Filed: 11/21/2005
• Issued: 10/06/2009
• Est. Priority Date: 10/07/2005
• Status: Active Grant

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Saha, Rakesh, Gupta, Manoj, Sengupta, Aninda
• Primary Examiner(s): Hong; Stephen S
• Assistant Examiner(s): Vaughn; Gregory J
• Application Number:
  US11/164,362
• Publication Number:
  US 20070083503A1
• Time in Patent Office: 1,415 Days
• Field of Search: 715/200, 715/229, 715/259, 715/260
• US Class Current: 715/260
• CPC Class Codes: G06F 16/258 Data format conversion from or to a database
• CPC Class Codes: G06F 16/374 Thesaurus
• CPC Class Codes: G06F 16/84 Mapping; Conversion
• CPC Class Codes: G06F 16/86 Mapping to a database

Abstract

Additional synonym pairs are inferred from a pair of schema elements (of different schemas) mapped by a user, and the inferred pairs are added to a dictionary. According to one aspect of the present invention, a mapped pair is inferred as a synonym pair if the elements of the mapped pair cannot be mapped according to a program logic otherwise. According to one more aspect of the present invention, the parents of the mapped elements are also inferred as synonym pairs if sufficient peer (to the mapped elements) elements are already mapped or considered synonyms.

Claims

1. A method of updating a synonym dictionary containing a set of synonym pairs, each of said synonym pairs containing a schema element of a first schema and another schema element of a second schema indicating a mapping between the two schema elements, said method comprising:

receiving data representing a first schema element in said first schema is mapped to a second schema element in said second schema;

checking whether a program logic would auto-map said first schema element to said second schema element;

adding said first schema element and said second schema element as an additional synonym pair to said synonym dictionary if said program logic would not auto-map said first schema element to said second schema element and not adding said additional synonym pair otherwise; and

using said synonym dictionary with said added additional pair to map elements of new schema pairs.

2. The method of claim 1, wherein a user maps said first schema element to said second schema element and said data is received after said user maps said first schema element to said second schema element.

3. The method of claim 2, wherein said program logic receives as inputs whether said first schema element needs to be identical to said second schema element to auto-map or similarity is sufficient to auto-map,

wherein said program logic determines that said first schema element would be auto-mapped to said second schema element only if said first schema element is identical to said second schema element if said inputs indicate that said first schema element needs to be identical to said second schema element,

otherwise said program logic determines that said first schema element would be auto-mapped to said second schema element if said first schema element is similar to said second schema element if said inputs indicate that said first schema element needs to be only similar to said second schema element.

4. The method of claim 3, wherein said similarity comprises one or more of ignoring case and having a common sub-string.

5. The method of claim 3, wherein said inputs further indicates whether ancestors are to be considered for addition to said synonym dictionary, said method further comprising:

determining whether a third schema element in said first schema and a fourth schema element in said second schema have at least half their children mapped,

wherein said third schema element and said fourth schema element are respective parents of said first schema element and said second schema element,

wherein said adding adds said third schema element and said fourth schema element as another additional synonym pair to said synonym dictionary if at least half their children are determined to have been mapped.

6. A computer readable medium storing one or more sequences of instructions causing a server to update a synonym dictionary containing a set of synonym pairs, each of said synonym pairs containing a schema element of a first schema and another schema element of a second schema indicating a mapping between the two schema elements, wherein execution of said one or more sequences of instructions by one or more processors contained in said server causes said server to perform the actions of:

receiving data representing a first schema element in said first schema is mapped to a second schema element in said second schema;

checking whether a program logic would auto-map said first schema element to said second schema element;

adding said first schema element and said second schema element as an additional synonym pair to said synonym dictionary if said program logic would not auto-map said first schema element to said second schema element and not adding said additional synonym pair otherwise; and

using said synonym dictionary with said added additional pair to map elements of new schema pairs.

7. The computer readable medium of claim 6, wherein a user maps said first schema element to said second schema element and said data is received after said user maps said first schema element to said second schema element.

8. The computer readable medium of claim 6, wherein said program logic receives as inputs whether said first schema element needs to be identical to said second schema element to auto-map or similarity is sufficient to auto-map,

wherein said program logic determines that said first schema element would be auto-mapped to said second schema element only if said first schema element is identical to said second schema element if said inputs indicate that said first schema element needs to be identical to said second schema element,

otherwise said program logic determines that said first schema element would be auto-mapped to said second schema element if said first schema element is similar to said second schema element if said inputs indicate that said first schema element needs to be only similar to said second schema element.

9. The computer readable medium of claim 8, wherein said similarity comprises one or more of ignoring case and having a common sub-string.

10. The method of claim 8, wherein said inputs further indicates whether ancestors are to be considered for addition to said synonym dictionary, said method further comprising:

determining whether a third schema element in said first schema and a fourth schema element in said second schema have at least half their children mapped,

wherein said third schema element and said fourth schema element are respective parents of said first schema element and said second schema element,

wherein said adding adds said third schema element and said fourth schema element as another additional synonym pair to said synonym dictionary if at least half their children are determined to have been mapped.

11. A computer system updating a synonym dictionary containing a set of synonym pairs, each of said synonym pairs containing a one schema element of a first schema and another schema element of a second schema indicating a mapping between the two schema elements, said computer system comprising:

means for receiving data representing a first schema element in said first schema is mapped to a second schema element in said second schema;

means for checking whether a program logic would auto-map said first schema element to said second schema element;

means for adding said first schema element and said second schema element as an additional synonym pair to said synonym dictionary if said program logic would not auto-map said first schema element to said second schema element and not adding said additional synonym pair otherwise; and

means for using said synonym dictionary with said added additional pair to map elements of new schema pairs.

12. The computer system of claim 11, wherein a user maps said first schema element to said second schema element and said data is received after said user maps said first schema element to said second schema element.

13. The computer system of claim 12, wherein said program logic receives as inputs whether said first schema element needs to be identical to said second schema element to auto-map or similarity is sufficient to auto-map,

wherein said program logic determines that said first schema element would be auto-mapped to said second schema element only if said first schema element is identical to said second schema element if said inputs indicate that said first schema element needs to be identical to said second schema element,

otherwise said program logic determines that said first schema element would be auto-mapped to said second schema element if said first schema element is similar to said second schema element if said inputs indicate that said first schema element needs to be only similar to said second schema element.

14. The computer system of claim 13, wherein said inputs further indicates whether ancestors are to be considered for addition to said synonym dictionary, said computer system further comprising:

means for determining whether a third schema element in said first schema and a fourth schema element in said second schema have at least half their children mapped,

wherein said third schema element and said fourth schema element are respective parents of said first schema element and said second schema element,

wherein said adding adds said third schema element and said fourth schema element as another additional synonym pair to said synonym dictionary if at least half their children are determined to have been mapped.