专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

11. 发明授权

US07792852B2 Evaluating queries against in-memory objects without serialization 有权
标题翻译：评估针对内存中对象的查询而不进行序列化
公开(公告)号：US07792852B2
公开(公告)日：2010-09-07
申请号：US11876515
申请日：2007-10-22
申请人： Umesh Madan , Geary L. Eppley , David Wortendyke
发明人： Umesh Madan , Geary L. Eppley , David Wortendyke
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/3066 , Y10S707/955 , Y10S707/99942
摘要： At least one implementation described herein relates to evaluating queries structured according to a first format against one or more objects structured according to a second, different format without serializing the object. Typically, evaluating an XML (eXtensible Markup Language) query against a CLR (Common Language Runtime) object required serializing the CLR object and deriving an XML construct from the serialized data. The query is then be evaluated against the XML construct. In the described implementations, significant system resources are realized by creating an infoset model that maps properties of an object to an object infoset. The query is then evaluated using the infoset to locate object values and, thus, no serialization is required. Dynamically generated IL is used and re-used to efficiently perform subsequent evaluation steps on similar queries.
摘要翻译：本文所描述的至少一个实现涉及针对根据第二不同格式而构造的一个或多个对象，根据第一格式来结构化查询而不串行化该对象。通常，针对CLR（Common Language Runtime）对象评估XML（可扩展标记语言）查询需要序列化CLR对象并从序列化数据中导出XML构造。然后根据XML构造来评估查询。在所描述的实现中，通过创建将对象的属性映射到对象信息集的信息集模型来实现重要的系统资源。然后使用信息集来评估查询以定位对象值，因此不需要序列化。动态生成的IL被使用并重新用于有效执行类似查询的后续评估步骤。

12. 发明授权

US07676812B2 Large scale event notification system 有权
标题翻译：大型事件通知系统
公开(公告)号：US07676812B2
公开(公告)日：2010-03-09
申请号：US10166297
申请日：2002-06-10
申请人： Luis Felipe Cabrera , Umesh Madan , John P. Shewchuk , David Alan Wortendyke
发明人： Luis Felipe Cabrera , Umesh Madan , John P. Shewchuk , David Alan Wortendyke
IPC分类号： G06F9/54
CPC分类号： H04L12/1895 , H04L12/1845 , H04L29/06 , H04L67/22
摘要： 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.
摘要翻译：提供了可扩展的事件通知系统。事件通知系统通过主题管理器网络管理可用于通知的一组主题。事件通知系统通过订阅管理器网络向事件消费者传送事件通知。可以响应于变化的负载和故障条件来重新配置订阅管理器网络的配置和操作，以便于及时地传送事件通知。对订户的通知还包括提供个人隐私和不篡改通知的机制。通知可以动态地交付到其他位置，并进行本地化以适应不同的自然语言。

13. 发明授权

US07664728B2 Systems and methods for parallel evaluation of multiple queries 有权
标题翻译：用于并行评估多个查询的系统和方法
公开(公告)号：US07664728B2
公开(公告)日：2010-02-16
申请号：US10783343
申请日：2004-02-20
申请人： David Wortendyke , Umesh Madan , Geary L. Eppley
发明人： David Wortendyke , Umesh Madan , Geary L. Eppley
IPC分类号： G07F17/30
CPC分类号： G06F17/3046 , G06F17/30516 , Y10S707/99932
摘要： Implementations described herein relate to evaluating multiple queries represented in an opcode tree having opcode nodes and branch nodes. Each opcode node comprises an opcode that is a part of an opcode block derived from compilation of a query, the opcode block consisting of a linear sequence of opcodes. Opcode nodes are arranged in the tree according to location of its corresponding opcode in the opcode block with opcodes that occur earlier in the opcode block being represented at a higher tree level than subsequent opcodes. Only one opcode node corresponds to a common opcode block segment that is included in multiple queries. Executing the opcode tree against an input evaluates each of the multiple queries represented in the opcode tree.
摘要翻译：本文描述的实现涉及评估在具有操作码节点和分支节点的操作码树中表示的多个查询。每个操作码节点包括作为从查询编译得到的操作码块的一部分的操作码，操作码块由操作码的线性序列组成。操作码节点根据其操作码块中相应操作码的位置而排列在树中，其中操作代码块中较早出现的操作码在比后续操作码更高的树级别表示。只有一个操作码节点对应于多个查询中包含的常见操作码块段。针对输入执行操作码树会评估操作码树中表示的多个查询中的每一个。

14. 发明授权

