1. A computer implemented method for caching a deterministic finite automata-based (DFA-based) graph, the method comprising: analyzing nodes in the DFA-based graph to search for cacheable portions of the DFA-based graph by utilizing an accessibility ranking associated with each node in the DFA-based graph, the accessibility ranking for each node in the DFA-based graph determined by a compiler generating the DFA-based graph and characterizing the likelihood each node will be accessed during a search of the DFA-based graph for a pattern described by a regular expression in an input string, the compiler determining the accessibility ranking for each node during a graph compilation stage; selecting the cacheable portions of the DFA-based graph based on the accessibility rankings of the nodes; and caching, during a loading stage of the DFA-based graph, the cacheable portions of the DFA-based graph selected based on the accessibility rankings determined during the graph compilation stage and storing non-cacheable portions of the DFA-based graph in a main memory, wherein a walker process is configured to search for the pattern by traversing the cacheable portions of the DFA-based graph in cache and traversing the non-cacheable portions of the DFA-based graph in the main memory.