Index for traversing hierarchical data

A computer-implemented method, comprising:

• generating, based at least on a source table stored in a database, an index for traversing a graph corresponding to the source table, the source table identifying a parent node for each node in the graph, the generating of the index including iterating over at least a portion of the source table to generate an inner node map, and the inner node map including at least one mapping identifying one or more children nodes descending from an inner node in the graph;
• and
• traversing, based at least on the index, the graph, the index enabling the graph to be traversed depth first starting from a root node of the graph and continuing to a first child node descending from the root node of the graph.

A non-transitory computer readable medium storing instructions, which when executed by at least one data processor, result in operations comprising:

• generating, based at least on a source table stored in a database, an index for traversing a graph corresponding to the source table, the source table identifying a parent node for each node in the graph, the generating of the index including iterating over at least a portion of the source table to generate an inner node map, and the inner node map including at least one mapping identifying one or more children nodes descending from an inner node in the graph;
• and
• traversing, based at least on the index, the graph, the index enabling the graph to be traversed depth first starting from a root node of the graph and continuing to a first child node descending from the root node of the graph.