# US 2021/0240677 A1 · Data quality evaluation

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2021/0240677 A1
- Document ID: US20210240677A1
- Status: Published application
- Kind: A1
- Application number: 16/777,245
- Filed: 2020-01-30
- Published: 2021-08-05
- Earliest claimed: 2020-01-30
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Kunjavihari Madhav Kashalikar; Yannick Saillet; Ketki Ramesh Purandare
- Web page: https://patentgrep.com/patent/US20210240677A1

## CPC

- G06F 16/215: Improving data quality; Data cleansing, e.g. de-duplication, removing invalid entries or correcting typographical errors
- G06F 16/221: {Column-oriented storage; Management thereof}
- G06F 16/2456: {Join operations}
- G06N 5/025: Extracting rules from data
- G06N 5/046: Forward inferencing; Production systems
- G06N 20/00: Machine learning
- G06Q 10/10: Office automation; Time management
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

Methods and systems for data quality evaluation are disclosed. A method includes: receiving, by a computing device, at least one data set and a list of rule expressions to bind; building, by the computing device, candidate binding combinations between columns of the at least one data set and variables of each rule expression in the list of rule expressions; building, by the computing device, a new bound rule expression candidate based on the candidate binding combinations; generating, by the computing device, a new bound rule expression based on the new bound rule expression candidate and a data transformation applied to at least one of the columns of the at least one data set; and storing, by the computing device, the new bound rule expression.

## Claims

### Claim 1

A method comprising:
receiving, by a computing device, at least one data set and a list of rule expressions to bind;
building, by the computing device, candidate binding combinations between columns of the at least one data set and variables of each rule expression in the list of rule expressions;
building, by the computing device, a new bound rule expression candidate based on the candidate binding combinations;
generating, by the computing device, a new bound rule expression based on the new bound rule expression candidate and a data transformation applied to at least one of the columns of the at least one data set; and
storing, by the computing device, the new bound rule expression.

### Claim 2 (depends on 1)

The method according to claim 1, further comprising evaluating, by the computing device, the new bound rule expression against data stored in the at least one data set.

### Claim 3 (depends on 1)

The method according to claim 1, further comprising discovering, by the computing device, primary key to foreign key relationships in the at least one data set, and
wherein the building the new bound rule expression candidate comprises:
determining that one of the candidate binding combinations involves columns from different tables;
determining join criteria for joining the columns from the different tables together based on the discovered primary key to foreign key relationships; and
adding the join criteria to the new bound rule expression candidate.

### Claim 4 (depends on 1)

The method according to claim 1, wherein the building the candidate binding combinations between the columns of the at least one data set and the variables of each rule expression in the list of rule expressions comprises determining, by the computing device, similarities between names of the variables of each rule expression in the list of rule expressions and names of the columns of the at least one data set.

### Claim 5 (depends on 1)

The method according to claim 1, wherein the building the candidate binding combinations between the columns of the at least one data set and the variables of each rule expression in the list of rule expressions comprises determining, by the computing device, similarities between names of terms associated with the columns of the at least one data set and names of the variables of each rule expression in the list of rule expressions.

### Claim 6 (depends on 1)

The method according to claim 1, wherein the building the candidate binding combinations between the columns of the at least one data set and the variables of each rule expression in the list of rule expressions comprises determining, by the computing device, similarities between names of classes associated with the columns of the at least one data set and names of the variables of each rule expression in the list of rule expressions.

### Claim 7 (depends on 1)

The method according to claim 1, wherein the building the candidate binding combinations between the columns of the at least one data set and the variables of each rule expression in the list of rule expressions comprises determining, by the computing device, associations of the columns of the at least one data set with same terms as policies associated with rule expressions in the list of rule expressions.

### Claim 8 (depends on 1)

The method according to claim 1, wherein the building the candidate binding combinations between the columns of the at least one data set and the variables of each rule expression in the list of rule expressions comprises determining, by the computing device, an association of a first one of the columns of the at least one data set with a same term as a second one of the columns of the at least one data set that is already bound to a variable in a rule expression in the list of rule expressions.

### Claim 9 (depends on 1)

The method according to claim 1, wherein the building the candidate binding combinations between the columns of the at least one data set and the variables of each rule expression in the list of rule expressions comprises determining, by the computing device, similarities between a name of a first one of the columns of the at least one data set and a name of a second one of the columns of the at least one data set that is already bound to a variable in a rule expression in the list of rule expressions.

