1. A computer-implemented method comprising: storing a generalized directed acyclic graph (DAG) in a database, wherein the storing comprises encoding path information of the generalized DAG in entries of a path table in the database, the encoding comprises converting the path information into text strings, and the entries of the path table correspond to paths in the generalized DAG from nodes of the generalized DAG to a root node of the generalized DAG; triggering generation of a lexical index of the path table using the text strings, wherein the lexical index separately lists tokens included in the entries; and retrieving one or more portions of the generalized DAG from the database for in-memory operations; wherein the storing comprises generating an adjacency list of the nodes of the generalized DAG. the adjacency list and the path table together forming a dual representation of the generalized DAG.
1. A computer-implemented method comprising: storing a generalized directed acyclic graph (DAG) in a database, wherein the storing comprises encoding path information of the generalized DAG in entries of a path table in the database, the encoding comprises converting the path information into text strings, and the entries of the path table correspond to paths in the generalized DAG from nodes of the generalized DAG to a root node of the generalized DAG; triggering generation of a lexical index of the path table using the text strings, wherein the lexical index separately lists tokens included in the entries; and retrieving one or more portions of the generalized DAG from the database for in-memory operations; wherein the storing comprises generating an adjacency list of the nodes of the generalized DAG. the adjacency list and the path table together forming a dual representation of the generalized DAG. 5. The method of claim 1 , wherein all of the entries represent respective paths using tokens indicating a full node list for each respective path.