Method and System for Distributed Processing in a Messaging Platform

A method comprising:

• receiving a graph (G) comprising a plurality of targets and a plurality of influencers, wherein each of the plurality of influencers is related to at least one of the plurality of targets, and wherein each of the plurality of influencers and the plurality of targets corresponds to a respective account of a messaging system, and wherein the graph indicates accounts as nodes and relationships between the accounts as edges connecting one or more nodes;
• value partitioning G across a first physical shard and a second physical shard;
• transposing G to obtain a first transposed graph (GT), wherein the first transposed graph GT transposes the relationships between the nodes of G;
• value partitioning GT across the first physical shard and the second physical shard;
• in response to a request to determine all accounts of G that are influencers of a first account and that are also influenced by a second account:
• issuing to the first physical shard a first request for an intersection of values of G using the first account as key and for values of GT using the second account as key,
• issuing to the second physical shard, a second request for an intersection of values of G using the first account as key and for values of GT using the second account as key, and
• performing a union of received results of the first request and the second request, wherein the results of the union correspond to accounts of G that are influencers of the first account and that are also influenced by the second account;
• determining whether to send a recommendation to one or more of the accounts of the messaging system identified in the results;
• and
• in response to a determination to send the recommendation to one or more of the accounts, sending the recommendation to the determined one or more accounts.