IP Library Granted Patent US 11,134,096
Granted Patent B2
US 11,134,096 · App. 16/163,241 · Granted Sep 28, 2021

Method, apparatus, and computer-readable medium for generating data proliferation graph

Inventors: Richard Grondin (Ste-Julie, CA); Gary Patterson (San Ramon, CA); Rahul Gupta (Dublin, CA); Ranjeet Tayi (Fremont, CA); Vikram Tyarla (Hyderabad, IN)
Assignee: INFORMATICA LLC
H04L63/1433H04L63/1408H04L67/306
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,134,096
App. No.
16/163,241
Granted
Sep 28, 2021
Kind
B2
Abstract

An apparatus, computer-readable medium, and computer-implemented method for generating a data proliferation graph, including receiving a selection of a target data store, identifying a plurality of data stores which have either received data that was previously on the target data store or which have sent data that was subsequently on the target data store, the plurality of data stores being divided into a plurality of proliferation levels corresponding to degrees of separation from the target data store and direction of data propagation relative to the target data store, generating a data proliferation graph, and transmitting at least one portion of the data proliferation graph.

Claims (47)

1. A method executed by one or more computing devices for generating a data proliferation graph of data lineage information, the method comprising:

receiving, by at least one of the one or more computing devices, a selection of a target data store, the target data store comprising a data store for which the data lineage information is generated;

identifying, by at least one of the one or more computing devices, a plurality of data objects that have passed through the target data store, each data object being associated with data object metadata;

determining, by at least one of the one or more computing devices, a plurality of data propagation paths of the plurality of data objects through the target data store and a plurality of other data stores based at least in part on the data object metadata associated with each data object in the plurality of data objects; and

identifying, by at least one of the one or more computing devices, a data propagation path in the plurality of data propagation paths as a data proliferation path, the data proliferation path comprising a path taken by one or more data objects in the plurality of data objects through the target data store and one or more other data stores in the plurality of other data stores; and

generating, by at least one of the one or more computing devices, a data proliferation graph comprising the target data store and the data proliferation path of the one or more data objects through the target data store and the one or more other data stores.

2. The method of claim 1 , wherein the one or more other data stores comprise one or more of: at least one upstream data store upstream of the target data store in the data proliferation path or at least one downstream data store downstream of the target data store in the data proliferation path.

3. The method of claim 1 , wherein the data proliferation graph comprises a plurality of proliferation levels corresponding to a plurality of degrees of separation from the target data store in the data proliferation path and a direction of data propagation relative to the target data store, each of the one or more data stores being grouped into the plurality of proliferation levels according to a degree of separation from the target data store and a direction of data propagation relative to the target data store.

4. The method of claim 3 , further comprising:

determining, by at least one of the one or more computing devices, a ranking of at least one other data store in each proliferation level in the plurality of proliferation levels according to a ranking criterion corresponding to an attribute of the at least one other data store; and

sorting, by at least one of the one or more computing devices, the at least one data store in each proliferation level according to the determined ranking criterion.

5. The method of claim 4 , further comprising:

transmitting, by at least one of the one or more computing devices, a portion of the data proliferation graph for display in a user interface, the transmitted portion comprising the target data store, one or more proliferation levels in the plurality of proliferation levels, the data proliferation path through the target data store and the at least one data store in each of the one or more proliferation levels, and the ranking criterion for each proliferation level in the one or more proliferation levels;

wherein the user interface comprises one or more controls configured to adjust the ranking criterion for the one or more proliferation levels and thereby alter the data proliferation path.

6. The method of claim 1 , wherein the target data store corresponds to a target user on a social media platform and wherein the one or more other data stores correspond to one or more other users of the social media platform.

7. An apparatus for generating a data proliferation graph of data lineage information, the apparatus comprising:

one or more processors; and

one or more memories operatively coupled to at least one of the one or more processors and having instructions stored thereon that, when executed by at least one of the one or more processors, cause at least one of the one or more processors to:

receive a selection of a target data store, the target data store comprising a data store for which the data lineage information is generated;

identify a plurality of data objects that have passed through the target data store, each data object being associated with data object metadata

determine a plurality of data propagation paths of the plurality of data objects through the target data store and a plurality of other data stores based at least in part on the data object metadata associated with each data object in the plurality of data objects; and

identify a data propagation path in the plurality of data propagation paths as a data proliferation path, the data proliferation path comprising a path taken by one or more data objects in the plurality of data objects through the target data store and one or more other data stores in the plurality of other data stores; and

generate a data proliferation graph comprising the target data store and the data proliferation path of the one or more data objects through the target data store and the one or more other data stores.

8. The apparatus of claim 7 , wherein the one or more other data stores comprise one or more of: at least one upstream data store upstream of the target data store in the data proliferation path or at least one downstream data store downstream of the target data store in the data proliferation path.

9. The apparatus of claim 7 , wherein the data proliferation graph comprises a plurality of proliferation levels corresponding to a plurality of degrees of separation from the target data store in the data proliferation path and a direction of data propagation relative to the target data store, each of the one or more data stores being grouped into the plurality of proliferation levels according to a degree of separation from the target data store and a direction of data propagation relative to the target data store.