### Claim 10 (depends on 1)

The method according to claim 1, wherein the building the candidate binding combinations between the columns of the at least one data set and the variables of each rule expression in the list of rule expressions comprises determining, by the computing device, similarities between data of a first one of the columns of the at least one data set and data of a second one of the columns of the at least one data set that is already bound to a variable in a rule expression in the list of rule expressions.

### Claim 11

A computer program product comprising:
one or more computer readable storage media, and program instructions collectively stored on the one or more computer readable storage media, the program instructions comprising:
program instructions to receive at least one data set and a list of rule expressions to bind;
program instructions to build candidate binding combinations between columns of the at least one data set and variables of each rule expression in the list of rule expressions based on similarities between names of the variables of each rule expression in the list of rule expressions and names of the columns of the at least one data set;
program instructions to build a new bound rule expression candidate based on the candidate binding combinations;
program instructions to generate a new bound rule expression based on the new bound rule expression candidate and a data transformation applied to at least one of columns of the at least one data set; and
program instructions to evaluate the new bound rule expression against data stored in the at least one data set.

### Claim 12 (depends on 11)

The computer program product according to claim 11, further comprising program instructions to discover primary key to foreign key relationships in the at least one data set,
wherein the building the new bound rule expression candidate comprises:
determining that one of the candidate binding combinations involves columns from different tables;
determining that the different tables are unable to be joined based on the discovered primary key to foreign key relationships; and
dropping the new bound rule expression candidate.

### Claim 13 (depends on 11)

The computer program product according to claim 11, wherein the building the candidate binding combinations between the columns of the at least one data set and the variables of each rule expression in the list of rule expressions is further based on similarities between names of terms associated with the columns of the at least one data set and names of the variables of each rule expression in the list of rule expressions.

### Claim 14 (depends on 11)

The computer program product according to claim 11, wherein the building the candidate binding combinations between the columns of the at least one data set and the variables of each rule expression in the list of rule expressions is further based on similarities between names of classes associated with the columns of the at least one data set and names of the variables of each rule expression in the list of rule expressions.

### Claim 15 (depends on 11)

The computer program product according to claim 11, wherein the building the candidate binding combinations between the columns of the at least one data set and the variables of each rule expression in the list of rule expressions is further based on associations of the columns of the at least one data set with same terms as policies associated with rule expressions in the list of rule expressions.

### Claim 16 (depends on 11)

The computer program product according to claim 11, wherein the building the candidate binding combinations between the columns of the at least one data set and the variables of each rule expression in the list of rule expressions is further based on an association of a first one of the columns of the at least one data set with a same term as a second one of the columns of the at least one data set that is already bound to a variable in a rule expression in the list of rule expressions.

### Claim 17 (depends on 11)

The computer program product according to claim 11, wherein the building the candidate binding combinations between the columns of the at least one data set and the variables of each rule expression in the list of rule expressions is further based on similarities between a name of a first one of the columns of the at least one data set and a name of a second one of the columns of the at least one data set that is already bound to a variable in a rule expression in the list of rule expressions.

### Claim 18 (depends on 11)

The computer program product according to claim 11, wherein the building the candidate binding combinations between the columns of the at least one data set and the variables of each rule expression in the list of rule expressions is further based on similarities between data of a first one of the columns of the at least one data set and data of a second one of the columns of the at least one data set that is already bound to a variable in a rule expression in the list of rule expressions.

### Claim 19

A system comprising:
a processor, a computer readable memory, one or more computer readable storage media, and program instructions collectively stored on the one or more computer readable storage media, the program instructions executable to:
receive at least one data set and a list of rule expressions to bind;
build candidate binding combinations between columns of the at least one data set and variables of each rule expression in the list of rule expressions;
build a new bound rule expression candidate based on the candidate binding combinations;
generate a new bound rule expression based on the new bound rule expression candidate and a suggested data transformation to apply to at least one of the columns of the at least one data set that is determined based on a past binding of a same variable in the new bound rule expression to the at least one of the columns of the at least one data set; and
store the new bound rule expression.

### Claim 20 (depends on 19)

The system according to claim 19, wherein the suggested data transformation is determined using a fingerprint of at least one of the columns of the at least one data set and a fingerprint of a previously bound column.
