1. A computer implemented method for caching a deterministic finite automata-based graph, the method comprising: analyzing nodes in the graph to search for cacheable portions of the graph based on a geometrical configuration of the graph; and caching the cacheable portions of the graph.