Systems and methods for filter processing using hierarchical data and data structures
    21.
    发明授权
    Systems and methods for filter processing using hierarchical data and data structures 有权
    使用分层数据和数据结构进行过滤处理的系统和方法

    公开(公告)号:US07277885B2

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

    申请号:US10781390

    申请日:2004-02-18

    IPC分类号: G06F17/30 G06F7/00 G06F15/16

    摘要: 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.

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

    Systems and methods for parallel evaluation of multiple queries
    22.
    发明申请
    Systems and methods for parallel evaluation of multiple queries 有权
    用于并行评估多个查询的系统和方法

    公开(公告)号:US20050187947A1

    公开(公告)日:2005-08-25

    申请号:US10783343

    申请日:2004-02-20

    IPC分类号: G06F17/00 G06F17/30

    摘要: Implementations described herein relate to using a filter engine opcode tree for evaluating multiple queries. The opcode tree includes opcode nodes and branch nodes. Each opcode node includes one or more computer instructions resulting from compiling a query. Executing the opcode tree a single time evaluates each of multiple queries represented in the opcode tree. When a new opcode node is added to the tree, the context of the opcode tree and the structure of the new opcode are taken into account when modifying a branch node or an opcode node. In certain situation, a branch node is optimized to include an indexed lookup function such as a hash function, to optimize processing of opcode nodes that depend from the branch node. Adding and removing nodes to/from the opcode tree can be handled by a filter engine component or by an opcode object being added to/removed from the tree.

    摘要翻译: 这里描述的实现涉及使用过滤器引擎操作码树来评估多个查询。 操作码树包括操作码节点和分支节点。 每个操作码节点包括一个或多个由编译查询而产生的计算机指令。 执行操作码树一次可以评估操作码树中表示的多个查询中的每一个。 当新的操作码节点被添加到树中时,在修改分支节点或操作码节点时,考虑操作码树的上下文和新操作码的结构。 在某些情况下,优化分支节点以包括诸如散列函数的索引查找功能,以优化从分支节点依赖的操作码节点的处理。 向/从操作码树添加和删除节点可以由过滤器引擎组件或被添加到/从树中删除的操作码对象来处理。

    Forward-only evaluation for XPATH inverse query processing
    23.
    发明申请
    Forward-only evaluation for XPATH inverse query processing 失效
    针对XPATH反向查询处理的仅向前评估

    公开(公告)号:US20050187906A1

    公开(公告)日:2005-08-25

    申请号:US10783578

    申请日:2004-02-20

    IPC分类号: G06F7/00 G06F17/30

    摘要: An inverse query engine that uses an instruction tree to represents the queries to be applied against input, instead of applying each query individually. Each node in the instruction tree represents executable code. Each branch of the instruction tree when executed from the root node to a terminating branch node represents the instructions to be executed to process that query against the input. The instruction tree is forward-only in that once a node in a tree is processed against an input, that executable code associated with that node is not ever processed again for that node. Accordingly, processing resources and time is conserved.

    摘要翻译: 反向查询引擎,它使用指令树来表示要针对输入应用的查询,而不是单独应用每个查询。 指令树中的每个节点表示可执行代码。 从根节点到终止分支节点执行时,指令树的每个分支表示要针对输入处理该查询的执行指令。 指令树是前向的,因为一旦根据输入处理树中的一个节点,与该节点相关联的可执行代码就不会再次被该节点处理。 因此,节省了处理资源和时间。

    Large scale event notification system
    28.
    发明授权
    Large scale event notification system 有权
    大型事件通知系统

    公开(公告)号:US07676812B2

    公开(公告)日:2010-03-09

    申请号:US10166297

    申请日:2002-06-10

    IPC分类号: G06F9/54

    摘要: A scalable event notification system is provided. The event notification system manages the set of topics available for notification via a topic manager network. The event notification system transmits event notifications to event consumers via a subscription manager network. The configuration and operation of the subscription manager network may to reconfigured in response to changing load and fault conditions to facilitate the timely delivery of event notifications. The notification to subscribers also includes mechanisms to provide individual privacy and non-tampering of notifications. Notification may dynamically be delivered to alternative locations and localized to accommodate different natural languages.

    摘要翻译: 提供了可扩展的事件通知系统。 事件通知系统通过主题管理器网络管理可用于通知的一组主题。 事件通知系统通过订阅管理器网络向事件消费者传送事件通知。 可以响应于变化的负载和故障条件来重新配置订阅管理器网络的配置和操作,以便于及时地传送事件通知。 对订户的通知还包括提供个人隐私和不篡改通知的机制。 通知可以动态地交付到其他位置,并进行本地化以适应不同的自然语言。

    High performance navigator for parsing inputs of a message
    29.
    发明申请
    High performance navigator for parsing inputs of a message 有权
    用于解析消息输入的高性能导航器

    公开(公告)号:US20070089115A1

    公开(公告)日:2007-04-19

    申请号:US11245323

    申请日:2005-10-05

    IPC分类号: G06F9/46

    摘要: Example embodiments provide a high performance navigator configured to lightly touch on the elements or input of a message, without necessarily having to build an entire tree structure for each input within the message. In addition, as portions of the inputs are identified as requiring further details, only those stub nodes representing that particular input will be created; thus avoiding the setup cost associated with loading an entire tree. Other example embodiments also provide for other optimizations such as reducing the class types of node allocations needed for navigating a particular message. For instance, a single class is defined that holds enough fields to store all of the information needed for numerous input nodes. Further, these common node structures can simultaneously generate as an array that further allows for more efficient navigation of the inputs.

    摘要翻译: 示例性实施例提供了被配置为轻轻触摸消息的元素或输入的高性能导航器,而不必为消息内的每个输入构建整个树结构。 另外,由于输入的部分被识别为需要进一步的细节,所以仅将形成表示该特定输入的那些存根节点; 从而避免与加载整个树相关的设置成本。 其他示例实施例还提供其他优化,例如减少用于导航特定消息所需的节点分配的类类型。 例如,定义了一个类,它保存足够的字段来存储许多输入节点所需的所有信息。 此外,这些公共节点结构可以同时生成为进一步允许输入的更有效的导航的阵列。

    TEXT ANALYSIS USING PHRASE DEFINITIONS AND CONTAINERS
    30.
    发明申请
    TEXT ANALYSIS USING PHRASE DEFINITIONS AND CONTAINERS 失效
    使用PHRASE定义和容器的文本分析

    公开(公告)号:US20100250235A1

    公开(公告)日:2010-09-30

    申请号:US12410456

    申请日:2009-03-24

    申请人: Umesh Madan

    发明人: Umesh Madan

    IPC分类号: G06F17/27 G10L15/18 G06F17/30

    摘要: In one example, a phrase analyzer may analyze a text input stream to identify phrases contained in the text input stream. The phrase analyzer may receive a specification, which includes dictionaries of phrases and synonyms, and a specification of the phrases, or sequences of phrases to be matched. The phrase analyzer may compare the input stream to the specification and may produce, as output, an identification of which phrases appear in the input stream, and where in the input stream those phrases occur.

    摘要翻译: 在一个示例中,短语分析器可以分析文本输入流以识别包含在文本输入流中的短语。 短语分析器可以接收包括短语和同义词的词典的规范,以及要匹配的短语或短语序列的规范。 短语分析器可以将输入流与规范进行比较,并且可以产生作为输出的输入流中出现哪些短语的标识,以及在输入流中哪些短语出现的地方。