1. A method, executed by one or more processors, for compiling at least one search tree based on an original rules set, the method comprising: determining an x number of search phases needed to process an incoming key corresponding to the original rules set, wherein the original rules set includes a plurality of rules, where each of the plurality of rules includes an n number of rule fields and where the incoming key includes an n number of processing fields; generating x sets of search trees, where each of the x sets of search trees corresponds to a respective one of the x number of search phases; and providing the x sets of search trees to a search processor, where each of the x sets of search trees is configured to process respective portions of the incoming key.