Distributed match and association of entity key-value attribute pairs

Patent metadata

Field	Value
Publication number	US-2019179951-A1
Application number	US-201715835680-A
Country	US
Kind code	A1
Filing date	Dec 8, 2017
Priority date	Dec 8, 2017
Publication date	Jun 13, 2019
Grant date	—

Abstract

Systems, methods, and computer-readable media are disclosed for associating and reconciling disparate key-value pairs corresponding to a target entity across multiple organizational entities using a distributed match. A shared output mapping may be generated that associates and reconciles common and/or conceptually aligned key-value pairs across the multiple organizational entities. The shared output mapping allows any given organizational entity to leverage information known to other organizational entities about a target entity. In this manner, the organizational entities participate in an information sharing ecosystem that enables each organizational entity to provide a user with a more optimally customized user experience based on the greater breadth of information available through the shared output mapping.

First claim

What is claimed is:

1 . A computer-implemented method for distributed matching and association of key-value attribute pairs, the method comprising:
receiving, from a requestor, a query for attributes associated with a target entity; accessing aggregate key-value attribute pairs associated with a plurality of entities; identifying a subset of the aggregate key-value attribute pairs that correspond to the target entity, the subset of the aggregate key-value attribute pairs comprising a first set of key-value attribute pairs associated with a first organizational entity and a second set of key-value attribute pairs associated with a second organizational entity; executing a key-value pair similarity algorithm on the subset of the aggregate key-value attribute pairs to generate a shared output mapping; and sending a response to the query to the requestor, the response comprising at least a portion of the shared output mapping.

2 . The computer-implemented method of claim 1 , further comprising:
determining that the requestor is associated with the first organizational entity; determining an access policy associated with the first organizational entity; and determining the at least a portion of the shared output mapping that the requestor is authorized to received based at least in part on the access policy.

3 . The computer-implemented method of claim 1 , wherein executing the key-value pair similarity algorithm comprises:
determining that a first key in a first key-value attribute pair in the first set of key-value attribute pairs exactly matches a second key in a second key-value attribute pair in the second set of key-value attribute pairs; and generating an entry in the shared output mapping, the entry comprising a shared key, the first key-value attribute pair, and the second key-value attribute pair, wherein the shared key exactly matches the first key and the second key.

4 . The computer-implemented method of claim 3 , wherein the subset of the aggregate key-value attribute pairs further comprises a third set of key-value attribute pairs associated with a third organization entity, and wherein executing the key-value pair similarity algorithm further comprises:
determining that a third key in a third key-value attribute pair in the third set of key-value attribute pairs does not exactly match the first key; determining an edit distance between the first key and the third key; determining that the edit distance is less than a threshold value; and adding the third key and a third value associated with the third key to the entry in the shared output mapping.

5 . The computer-implemented method of claim 1 , wherein executing the key-value pair similarity algorithm comprises:
determining that a first key in a first key-value attribute pair in the first set of key-value attribute pairs does not exactly match the second key in a second key-value attribute pair in the second set of key-value attribute pairs; determining an edit distance between the first key and the second key; determining that the edit distance is less than a threshold value; determining that the first key has a longer string length than the second key; selecting the first key as a shared key for the first key-value attribute pair and the second key-value attribute pair; and generating an entry in the shared output mapping, the entry comprising the shared key, the first key-value attribute pair, and the second key-value attribute pair.

6 . The computer-implemented method of claim 1 , wherein executing the key-value pair similarity algorithm comprises:
determining a set of edit distances between a first key value in a first key-value attribute pair in the first set of key-value attribute pairs and a set of key values contained in an entry in the shared output mapping; determining a subset of the set of edit distances that are less than a threshold value; determining that the subset of edit distances includes at least a threshold number of edit distances; and adding the first key-value attribute pair to the entry in the shared output mapping.

7 . The computer-implemented method of claim 1 , further comprising:
performing a sequence alignment of organization-specific key values in an entry of the shared output mapping to generate a set of edit distances; determining a first subset of the set of edit distances that are associated with a particular organization-specific key value; determining a second subset of the first subset of edit distances that are greater than a threshold value; determining that the second subset of edit distances includes at least a threshold number of edit distances; and flagging the particular organization-specific key value as a low confidence value.

8 . A system for distributed matching and association of key-value attribute pairs, the system comprising:
at least one memory storing computer-executable instructions; and at least one processor configured to access the at least one memory and execute the computer-executable instructions to:
receive, from a requestor, a query for attributes associated with a target entity;
access aggregate key-value attribute pairs associated with a plurality of entities;
identify a subset of the aggregate key-value attribute pairs that correspond to the target entity, the subset of the aggregate key-value attribute pairs comprising a first set of key-value attribute pairs associated with a first organizational entity and a second set of key-value attribute pairs associated with a second organizational entity;
execute a key-value pair similarity algorithm on the subset of the aggregate key-value attribute pairs to generate a shared output mapping; and
send a response to the query to the requestor, the response comprising at least a portion of the shared output mapping.

9 . The system of claim 8 , wherein the at least one processor is further configured to execute the computer-executable instructions to:
determine that the requestor is associated with the first organizational entity; determine an access policy associated with the first organizational entity; and determine the at least a portion of the shared output mapping that the requestor is authorized to received based at least in part on the access policy.

10 . The system of claim 8 , wherein the at least one processor is configured to execute the key-value pair similarity algorithm by executing the computer-executable instructions to:
determine that a first key in a first key-value attribute pair in the first set of key-value attribute pairs exactly matches a second key in a second key-value attribute pair in the second set of key-value attribute pairs; and generate an entry in the shared output mapping, the entry comprising a shared key, the first key-value attribute pair, and the second key-value attribute pair, wherein the shared key exactly matches the first key and the second key.

11 . The system of claim 10 , wherein the subset of the aggregate key-value attribute pairs further comprises a third set of key-value attribute pairs associated with a third organization entity, and wherein the at least one processor is configured to execute the key-value pair similarity algorithm by executing the computer-executable instructions to:
determine that a third key in a third key-value attribute pair in the third set of key-value attribute pairs does not exactly match the first key; determine an edit distance between the first key and the third key; determine that the edit distance is less than a threshold value; and add the third key and a third value associated with the third key to the entry in the shared output mapping.

Assignees

• IBM

Inventors

• Brunet Thomas A
• Hiremath Pushpalatha M
• Naganna Soma Shekar
• Scott Ii Willie L

Classifications

• G06F16/24553

  of query operations · CPC title

• G06F16/25

  Integrating or interfacing systems involving database management systems · CPC title

• G06F16/3337 Primary

  Translation of the query language, e.g. Chinese to English · CPC title

• G06N7/02

  using fuzzy logic (computing arrangements based on biological models G06N3/00; computing arrangements using knowledge-based models G06N5/00) · CPC title

• G06F16/2365

  Ensuring data consistency and integrity · CPC title