公开(公告)号：US20080040381A1

公开(公告)日：2008-02-14

申请号：US11876515

申请日：2007-10-22

申请人： Umesh Madan ,  Geary Eppley ,  David Wortendyke

发明人： Umesh Madan ,  Geary Eppley ,  David Wortendyke

IPC分类号： G06F7/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（Common Language Runtime）对象评估XML（可扩展标记语言）查询需要序列化CLR对象并从序列化数据中导出XML构造。 然后根据XML构造来评估查询。 在所描述的实现中，通过创建将对象的属性映射到对象信息集的信息集模型来实现重要的系统资源。 然后使用信息集来评估查询以定位对象值，因此不需要序列化。 动态生成的IL被使用并重新用于有效执行类似查询的后续评估步骤。

公开(公告)号：US20050187908A1

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

申请号：US10783599

申请日：2004-02-20

申请人： Umesh Madan ,  Geary Eppley ,  David Wortendyke

发明人： Umesh Madan ,  Geary 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（公共语言运行时）对象评估XML（可扩展标记语言）查询需要序列化CLR对象并从序列化数据中导出XML构造。 然后根据XML构造来评估查询。 在所描述的实现中，通过创建将对象的属性映射到对象信息集的信息集模型来实现重要的系统资源。 然后使用信息集来评估查询以定位对象值，因此不需要序列化。 动态生成的IL被使用并重新用于有效执行类似查询的后续评估步骤。

公开(公告)号：US20050187947A1

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

申请号：US10783343

申请日：2004-02-20

申请人： David Wortendyke ,  Umesh Madan ,  Geary Eppley

发明人： David Wortendyke ,  Umesh Madan ,  Geary Eppley

IPC分类号： G06F17/00 ,  G06F17/30

CPC分类号： G06F17/3046 ,  G06F17/30516 ,  Y10S707/99932

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

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

公开(公告)号：US20050187906A1

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

申请号：US10783578

申请日：2004-02-20

申请人： Umesh Madan ,  David Wortendyke ,  Geary Eppley

发明人： Umesh Madan ,  David Wortendyke ,  Geary Eppley

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

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.

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

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

公开(公告)号：US20060150200A1

公开(公告)日：2006-07-06

申请号：US11003307

申请日：2004-12-03

申请人： Shy Cohen ,  Geary Eppley ,  Douglas Purdy ,  James Johnson ,  Stephen Millet ,  Stephen Swartz ,  Vijay Gajjala ,  Aaron Stern ,  Alexander DeJarnatt ,  Alfred Lee ,  Anand Rjagopalan ,  Anastasios Kasiolas ,  Chaitanya Upadhyay ,  Christopher Kaler ,  Craig Critchley ,  David Levin ,  David Driver ,  David Wortendyke ,  Douglas Walter ,  Elliot Waingold ,  Erik Christensen ,  Erin Honeycutt ,  Eugene Shvets ,  Evgeny Osovetsky ,  Giovanni Della-Libera ,  Jesus Ruiz-Scougall ,  John Doty ,  Jonathan Wheeler ,  Kapil Gupta ,  Kenneth Wolf ,  Krishnan Srinivasan ,  Lance Olson ,  Matthew Tavis ,  Mauro Ottaviani ,  Max Feingold ,  Michael Coulson ,  Michael Marucheck ,  Michael Vernal ,  Michael Dice ,  Mohamed-Hany Ramadan ,  Mohammad Makarechian ,  Natasha Jethanandani ,  Richard Dievendorff ,  Richard Hill ,  Ryan Sturgell ,  Saurab Nog ,  Scott Seely ,  Serge Sverdlov ,  Siddhartha Puri ,  Sowmyanarayanan Srinivasan ,  Stefan Batres ,  Stefan Pharies ,  Tirunelveli Vishwanath ,  Tomasz Janczuk ,  Uday Hegde ,  Umesh Madan ,  Vaithialingam Balayogan ,  Vipul Modi ,  Yaniv Pessach ,  Yasser Shohoud

发明人： Shy Cohen ,  Geary Eppley ,  Douglas Purdy ,  James Johnson ,  Stephen Millet ,  Stephen Swartz ,  Vijay Gajjala ,  Aaron Stern ,  Alexander DeJarnatt ,  Alfred Lee ,  Anand Rjagopalan ,  Anastasios Kasiolas ,  Chaitanya Upadhyay ,  Christopher Kaler ,  Craig Critchley ,  David Levin ,  David Driver ,  David Wortendyke ,  Douglas Walter ,  Elliot Waingold ,  Erik Christensen ,  Erin Honeycutt ,  Eugene Shvets ,  Evgeny Osovetsky ,  Giovanni Della-Libera ,  Jesus Ruiz-Scougall ,  John Doty ,  Jonathan Wheeler ,  Kapil Gupta ,  Kenneth Wolf ,  Krishnan Srinivasan ,  Lance Olson ,  Matthew Tavis ,  Mauro Ottaviani ,  Max Feingold ,  Michael Coulson ,  Michael Marucheck ,  Michael Vernal ,  Michael Dice ,  Mohamed-Hany Ramadan ,  Mohammad Makarechian ,  Natasha Jethanandani ,  Richard Dievendorff ,  Richard Hill ,  Ryan Sturgell ,  Saurab Nog ,  Scott Seely ,  Serge Sverdlov ,  Siddhartha Puri ,  Sowmyanarayanan Srinivasan ,  Stefan Batres ,  Stefan Pharies ,  Tirunelveli Vishwanath ,  Tomasz Janczuk ,  Uday Hegde ,  Umesh Madan ,  Vaithialingam Balayogan ,  Vipul Modi ,  Yaniv Pessach ,  Yasser Shohoud

IPC分类号： G06F9/46

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.

公开(公告)号：US20050198065A1

公开(公告)日：2005-09-08

申请号：US10782254

申请日：2004-02-19

申请人： Geary Eppley ,  Umesh Madan ,  David Wortendyke

发明人： Geary Eppley ,  Umesh Madan ,  David Wortendyke

IPC分类号： G06F7/00

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.

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

公开(公告)号：US20050187907A1

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

申请号：US10783598

申请日：2004-02-20

申请人： David Wortendyke ,  Umesh Madan ,  Geary Eppley

发明人： David Wortendyke ,  Umesh Madan ,  Geary Eppley

IPC分类号： G06F7/00 ,  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.

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

公开(公告)号：US20050182754A1

公开(公告)日：2005-08-18

申请号：US10779328

申请日：2004-02-13

申请人： Umesh Madan ,  Geary Eppley ,  David Wortendyke

发明人： Umesh Madan ,  Geary Eppley ,  David Wortendyke

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

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.

摘要翻译： 这里描述了具有集成在其中的高速缓存的逆查询引擎系统和用于维护高速缓存的方法。 因此，在逆查询引擎高速缓存中存储过滤器的实体不必维护单个缓存来维护过滤器。 反向查询引擎系统缓存通过从高速缓存中移除已过期的过滤器并在高速缓存达到最大大小时将高速缓存修剪到最佳大小来维护在有界大小内。 在无法有效地确定滤波器大小的情况下，权重可以与存储在高速缓存中的滤波器相关联，每个权重识别滤波器尺寸的估计。 权重用于确定高速缓存大小并将高速缓存大小保持在特定范围内。

公开(公告)号：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.

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