18. A computing system for generating a product recommendation, the system comprising: one or more processors, a computer-readable medium coupled to the one or more processors having instructions stored thereon that, when executed by the one or more processors, cause the one or more processors to perform operations comprising: receiving graph data indicating vertices and edges of the graph, wherein the vertices represent customers and products and the edges represent purchases; receiving a query of the graph to determine a product recommendation; generating a finite-state machine (FSM) based on the query; executing the query; determining whether a current state of the FSM is a traversal state; in response to the current state being a traversal state, generating a traversal FSM; searching the traversal FSM for a nearest future traversal state; generating a bitmask for the future traversal state; and utilizing the generated bitmask when executing the future traversal state to generate the product recommendation.
18. A computing system for generating a product recommendation, the system comprising: one or more processors, a computer-readable medium coupled to the one or more processors having instructions stored thereon that, when executed by the one or more processors, cause the one or more processors to perform operations comprising: receiving graph data indicating vertices and edges of the graph, wherein the vertices represent customers and products and the edges represent purchases; receiving a query of the graph to determine a product recommendation; generating a finite-state machine (FSM) based on the query; executing the query; determining whether a current state of the FSM is a traversal state; in response to the current state being a traversal state, generating a traversal FSM; searching the traversal FSM for a nearest future traversal state; generating a bitmask for the future traversal state; and utilizing the generated bitmask when executing the future traversal state to generate the product recommendation. 21. The computing system of claim 18 , wherein searching for a nearest future traversal state further comprises: determining that the current traversal state is compatible with the nearest future traversal state in that the current traversal state and the nearest future traversal state are associated with equal graphs.