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

1. 发明授权

US07181464B2 Forward-only evaluation for XPATH inverse query processing 失效
标题翻译：针对XPATH反向查询处理的仅向前评估
公开(公告)号：US07181464B2
公开(公告)日：2007-02-20
申请号：US10783578
申请日：2004-02-20
申请人： Umesh Madan , David A. Wortendyke , Geary L. Eppley
发明人： Umesh Madan , David A. Wortendyke , Geary L. Eppley
IPC分类号： G06F17/00
CPC分类号： G06F17/30864 , G06F17/30923 , Y10S707/99943 , Y10S707/99953
摘要： 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.
摘要翻译：反向查询引擎，它使用指令树来表示要针对输入应用的查询，而不是单独应用每个查询。指令树中的每个节点表示可执行代码。从根节点到终止分支节点执行时，指令树的每个分支表示要针对输入处理该查询的执行指令。指令树是前向的，因为一旦根据输入处理树中的一个节点，与该节点相关联的可执行代码就不会再次被该节点处理。因此，节省了处理资源和时间。

2. 发明授权

US07644064B2 Systems and methods for filter table optimization 有权
标题翻译：过滤器表优化的系统和方法
公开(公告)号：US07644064B2
公开(公告)日：2010-01-05
申请号：US10782254
申请日：2004-02-19
申请人： Geary L. Eppley , Umesh Madan , David Wortendyke
发明人： Geary L. Eppley , Umesh Madan , David Wortendyke
IPC分类号： G07F17/30
CPC分类号： G06F17/30979 , Y10S707/99933
摘要： At least one implementation described herein relates to using multiple filter engines to optimize query processing. A filter engine comprises a general matcher and at least one optimized matcher, a matcher being a filter engine in its own right. When the filter engine receives an input, the input is analyzed to determine if it can be handled by the optimized matcher. While the general matcher is fully compliant with a query language, the optimized matcher only handles a subset of the query language. Therefore, inputs that can be processed in the optimized matcher are compared against fewer filters, making the filtering process more efficient. The filter engine may also process only a portion of an input in the optimized matcher and another portion of the input in the general matcher, which reduces processing overhead.
摘要翻译：本文所描述的至少一个实现涉及使用多个过滤器引擎来优化查询处理。过滤引擎包括通用匹配器和至少一个优化的匹配器，匹配器本身就是过滤器引擎。当过滤器引擎接收到输入时，分析输入以确定是否可以由优化的匹配器处理。虽然通用匹配器完全符合查询语言，但是优化的匹配器仅处理查询语言的子集。因此，可以在优化的匹配器中处理的输入与较少的过滤器进行比较，从而使过滤过程更有效率。滤波器引擎还可以仅处理优化匹配器中的输入的一部分和通用匹配器中的输入的另一部分，这降低了处理开销。

3. 发明授权

