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

31. 发明申请

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

32. 发明申请

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

33. 发明申请

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

34. 发明申请

US20050182754A1 Inverse query engine systems with cache and methods for cache maintenance 有权
标题翻译：具有缓存和缓存维护方法的反向查询引擎系统
公开(公告)号：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.
摘要翻译：这里描述了具有集成在其中的高速缓存的逆查询引擎系统和用于维护高速缓存的方法。因此，在逆查询引擎高速缓存中存储过滤器的实体不必维护单个缓存来维护过滤器。反向查询引擎系统缓存通过从高速缓存中移除已过期的过滤器并在高速缓存达到最大大小时将高速缓存修剪到最佳大小来维护在有界大小内。在无法有效地确定滤波器大小的情况下，权重可以与存储在高速缓存中的滤波器相关联，每个权重识别滤波器尺寸的估计。权重用于确定高速缓存大小并将高速缓存大小保持在特定范围内。

35. 发明授权

US09354940B2 Provisioning tenants to multi-tenant capable services 有权
标题翻译：为租户提供多租户服务
公开(公告)号：US09354940B2
公开(公告)日：2016-05-31
申请号：US13354197
申请日：2012-01-19
申请人： Nagalinga Durga Prasad Sripathi Panditharadhya , Markus Horstmann , Girish Nagaraja , Clemens Friedrich Vasters , David Wortendyke
发明人： Nagalinga Durga Prasad Sripathi Panditharadhya , Markus Horstmann , Girish Nagaraja , Clemens Friedrich Vasters , David Wortendyke
IPC分类号： G06F9/46 , G06F9/50 , G06F15/173 , G06F9/455 , G06F9/445
CPC分类号： G06F9/5072 , G06F9/44521 , G06F9/45504 , G06F9/5011 , G06F9/5083 , G06F15/17362 , G06F15/17375
摘要： The present invention extends to methods, systems, and computer program products for implementing a tenant provisioning system in a multi-tenancy architecture using a single provisioning master in the architecture, and a data center provisioner in each data center in the architecture. The provisioning master receives user requests to provision a tenant of a service and routes such requests to an appropriate data center provisioner. Each service in the multi-tenancy architecture implements a common interface by which the corresponding data center provisioner can obtain a common indication of load from each different service deployed in the data center thus facilitating the selection of a scale unit on which a tenant is provisioned. The common interface also enables a service to dynamically register (i.e. without redeploying the tenant provisioning system) with the provisioning master as a multi-tenancy service by registering an endpoint address with the provisioning master.
摘要翻译：本发明扩展到用于在架构中使用单个供应主机的多租户架构中实现租户供应系统的方法，系统和计算机程序产品，以及在架构中的每个数据中心中的数据中心提供器。配置主服务器接收用户请求以提供服务的租户，并将这些请求路由到适当的数据中心提供者。多租户架构中的每个服务实现了一个公共接口，相应的数据中心提供者可以通过该接口获得从数据中心中部署的每个不同服务的负载的公共指示，从而便于选择提供租户的规模单元。公共接口还使服务能够通过向提供主服务器注册端点地址来动态地注册（即不重新部署租户供应系统）与供应主设备作为多租户服务。

36. 发明申请

US20130152102A1 RUNTIME-AGNOSTIC MANAGEMENT OF APPLICATIONS 有权
标题翻译：应用程序的运行管理
公开(公告)号：US20130152102A1
公开(公告)日：2013-06-13
申请号：US13316580
申请日：2011-12-12
申请人： Gilles Zunuino , William Scheidel , David Wortendyke
发明人： Gilles Zunuino , William Scheidel , David Wortendyke
IPC分类号： G06F9/46
CPC分类号： G06F11/3006 , G06F11/302 , G06F11/3055 , G06F11/3089
摘要： An application may be modeled as a collection of resource usage. The model allows the application to be elastic so that additional resource usage can be added when needed. Items may be added to and/or removed from applications at any time without regard to the state of the application. Existing items in the application may also be altered at any time regardless of the application state. A set of interfaces are used to manage the resources. The interface allow for the provisioning, configuration, deployment, monitoring and diagnostics of resources in a consistent way.
摘要翻译：应用程序可能被建模为资源使用的集合。该模型允许应用程序具有弹性，以便在需要时添加额外的资源。项目可以随时添加到应用程序和/或从应用程序中删除，而不考虑应用程序的状态。无论应用程序状态如何，应用程序中的现有项目也可随时更改。一组接口用于管理资源。该接口允许以一致的方式进行资源的配置，配置，部署，监视和诊断。

37. 发明申请

US20120215918A1 MULTI-TENANT SERVICES GATEWAY 有权
标题翻译：多重服务网关
公开(公告)号：US20120215918A1
公开(公告)日：2012-08-23
申请号：US13031263
申请日：2011-02-21
申请人： Clemens Vasters , Ronen Hilewicz , David Wortendyke
发明人： Clemens Vasters , Ronen Hilewicz , David Wortendyke
IPC分类号： G06F15/16
CPC分类号： G06F9/5011 , H04L67/02
摘要： A system and method for providing services to multiple tenants. A system provides a gateway that acts as an intermediary between the tenants and multiple subsystems that provide resources. A management gateway handles requests to manage resources. A runtime gateway handles requests to perform operations related to the resources. A set of protocol handlers isolates the subsystems from protocols used by the tenants. A pipeline of components provides processing, such as authorization, of requests from tenants. Identification of resources is performed using a mechanism that enables multiple namespaces, which may be designated by tenants.
摘要翻译：一种向多个租户提供服务的系统和方法。系统提供一个网关，充当租户和提供资源的多个子系统之间的中介。管理网关处理管理资源的请求。运行时网关处理与资源相关的操作的请求。一组协议处理程序将子系统与租户使用的协议隔离开来。组件管道提供租户请求的处理，如授权。使用能够由租户指定的多个命名空间的机制来执行资源的识别。

38. 发明授权

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

39. 发明授权

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

40. 发明授权

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

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式