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

1. 发明授权

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.
摘要翻译：本文所描述的至少一个实现涉及使用多个过滤器引擎来优化查询处理。过滤引擎包括通用匹配器和至少一个优化的匹配器，匹配器本身就是过滤器引擎。当过滤器引擎接收到输入时，分析输入以确定是否可以由优化的匹配器处理。虽然通用匹配器完全符合查询语言，但是优化的匹配器仅处理查询语言的子集。因此，可以在优化的匹配器中处理的输入与较少的过滤器进行比较，从而使过滤过程更有效率。滤波器引擎还可以仅处理优化匹配器中的输入的一部分和通用匹配器中的输入的另一部分，这降低了处理开销。

2. 发明授权

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以平衡实用性，可用性，可扩展性和可版本性的方式考虑到命名空间的层级中。

3. 发明授权

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

4. 发明授权

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

5. 发明授权

US07558917B2 Inverse query engine systems with cache and methods for cache maintenance 有权
标题翻译：具有缓存和缓存维护方法的反向查询引擎系统
公开(公告)号：US07558917B2
公开(公告)日：2009-07-07
申请号：US10779328
申请日：2004-02-13
申请人： Umesh Madan , Geary L. Eppley , David Wortendyke
发明人： Umesh Madan , Geary L. Eppley , David Wortendyke
IPC分类号： G06F12/00 , G06F7/00 , G06F17/30 , G06F13/00 , G06F13/28
CPC分类号： G06F17/30867 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935
摘要： An inverse query engine system having a cache integrated therein and methods for maintaining the cache are described herein. Entities storing filters in the inverse query engine cache thus do not have to maintain an individual cache to maintain the filters. The inverse query engine system cache is maintained within a bounded size by removing expired filters from the cache and trimming the cache to an optimal size when the cache reaches a maximum size. In the event that filter size cannot be determined efficiently, weights may be associated with filters stored in the cache, each weight identifying an estimate of a filter size. The weights are used to determine cache size and to maintain the cache size within particular bounds.
摘要翻译：这里描述了具有集成在其中的高速缓存的逆查询引擎系统和用于维护高速缓存的方法。因此，在逆查询引擎高速缓存中存储过滤器的实体不必维护单个缓存来维护过滤器。反向查询引擎系统缓存通过从高速缓存中移除已过期的过滤器并在高速缓存达到最大大小时将高速缓存修剪到最佳大小来维护在有界大小内。在无法有效地确定滤波器大小的情况下，权重可以与存储在高速缓存中的滤波器相关联，每个权重识别滤波器尺寸的估计。权重用于确定高速缓存大小并将高速缓存大小保持在特定范围内。

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. 发明授权

US07949787B2 Open content model Web service messaging 有权
标题翻译：打开内容模型Web服务消息传递
公开(公告)号：US07949787B2
公开(公告)日：2011-05-24
申请号：US10801999
申请日：2004-03-15
申请人： Donald F. Box , Christopher G. Kaler , David E. Langworthy , Steven E. Lucco , John Shewchuk , Luis Felipe Cabrera , Craig A Critchley , Geary L. Eppley , Bradford H. Lovering , Jeffrey C. Schlimmer , David Wortendyke , Henrik F. Nielsen
发明人： Donald F. Box , Christopher G. Kaler , David E. Langworthy , Steven E. Lucco , John Shewchuk , Luis Felipe Cabrera , Craig A Critchley , Geary L. Eppley , Bradford H. Lovering , Jeffrey C. Schlimmer , David Wortendyke , Henrik F. Nielsen
IPC分类号： G06F15/16
CPC分类号： G06F9/546 , H04L51/066 , H04L67/02 , H04M1/22
摘要： Systems and methods for open content model Web service messaging in a networked computing environment are described. In one aspect, a transport neutral message is generated that includes message recipient, endpoint addressing information, and one or more reference properties. The reference properties include selectively opaque message context. The transport neutral message is bound to a transport protocol for communication to the message recipient. At least a portion of the selectively opaque message context is not directed to the message recipient.
摘要翻译：描述了用于开放内容的系统和方法在网络计算环境中的Web服务消息传递。在一个方面，生成包括消息接收者，端点寻址信息和一个或多个参考属性的传输中性消息。引用属性包括选择性地不透明的消息上下文。传输中性消息被绑定到用于与消息接收者通信的传输协议。选择性地不透明消息上下文的至少一部分不指向消息接收者。

10. 发明授权

US07254579B2 Using endpoint references in a pub-sub system 失效
标题翻译：在pub-sub系统中使用端点引用
公开(公告)号：US07254579B2
公开(公告)日：2007-08-07
申请号：US10801998
申请日：2004-03-15
申请人： Luis Felipe Cabrera , Geary L. Eppley , Jeffrey C. Schlimmer , David Wortendyke , Bradford H. Lovering , Craig A Critchley
发明人： Luis Felipe Cabrera , Geary L. Eppley , Jeffrey C. Schlimmer , David Wortendyke , Bradford H. Lovering , Craig A Critchley
IPC分类号： G06F17/30
CPC分类号： H04L67/02
摘要： Systems and methods for using endpoint references in a publish-subscribe system are described. In one aspect, an endpoint reference is created by a component of the pub-sub system. The endpoint reference includes an endpoint address and one or more contexts. Each context is directed to a respective component of the pub-sub system. Each context is transparent to the respective component, and selectively opaque to all other pub-sub system components.
摘要翻译：描述在发布订阅系统中使用端点引用的系统和方法。在一个方面，由pub-sub系统的组件创建端点引用。端点引用包括端点地址和一个或多个上下文。每个上下文被引导到公共子系统的相应组件。每个上下文对于相应的组件是透明的，并且对所有其他公共子系统组件选择性地不透明。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式