Determining relationships between nodes within connected graphs

Abstract

One example method includes generating, from a relevancy graph, a first table and a second table, the relevancy graph comprising a plurality of nodes and a plurality of edges, wherein each node represents an individual and each edge connects two nodes and represents a relationship between the respective two nodes, the first table comprising information about each node in the relevancy graph and the second table comprising information about each edge in the relevancy graph; selecting a seed node from the plurality of nodes; generating a database query to obtain data for a relevancy table based on a set of neighbor nodes to the seed node and a set of corresponding edges connecting the seed node to each neighbor node of the set of neighbor nodes; distributing, to a plurality of computing nodes, portions of the database query to determine, in parallel, probability information for the relevancy table; generating the relevancy table comprising the seed node, the set of neighbor nodes, and, for the seed node and each neighbor node, a corresponding probability based on the probability information; receiving, from a remote computing device, a request related to an individual and a software service offered by a service provider; and determining and providing, to the remote computing device based on the relevancy table, information about a relationship between the individual and one or more individuals represented in the relevancy graph/.