Algorithm for producing a reduced set of pattern/group pairs to identify incoming request strings with a predetermined group.
Original Publication Date: 2002-Oct-09
Included in the Prior Art Database: 2002-Oct-09
By identifying a set of pattern/group pairs, the complete list of mappings between request strings and groups needn't be installed into a running system. This has two advantages. Firstly it reduces the amount of storage required to store the mappings. Secondly if there are less patterns to be compared with an incoming request, CPU processing time for an incoming request is reduced.