SYSTEM AND METHOD FOR IMPROVED PARALLEL SEARCH ON BIPARTITE GRAPHS USING DYNAMIC VERTEX-TO-PROCESSOR MAPPING

摘要

PROBLEM TO BE SOLVED: To provide a system for generating recommendations for customers using a parallel search application.SOLUTION: A system dynamically assigns vertices to processors to generate a recommendation for a customer. The system receives graph data with customer and product vertices and purchase edges (1102). The system traverses the graph from a customer vertex to a set of product vertices (1106). The system divides the set of product vertices among a set of processors (1108). Subsequently, the system determines a set of product frontier vertices for each processor, and traverses the graph from the set of product frontier vertices to a set of customer vertices (1110). The system divides the set of customer vertices among a set of processors, and then determines a set of customer frontier vertices for each processor (1112). The system traverses the graph from the set of customer frontier vertices to a set of recommendable product vertices (1114). The system generates one or more product recommendations for the customer (1116).