Holistic Data Management and Relationship Graphs Platform

A method comprising:

• storing first data and second data in a distributed database comprising a plurality of clusters by:
• storing, based on an identity of a first third-party data provider, a first portion of the first data as encrypted first data;
• and
• storing, based on an identity of a second third-party data provider, a second portion of the first data as tokenized data;
• generating a relationship graph indicating a relationship between at least one entity indicated in the processed first data and at least one entity indicated in the processed second data by:
• determining a relationship type between the at least one entity indicated in the first data and the at least one entity indicated in the second data;
• and
• storing, in a primary cluster of the plurality of clusters of the distributed database, the relationship graph, wherein the relationship graph indicates the relationship type;
• receiving, after generating the relationship graph and from a third third-party data provider, third data in a fourth format;
• updating, based on the third data in the distributed database, the relationship graph;
• based on a failure of the primary cluster of the plurality of clusters of the distributed database, performing an automatic detach-and-promote failover process by:
• identifying a secondary cluster corresponding to the primary cluster;
• promoting the secondary cluster to a new primary cluster by removing one or more associations between the secondary cluster and the primary cluster and causing the new primary cluster to provide, to a user computing device, information associated with the updated relationship graph;
• and
• causing display, at the user computing device, based on the updated relationship graph, and using the information associated with the updated relationship graph stored by the new primary cluster, of an updated graphical representation of the at least the portion of the relationship graph.

One or more non-transitory computer-readable media storing instructions that, when executed by one or more processors of a computing device, cause the computing device to:

• store first data and second data in a distributed database comprising a plurality of clusters by:
• storing, based on an identity of a first third-party data provider, a first portion of the first data as encrypted first data;
• and
• storing, based on an identity of a second third-party data provider, a second portion of the first data as tokenized data;
• generate a relationship graph indicating a relationship between at least one entity indicated in the processed first data and at least one entity indicated in the processed second data by:
• determining a relationship type between the at least one entity indicated in the first data and the at least one entity indicated in the second data;
• and
• storing, in a primary cluster of the plurality of clusters of the distributed database, the relationship graph, wherein the relationship graph indicates the relationship type;
• receive, after generating the relationship graph and from a third third-party data provider, third data in a fourth format;
• update, based on the processed third data in the distributed database, the relationship graph;
• based on a failure of the primary cluster of the plurality of clusters of the distributed database, perform an automatic detach-and-promote failover process by:
• identifying a secondary cluster corresponding to the primary cluster;
• promoting the secondary cluster to a new primary cluster by removing one or more associations between the secondary cluster and the primary cluster and causing the new primary cluster to provide, to a user computing device, information associated with the updated relationship graph;
• and
• causing display, at the user computing device, based on the updated relationship graph, and using the information associated with the updated relationship graph stored by the new primary cluster, of an updated graphical representation of the at least the portion of the relationship graph.