US07539691B2 Systems and methods for updating a query engine opcode tree 有权
标题翻译：用于更新查询引擎操作码树的系统和方法
公开(公告)号：US07539691B2
公开(公告)日：2009-05-26
申请号：US10783598
申请日：2004-02-20
申请人： David Wortendyke , Umesh Madan , Geary L. Eppley
发明人： David Wortendyke , Umesh Madan , Geary L. Eppley
IPC分类号： G06F17/30
CPC分类号： G06F17/3046 , G06F17/30864 , G06F17/30902 , Y10S707/99942 , Y10S707/99943
摘要： 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.
摘要翻译：这里描述的实现涉及使用过滤器引擎操作码树来评估多个查询。操作码树包括操作码节点和分支节点。每个操作码节点包括一个或多个由编译查询而产生的计算机指令。执行操作码树一次可以评估操作码树中表示的多个查询中的每一个。当新的操作码节点被添加到树中时，在修改分支节点或操作码节点时，考虑操作码树的上下文和新操作码的结构。在某些情况下，优化分支节点以包括诸如散列函数的索引查找功能，以优化从分支节点依赖的操作码节点的处理。向/从操作码树添加和删除节点可以由过滤器引擎组件或被添加到/从树中删除的操作码对象来处理。

15. 发明申请

US20070089115A1 High performance navigator for parsing inputs of a message 有权
标题翻译：用于解析消息输入的高性能导航器
公开(公告)号：US20070089115A1
公开(公告)日：2007-04-19
申请号：US11245323
申请日：2005-10-05
申请人： Aaron Stern , Geary Eppley , Umesh Madan
发明人： Aaron Stern , Geary Eppley , Umesh Madan
IPC分类号： G06F9/46
CPC分类号： G06F17/30914 , G06F17/272 , Y10S707/99942 , Y10S707/99943
摘要： 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.
摘要翻译：示例性实施例提供了被配置为轻轻触摸消息的元素或输入的高性能导航器，而不必为消息内的每个输入构建整个树结构。另外，由于输入的部分被识别为需要进一步的细节，所以仅将形成表示该特定输入的那些存根节点; 从而避免与加载整个树相关的设置成本。其他示例实施例还提供其他优化，例如减少用于导航特定消息所需的节点分配的类类型。例如，定义了一个类，它保存足够的字段来存储许多输入节点所需的所有信息。此外，这些公共节点结构可以同时生成为进一步允许输入的更有效的导航的阵列。

16. 发明申请

US20100250235A1 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
CPC分类号： G06F17/2775 , G06F17/2735 , G06F17/30637
摘要： 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.
摘要翻译：在一个示例中，短语分析器可以分析文本输入流以识别包含在文本输入流中的短语。短语分析器可以接收包括短语和同义词的词典的规范，以及要匹配的短语或短语序列的规范。短语分析器可以将输入流与规范进行比较，并且可以产生作为输出的输入流中出现哪些短语的标识，以及在输入流中哪些短语出现的地方。

17. 发明授权

US07627681B2 Relaying messages through a firewall 有权
标题翻译：通过防火墙中继消息
公开(公告)号：US07627681B2
公开(公告)日：2009-12-01
申请号：US11185347
申请日：2005-07-20
申请人： Saurab Nog , Alfred McClung Lee, IV , Cesar M. Ruiz-Meraz , Umesh Madan
发明人： Saurab Nog , Alfred McClung Lee, IV , Cesar M. Ruiz-Meraz , Umesh Madan
IPC分类号： G06F15/16
CPC分类号： H04L63/02 , H04L63/166 , H04L69/24
摘要： The present invention extends to methods, systems, and computer program products for relaying messages through firewalls. A message relay negotiates first communication parameters with relay components inside a firewall and (potentially different) second communication parameters with applications outside the firewall. The message relay receives a message from an outside application in accordance with the second negotiated parameters and maps an electronic address in the received message to an inside application. The message relay transforms the message and sends the transformed message over an established connection through the firewall to a relay component in accordance with the first negotiated parameters. The relay component receives the transformed message and transforms the transformed message back into the message. The relay component delivers the message to the inside application in accordance with the second negotiated parameters.
摘要翻译：本发明扩展到用于通过防火墙中继消息的方法，系统和计算机程序产品。消息中继与防火墙之外的中继组件协商第一个通信参数，并与防火墙外部的应用程序（潜在不同的）第二通信参数协商。消息中继器根据第二协商参数从外部应用接收消息，并将接收到的消息中的电子地址映射到内部应用。消息中继转换消息，并根据第一协商参数通过防火墙通过建立的连接将转换的消息发送到中继组件。中继组件接收变换的消息，并将变换的消息转换回消息。中继组件根据第二协商参数将消息传递到内部应用。

18. 发明授权

