Prefix Tree Based Rule Mapping
Original Publication Date: 2007-May-23
Included in the Prior Art Database: 2007-May-23
Traditionally, rule mapping engines in a proxy server compare an incoming request URI to a list of mapping rules one by one until a match occurs. This scheme is sufficient for a proxy server that has a small number of rules, however, this algorithm will not handle large sets of rules efficiently and it may cause extensive cpu usage during the rule mapping process at runtime. This article provides an advanced algorithm, Prefix tree based rule mapping, which will significantly improve the performance of the proxy server rule mapping process. At the same time, it still honors the order of the rules and supports rule insertion and deletion dynamically.