公开(公告)号：US07277885B2

公开(公告)日：2007-10-02

申请号：US10781390

申请日：2004-02-18

申请人： Ceary L. Eppley ,  Umesh Madan ,  David Wortendyke

发明人： Ceary L. Eppley ,  Umesh Madan ,  David Wortendyke

IPC分类号： G06F17/30 ,  G06F7/00 ,  G06F15/16

CPC分类号： G06F17/30557 ,  G06F17/30961 ,  Y10S707/99932 ,  Y10S707/99933

摘要： At least one implementation described herein relates to maintaining filters according to hierarchical data associated with the filters. The filters are maintained in a tree structure that is used to match inputs with filters. A filter hierarchy is an in-memory tree of string segments where each node corresponds to a string segment and references zero or more filters. When an input is received, a path associated with the input is parsed into string segments and the tree is traversed according to the string segments to locate nodes that match the input (primary matching). The input is then compared to filters referenced by matching nodes to locate filters that match the input (secondary matching). As a result, the input is tested against significantly fewer filters and greater efficiency is achieved over typical systems. Also, the primary matching process returns filters in a sorted order which facilitates the secondary matching process.

摘要翻译： 本文描述的至少一个实现涉及根据与滤波器相关联的层级数据来维护滤波器。 滤波器保持在树结构中，用于将输入与滤波器匹配。 过滤器层次结构是字符串段的内存中树，其中每个节点对应于字符串段，并引用零个或多个过滤器。 当接收到输入时，将与输入相关联的路径解析为字符串段，并根据字符串段遍历树，以定位与输入匹配的节点（主要匹配）。 然后将输入与匹配节点引用的过滤器进行比较，以定位与输入匹配的过滤器（辅助匹配）。 因此，对输入进行了测试，显着减少了滤波器，并且在典型系统上实现了更高的效率。 此外，主要匹配过程以排序顺序返回过滤器，这有助于辅助匹配过程。