US07548926B2 High performance navigator for parsing inputs of a message 有权
标题翻译：用于解析消息输入的高性能导航器
公开(公告)号：US07548926B2
公开(公告)日：2009-06-16
申请号：US11245323
申请日：2005-10-05
申请人： Aaron A. Stern , Geary L. Eppley , Umesh Madan
发明人： Aaron A. Stern , Geary L. Eppley , Umesh Madan
IPC分类号： G06F17/30
CPC分类号： G06F17/30914 , G06F17/272 , Y10S707/99942 , Y10S707/99943
摘要： 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.
摘要翻译：示例性实施例提供了被配置为轻轻触摸消息的元素或输入的高性能导航器，而不必为消息内的每个输入构建整个树结构。另外，由于输入的部分被识别为需要进一步的细节，所以仅将形成表示该特定输入的那些存根节点; 从而避免与加载整个树相关的设置成本。其他示例实施例还提供其他优化，例如减少用于导航特定消息所需的节点分配的类类型。例如，定义了一个类，它保存足够的字段来存储许多输入节点所需的所有信息。此外，这些公共节点结构可以同时生成为进一步允许输入的更有效的导航的阵列。

19. 发明申请

US20080040333A1 Evaluating queries against in-memory objects without serialization 失效
标题翻译：评估针对内存中对象的查询而不进行序列化
公开(公告)号：US20080040333A1
公开(公告)日：2008-02-14
申请号：US11876564
申请日：2007-10-22
申请人： Umesh Madan , Geary Eppley , David Wortendyke
发明人： Umesh Madan , Geary Eppley , David Wortendyke
IPC分类号： G06F17/30
CPC分类号： G06F17/3066 , Y10S707/955 , Y10S707/99942
摘要： At least one implementation described herein relates to evaluating queries structured according to a first format against one or more objects structured according to a second, different format without serializing the object. Typically, evaluating an XML (eXtensible Markup Language) query against a CLR (Common Language Runtime) object required serializing the CLR object and deriving an XML construct from the serialized data. The query is then be evaluated against the XML construct. In the described implementations, significant system resources are realized by creating an infoset model that maps properties of an object to an object infoset. The query is then evaluated using the infoset to locate object values and, thus, no serialization is required. Dynamically generated IL is used and re-used to efficiently perform subsequent evaluation steps on similar queries.
摘要翻译：本文所描述的至少一个实现涉及针对根据第二不同格式而构造的一个或多个对象，根据第一格式来结构化查询而不串行化该对象。通常，针对CLR（Common Language Runtime）对象评估XML（可扩展标记语言）查询需要序列化CLR对象并从序列化数据中导出XML构造。然后根据XML构造来评估查询。在所描述的实现中，通过创建将对象的属性映射到对象信息集的信息集模型来实现重要的系统资源。然后使用信息集来评估查询以定位对象值，因此不需要序列化。动态生成的IL被使用并重新用于有效执行类似查询的后续评估步骤。

20. 发明申请

US20070078829A1 Safe mode for inverse query evaluations 有权
标题翻译：反向查询评估的安全模式
公开(公告)号：US20070078829A1
公开(公告)日：2007-04-05
申请号：US11245322
申请日：2005-10-05
申请人： Aaron Stern , Geary Eppley , Pompiliu Diplan , Umesh Madan
发明人： Aaron Stern , Geary Eppley , Pompiliu Diplan , Umesh Madan
IPC分类号： G06F17/30
CPC分类号： G06F17/30938 , G06F21/52
摘要： Embodiments herein prevent or mitigate attacks on inverse query engines by providing safe mode routines that allow for the acceptance of third party messages and/or query expressions, as well as prevent trusted sources from accidental attacks. The mitigations fall into two categories: compile-time and runtime. Compile-time mitigations prevent query expressions from being accepted and compiled that are susceptible to known attacks. For example, the complexity of query expressions may be limited to functions with linear runtimes; constant memory usage; or ones that do not create large strings. Further, language constructs for the criteria in the query expression may not allow for nested predicates complexities. Runtime mitigations, on the other hand, monitor the data size and processing lengths of messages against the various query expressions. If these runtime quotas are exceeded, an exception or other violation indication may be thrown (e.g., abort), deeming the evaluation as under attack.
摘要翻译：这里的实施例通过提供允许接受第三方消息和/或查询表达式的安全模式例程，以及防止可信源来自意外攻击来防止或减轻对反向查询引擎的攻击。缓解分为两类：编译时和运行时。编译时缓解阻止查询表达式受到已知攻击的接受和编译。例如，查询表达式的复杂性可能限于具有线性运行时的函数; 不断的内存使用; 或者不创建大字符串的那些。此外，查询表达式中的条件的语言结构可能不允许嵌套谓词的复杂性。另一方面，运行缓解则根据各种查询表达式监视消息的数据大小和处理长度。如果超出这些运行时配额，可能会抛出异常或其他违规指示（例如，中止），将评估视为受到攻击。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式