10. The apparatus of claim 9 , wherein at least one of the one or more memories has further instructions stored thereon that, when executed by at least one of the one or more processors, cause at least one of the one or more processors to:

determine a ranking of at least one other data store in each proliferation level in the plurality of proliferation levels according to a ranking criterion corresponding to an attribute of the at least one other data store; and

sort the at least one data store in each proliferation level according to the determined ranking criterion.

11. The apparatus of claim 10 , wherein at least one of the one or more memories has further instructions stored thereon that, when executed by at least one of the one or more processors, cause at least one of the one or more processors to:

transmit a portion of the data proliferation graph for display in a user interface, the transmitted portion comprising the target data store, one or more proliferation levels in the plurality of proliferation levels, the data proliferation path through the target data store and the at least one data store in each of the one or more proliferation levels, and the ranking criterion for each proliferation level in the one or more proliferation levels;

wherein the user interface comprises one or more controls configured to adjust the ranking criterion for the one or more proliferation levels and thereby alter the data proliferation path.

12. The apparatus of claim 7 , wherein the target data store corresponds to a target user on a social media platform and wherein the one or more other data stores correspond to one or more other users of the social media platform.

13. At least one non-transitory computer-readable medium storing computer-readable instructions that, when executed by one or more computing devices, cause at least one of the one or more computing devices to:

receive a selection of a target data store, the target data store comprising a data store for which the data lineage information is generated;

identify a plurality of data objects that have passed through the target data store, each data object being associated with data object metadata;

determine a plurality of data propagation paths of the plurality of data objects through the target data store and a plurality of other data stores based at least in part on the data object metadata associated with each data object in the plurality of data objects; and

identify a data propagation path in the plurality of data propagation paths as a data proliferation path, the data proliferation path comprising a path taken by one or more data objects in the plurality of data objects through the target data store and one or more other data stores in the plurality of other data stores; and

generate a data proliferation graph comprising the target data store and the data proliferation path of the one or more data objects through the target data store and the one or more other data stores.

14. The at least one non-transitory computer-readable medium of claim 13 , wherein the one or more other data stores comprise one or more of: at least one upstream data store upstream of the target data store in the data proliferation path or at least one downstream data store downstream of the target data store in the data proliferation path.

15. The at least one non-transitory computer-readable medium of claim 13 , wherein the data proliferation graph comprises a plurality of proliferation levels corresponding to a plurality of degrees of separation from the target data store in the data proliferation path and a direction of data propagation relative to the target data store, each of the one or more data stores being grouped into the plurality of proliferation levels according to a degree of separation from the target data store and a direction of data propagation relative to the target data store.

16. The at least one non-transitory computer-readable medium of claim 15 , further storing computer-readable instructions that, when executed by at least one of the one or more computing devices, cause at least one of the one or more computing devices to:

determine a ranking of at least one other data store in each proliferation level in the plurality of proliferation levels according to a ranking criterion corresponding to an attribute of the at least one other data store; and

sort the at least one data store in each proliferation level according to the determined ranking criterion.

17. The at least one non-transitory computer-readable medium of claim 16 , further storing computer-readable instructions that, when executed by at least one of the one or more computing devices, cause at least one of the one or more computing devices to:

transmit a portion of the data proliferation graph for display in a user interface, the transmitted portion comprising the target data store, one or more proliferation levels in the plurality of proliferation levels, the data proliferation path through the target data store and the at least one data store in each of the one or more proliferation levels, and the ranking criterion for each proliferation level in the one or more proliferation levels;

wherein the user interface comprises one or more controls configured to adjust the ranking criterion for the one or more proliferation levels and thereby alter the data proliferation path.

18. The at least one non-transitory computer-readable medium of claim 13 , wherein the target data store corresponds to a target user on a social media platform and wherein the one or more other data stores correspond to one or more other users of the social media platform.

Assignments (6)
RELEASE OF SECURITY INTEREST Recorded Nov 18, 2025
From: JPMORGAN CHASE BANK, N.A.
To: INFORMATICA LLC
Reel/Frame 073597/0722 →
RELEASE OF SECURITY INTEREST Recorded Oct 29, 2021
From: NOMURA CORPORATE FUNDING AMERICAS, LLC
To: INFORMATICA LLC
Reel/Frame 057973/0496 →
RELEASE OF SECURITY INTEREST Recorded Oct 29, 2021
From: NOMURA CORPORATE FUNDING AMERICAS, LLC
To: INFORMATICA LLC
Reel/Frame 057973/0507 →
SECURITY INTEREST Recorded Oct 29, 2021
From: INFORMATICA LLC
To: JPMORGAN CHASE BANK, N.A.
Reel/Frame 057973/0568 →
FIRST LIEN SECURITY AGREEMENT SUPPLEMENT Recorded Feb 26, 2020
From: INFORMATICA LLC
To: NOMURA CORPORATE FUNDING AMERICAS, LLC
Reel/Frame 052019/0764 →
SECURITY INTEREST Recorded Feb 26, 2020
From: INFORMATICA LLC
To: NOMURA CORPORATE FUNDING AMERICAS, LLC
Reel/Frame 052022/0906 →
Continuity (2)
Continuation 14680835 · Apr 7, 2015
Related Publication 20190052668A1 · Feb 14, 2019