US07512957B2 Interface infrastructure for creating and interacting with web services 有权
标题翻译：用于创建和与Web服务交互的接口基础设施
公开(公告)号：US07512957B2
公开(公告)日：2009-03-31
申请号：US11003307
申请日：2004-12-03
申请人： Shy Cohen , Geary L. Eppley , Douglas M. Purdy , James E. Johnson , Stephen J. Millet , Stephen T. Swartz , Vijay K. Gajjala , Aaron Abraham Stern , Alexander Martin DeJarnatt , Alfred M. Lee, IV , Anand Rjagopalan , Anastasios Kasiolas , Chaitanya D. Upadhyay , Christopher G. Kaler , Craig Andrew Critchley , David Edwin Levin , David Owen Driver , David Wortendyke , Douglas A. Walter , Elliot Lee Waingold , Erik Bo Christensen , Erin P. Honeycutt , Eugene Shvets , Evgeny Osovetsky , Giovanni M. Della-Libera , Jesus Ruiz-Scougall , John David Doty , Jonathan T. Wheeler , Kapil Gupta , Kenneth David Wolf , Krishnan Srinivasan , Lance E. Olson , Matthew Thomas Tavis , Mauro Ottaviani , Max Attar Feingold , Michael James Coulson , Michael Jon Marucheck , Michael Steven Vernal , Michael Thomas Dice , Mohamed-Hany Essam Ramadan , Mohammad Makarechian , Natasha Harish Jethanandani , Richard Dievendorff , Richard Douglas Hill , Ryan Thomas Sturgell , Saurab Nog , Scott Christopher Seely , Serge Sverdlov , Siddhartha Puri , Sowmyanarayanan K. Srinivasan , Stefan Batres , Stefan Harrington Pharies , Tirunelveli Vishwanath , Tomasz Janczuk , Uday S. Hegde , Umesh Madan , Vaithialingam B. Balayogan , Vipul Arunkant Modi , Yaniv Pessach , Yasser Shohoud
发明人： Shy Cohen , Geary L. Eppley , Douglas M. Purdy , James E. Johnson , Stephen J. Millet , Stephen T. Swartz , Vijay K. Gajjala , Aaron Abraham Stern , Alexander Martin DeJarnatt , Alfred M. Lee, IV , Anand Rjagopalan , Anastasios Kasiolas , Chaitanya D. Upadhyay , Christopher G. Kaler , Craig Andrew Critchley , David Edwin Levin , David Owen Driver , David Wortendyke , Douglas A. Walter , Elliot Lee Waingold , Erik Bo Christensen , Erin P. Honeycutt , Eugene Shvets , Evgeny Osovetsky , Giovanni M. Della-Libera , Jesus Ruiz-Scougall , John David Doty , Jonathan T. Wheeler , Kapil Gupta , Kenneth David Wolf , Krishnan Srinivasan , Lance E. Olson , Matthew Thomas Tavis , Mauro Ottaviani , Max Attar Feingold , Michael James Coulson , Michael Jon Marucheck , Michael Steven Vernal , Michael Thomas Dice , Mohamed-Hany Essam Ramadan , Mohammad Makarechian , Natasha Harish Jethanandani , Richard Dievendorff , Richard Douglas Hill , Ryan Thomas Sturgell , Saurab Nog , Scott Christopher Seely , Serge Sverdlov , Siddhartha Puri , Sowmyanarayanan K. Srinivasan , Stefan Batres , Stefan Harrington Pharies , Tirunelveli Vishwanath , Tomasz Janczuk , Uday S. Hegde , Umesh Madan , Vaithialingam B. Balayogan , Vipul Arunkant Modi , Yaniv Pessach , Yasser Shohoud
IPC分类号： G06F3/00
CPC分类号： G06F9/547 , H04L67/02
摘要： A web services namespace pertains to an infrastructure for enabling creation of a wide variety of applications. The infrastructure provides a foundation for building message-based applications of various scale and complexity. The infrastructure or framework provides APIs for basic messaging, secure messaging, reliable messaging and transacted messaging. In some embodiments, the associated APIs are factored into a hierarchy of namespaces in a manner that balances utility, usability, extensibility and versionability.
摘要翻译： Web服务命名空间涉及用于创建各种应用程序的基础架构。该基础设施为构建各种规模和复杂性的基于消息的应用程序提供了基础。基础架构或框架提供基本消息传递，安全消息传递，可靠消息传递和事务消息传递的API。在一些实施例中，相关联的API以平衡实用性，可用性，可扩展性和可版本性的方式考虑到命名空间的层级中。

4. 发明授权

US07287035B2 Evaluating queries against in-memory objects without serialization 失效
标题翻译：评估针对内存中对象的查询而不进行序列化
公开(公告)号：US07287035B2
公开(公告)日：2007-10-23
申请号：US10783599
申请日：2004-02-20
申请人： Umesh Madan , Geary L. Eppley , David Wortendyke
发明人： Umesh Madan , Geary L. Eppley , David Wortendyke
IPC分类号： G06F7/00 , G06Q99/00
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（公共语言运行时）对象评估XML（可扩展标记语言）查询需要序列化CLR对象并从序列化数据中导出XML构造。然后根据XML构造来评估查询。在所描述的实现中，通过创建将对象的属性映射到对象信息集的信息集模型来实现重要的系统资源。然后使用信息集来评估查询以定位对象值，因此不需要序列化。动态生成的IL被使用并重新用于有效执行类似查询的后续评估步骤。

5. 发明授权

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

6. 发明授权

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被使用并重新用于有效执行类似查询的后续评估步骤。

7. 发明授权

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.
摘要翻译：本文描述的实现涉及评估在具有操作码节点和分支节点的操作码树中表示的多个查询。每个操作码节点包括作为从查询编译得到的操作码块的一部分的操作码，操作码块由操作码的线性序列组成。操作码节点根据其操作码块中相应操作码的位置而排列在树中，其中操作代码块中较早出现的操作码在比后续操作码更高的树级别表示。只有一个操作码节点对应于多个查询中包含的常见操作码块段。针对输入执行操作码树会评估操作码树中表示的多个查询中的每一个。

8. 发明授权

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

9. 发明授权

US07921129B2 Evaluating queries against in-memory objects without serialization 失效
标题翻译：评估针对内存中对象的查询而不进行序列化
公开(公告)号：US07921129B2
公开(公告)日：2011-04-05
申请号：US11876564
申请日：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被使用并重新用于有效执行类似查询的后续评估步骤。

10. 发明授权

US07899817B2 Safe mode for inverse query evaluations 有权
标题翻译：反向查询评估的安全模式
公开(公告)号：US07899817B2
公开(公告)日：2011-03-01
申请号：US11245322
申请日：2005-10-05
申请人： Aaron A. Stern , Pompiliu Diplan , Geary L. Eppley , Umesh Madan
发明人： Aaron A. Stern , Pompiliu Diplan , Geary L. Eppley , Umesh Madan
IPC分类号： G06F7/00 , G06F11/00
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

热门服务

关于我们

友情链接

联系方式