Testing quality of relationship discovery

• US 20070174337A1
• Filed: 01/24/2006
• Published: 07/26/2007
• Est. Priority Date: 01/24/2006
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Yan, Lingling, LaVergne, Debra Brouse
• Application Number:
  US11/339,128
• Publication Number:
  US 20070174337A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06Q 10/10 Office automation; Time management

Abstract

Provided are techniques for testing quality of relationship discovery. Reference mappings and test mappings are received, wherein each of the reference mappings and test mappings includes one or more mappings, and wherein each of the mappings includes a mapping input and a mapping output, Each of the reference mappings and test mappings is parsed to generate a reference structure and a test structure, wherein the reference structure and test structure each contains entries with mapping outputs as keys matched with mapping inputs as values. The reference structure and the test structure are compared to determine the quality of relationships discovered in the test mappings.

Claims

1. A computer-implemented method for testing quality of relationship discovery, comprising:

receiving reference mappings and test mappings, wherein each of the reference mappings and test mappings includes one or more mappings, and wherein each of the mappings includes a mapping input and a mapping output;

parsing each of the reference mappings and test mappings to generate a reference structure and a test structure, wherein the reference structure and test structure each contains entries with mapping outputs as keys matched with mapping inputs as values; and

comparing the reference structure and the test structure to determine the quality of relationships discovered in the test mappings.

2. The method of claim 1, further comprising:

selecting a reference entry in the reference structure having a reference key; and

searching for a test entry in the test structure having a test key that matches the reference key.

3. The method of claim 2, further comprising:

in response to locating the test entry with the test key that matches the reference key, comparing a test value in the test entry with a reference value in the reference entry; and

in response to determining that the test value and reference value match, incrementing a success counter.

4. The method of claim 3, further comprising:

in response to determining that the test value and reference value do not match, incrementing a total counter, wherein the total counter is initialized to a number of reference entries in the reference structure.

5. The method of claim 4, further comprising:

marking a test that generated the test mappings with success or failure based on a ratio of the success counter to the total counter.

6. The method of claim 1, further comprising:

generating a report showing a list of mappings, wherein each of the mappings is labeled as existing or not existing in the reference mappings and test mappings.

7. The method of claim 1, further comprising:

mangling a schema to create a mangled schema.

8. A computer program product for testing quality of relationship discovery comprising a computer useable medium including a computer readable program, wherein the computer readable program when executed on a computer causes the computer to:

receive reference mappings and test mappings, wherein each of the reference mappings and test mappings includes one or more mappings, and wherein each of the mappings includes a mapping input and a mapping output;

parse each of the reference mappings and test mappings to generate a reference structure and a test structure, wherein the reference structure and test structure each contains entries with mapping outputs as keys matched with mapping inputs as values; and

compare the reference structure and the test structure to determine the quality of relationships discovered in the test mappings.

9. The computer program product of claim 8, wherein the computer readable program when executed on a computer causes the computer to:

select a reference entry in the reference structure having a reference key; and

search for a test entry in the test structure having a test key that matches the reference key.

10. The computer program product of claim 9, wherein the computer readable program when executed on a computer causes the computer to:

in response to locating the test entry with the test key that matches the reference key, compare a test value in the test entry with a reference value in the reference entry; and

in response to determining that the test value and reference value match, increment a success counter.

11. The computer program product of claim 10, wherein the computer readable program when executed on a computer causes the computer to:

in response to determining that the test value and reference value do not match, increment a total counter, wherein the total counter is initialized to a number of reference entries in the reference structure.

12. The computer program product of claim 11, wherein the computer readable program when executed on a computer causes the computer to:

mark a test that generated the test mappings with success or failure based on a ratio of the success counter to the total counter.

13. The computer program product of claim. 8, wherein the computer readable program when executed on a computer causes the computer to:

generate a report showing a list of mappings, wherein each of the mappings is labeled as existing or not existing in the reference mappings and test mappings.

14. The computer program product of claim 8, wherein the computer readable program when executed on a computer causes the computer to:

mangle a schema to create a mangled schema.

15. A system for testing quality of relationship discovery, comprising:

logic capable of performing operations, the operations comprising;

receiving reference mappings and test mappings, wherein each of the reference mappings and test mappings includes one or more mappings, and wherein each of the mappings includes a mapping input and a mapping output;

parsing each of the reference mappings and test mappings to generate a reference structure and a test structure, wherein the reference structure and test structure each contains entries with mapping outputs as keys matched with mapping inputs as values; and

comparing the reference structure and the test structure to determine the quality of relationships discovered in the test mappings.

16. The system of claim 15, wherein the operations further comprise:

selecting a reference entry in the reference structure having a reference key; and

searching for a test entry in the test structure having a test key that matches the reference key.

17. The system of claim 16, wherein the operations further comprise:

in response to locating the test entry with the test key that matches the reference key, comparing a test value in the test entry with a reference value in the reference entry; and

in response to determining that the test value and reference value match, incrementing a success counter.

18. The system of claim 17, wherein the operations further comprise:

in response to determining that the test value and reference value do not match, incrementing a total counter, wherein the total counter is initialized to a number of reference entries in the reference structure.

19. The system of claim 18, wherein the operations further comprise:

marking a test that generated the test mappings with success or failure based on a ratio of the success counter to the total counter.

20. The system of claim 15, wherein the operations further comprise:

generating a report showing a list of mappings, wherein each of the mappings is labeled as existing or not existing in the reference mappings and test mappings.

21. The system of claim 15, wherein the operations further comprise:

mangling a schema to create a mangled schema.