Techniques for resolving single source shortest path for database processing are provided. Graph data for nodes having weights for edges of a database network are iterated producing a new message table and results table in each iteration. The results table stores the minimum path weight. For each iteration the graph data and message table are joined to produce a state of a node and outgoing edge messages. The message table and results table are co-grouped to generate a new message for a next node to process. When done the single source shortest path for the network is produced.