Expanding database column names
A method, a structure, and a computer system for expanding database column names. Exemplary embodiments may include identifying glossary terms that sufficiently syntactically match a column name, extracting partial expansions from the glossary terms, selectively combining a set of the partial expansions, and storing the combined set of partial expansions in association with the column name.
1. A computer-implemented method for expanding database column names, the method comprising:
identifying glossary terms that sufficiently syntactically match a column name based on dividing a number of matching tokens between at least one glossary term of the glossary terms and the column name by a number of tokens within the column name;
extracting partial expansions from the at least one glossary term;
selectively combining one or more of the partial expansions into a set of the partial expansions; and
storing the combined set of partial expansions in association with the column name.
2. The computer-implemented method of claim 1 , wherein the selectively combining the set of partial expansions further comprises:
scoring candidate combined sets of the partial expansions based on a matching score, a fragmentation score, and a conflict score; and
selectively combining at least one of the candidate combined sets of partial expansions having a best scoring.
3. The computer-implemented method of claim 2 , wherein the matching score is based on an approximate string match between the column name and the candidate combined sets of the partial expansions.
4. The computer-implemented method of claim 2 , wherein the fragmentation score is a count of the partial expansions used to create each set of the candidate combined sets of the partial expansions.
5. The computer-implemented method of claim 2 , wherein the conflict score is a measure of conflicting expansions within each of the candidate combined sets of the partial expansions.
6. The computer-implemented method of claim 2 , wherein the scoring the candidate combined sets of the partial expansions is further based on at least one of:
the candidate combined sets of the partial expansions sufficiently matching at least one of a name of a corresponding table and another column name within the table; and
the candidate combined sets of the partial expansions having a maximum diversity.
7. The computer-implemented method of claim 1 , wherein the identifying the glossary terms that sufficiently syntactically match the column name is based on an input relation score.
8. A computer program product for expanding database column names, the computer program product comprising:
one or more non-transitory computer-readable storage media and program instructions stored on the one or more non-transitory computer-readable storage media capable of performing a method, the method comprising:
identifying glossary terms that sufficiently syntactically match a column name based on dividing a number of matching tokens between at least one glossary term of the glossary terms and the column name by a number of tokens within the column name;
extracting partial expansions from the at least one glossary term;
selectively combining one or more of the partial expansions into a set of the partial expansions; and
storing the combined set of partial expansions in association with the column name.
9. The computer program product of claim 8 , wherein the selectively combining the set of partial expansions further comprises:
scoring candidate combined sets of the partial expansions based on a matching score, a fragmentation score, and a conflict score; and
selectively combining at least one of the candidate combined sets of partial expansions having a best scoring.
10. The computer program product of claim 9 , wherein the matching score is based on an approximate string match between the column name and the candidate combined sets of the partial expansions.
11. The computer program product of claim 9 , wherein the fragmentation score is a count of the partial expansions used to create each set of the candidate combined sets of the partial expansions.
12. The computer program product of claim 9 , wherein the conflict score is a measure of conflicting expansions within each of the candidate combined sets of the partial expansions.
13. The computer program product of claim 9 , wherein the scoring the candidate combined sets of the partial expansions is further based on at least one of:
the candidate combined sets of the partial expansions sufficiently matching at least one of a name of a corresponding table and another column name within the table; and
the candidate combined sets of the partial expansions having a maximum diversity.
14. The computer program product of claim 8 , wherein the identifying the glossary terms that sufficiently syntactically match the column name is based on an input relation score.
15. A computer system for expanding database column names, the system comprising:
one or more computer processors, one or more computer-readable storage media, and program instructions stored on the one or more of the computer-readable storage media for execution by at least one of the one or more processors capable of performing a method, the method comprising:
identifying glossary terms that sufficiently syntactically match a column name based on dividing a number of matching tokens between at least one glossary term of the glossary terms and the column name by a number of tokens within the column name;
extracting partial expansions from the at least one glossary term;
selectively combining one or more of the partial expansions into a set of the partial expansions; and
storing the combined set of partial expansions in association with the column name.
16. The computer system of claim 15 , wherein the selectively combining the set of partial expansions further comprises:
scoring candidate combined sets of the partial expansions based on a matching score, a fragmentation score, and a conflict score; and
selectively combining at least one of the candidate combined sets of partial expansions having a best scoring.
17. The computer system of claim 16 , wherein the matching score is based on an approximate string match between the column name and the candidate combined sets of the partial expansions.
18. The computer system of claim 16 , wherein the fragmentation score is a count of the partial expansions used to create each set of the candidate combined sets of the partial expansions.
19. The computer system of claim 16 , wherein the conflict score is a measure of conflicting expansions within each of the candidate combined sets of the partial expansions.
20. The computer system of claim 16 , wherein the scoring the candidate combined sets of the partial expansions is further based on at least one of:
the candidate combined sets of the partial expansions sufficiently matching at least one of a name of a corresponding table and another column name within the table; and
the candidate combined sets of the partial expansions having a maximum diversity.