-
公开(公告)号：US20050165768A1
公开(公告)日：2005-07-28
申请号：US11079164
申请日：2005-03-14
CPC分类号： G06F17/30569 , Y10S707/917 , Y10S707/957 , Y10S707/99932 , Y10S707/99937 , Y10S707/99954
摘要： The present invention provides a conversion method for converting numeric multi-dimensional database dimension members to textual representations. The conversion is specifically designed to enable the textual representations of the numeric dimension members to be properly sorted and converted back into numeric representations with accuracy. All numeric and date data is transformed during conversion, such that the textual representation of the numeric and date data is properly sorted as a text string, in the same order as it would be sorted as a number. The present invention also provides a means for accurate reverse-conversion (i.e., from textual representation to numeric representation) by first converting into text the information necessary to support the precision required by the relevant convention of the numeric representation. The present invention also provides a convention for determining the data type of the textual representations of values of various data types. The textual representation of mixed types is configured so that the sort order of different data types and the text string for numeric types will sort by value independent of the numeric data-types.
摘要翻译： 本发明提供了一种用于将数字多维数据库维度成员转换为文本表示的转换方法。 该转换专门设计用于使数字维成员的文本表示能够被正确地排序并精确转换成数字表示。 所有数字和日期数据在转换期间被转换，使得数字和日期数据的文本表示被正确排序为文本字符串，其顺序与排序为数字的顺序相同。 本发明还提供了一种用于通过首先将支持数字表示的相关约定所要求的精度所必需的信息转换为文本的精确反向转换（即，从文本表示到数字表示）的手段。 本发明还提供了一种用于确定各种数据类型的值的文本表示的数据类型的约定。 配置混合类型的文本表示，以便不同数据类型的排序顺序和数字类型的文本字符串将按照与数字数据类型无关的值进行排序。
-
公开(公告)号：US08296354B2
公开(公告)日：2012-10-23
申请号：US11003099
申请日：2004-12-03
申请人： Erik Bo Christensen , Vaithiakingam B. Balayoghan , Michael James Coulson , Ryan Thomas Sturgell , Natasha Harish Jethanandani , Michael Jon Marucheck , Douglas M. Purdy , Kenneth David Wolf , Michael Steven Vernal , Stefan Harrington Pharies , David Wortendyke
发明人： Erik Bo Christensen , Vaithiakingam B. Balayoghan , Michael James Coulson , Ryan Thomas Sturgell , Natasha Harish Jethanandani , Michael Jon Marucheck , Douglas M. Purdy , Kenneth David Wolf , Michael Steven Vernal , Stefan Harrington Pharies , David Wortendyke
IPC分类号： G06F15/16
摘要： The present invention extends to using Simple Object Access Protocol (“SOAP”) to exchange typed objects, such as, for example, parameters for invoking methods. A computer system accesses typed object parameters corresponding to a typed object. The typed object is annotated with one or more message contract attributes of a message contract model defining a mapping between typed object parameters and corresponding SOAP elements. The computer system utilizes the message contract attributes to map the typed object parameters into a SOAP element and inserts the SOAP element into a SOAP envelope. A receiving computer system accessing the SOAP element and utilizes the message contract attributes to map the SOAP element back into the typed object parameters.
摘要翻译： 本发明扩展到使用简单对象访问协议（SOAP）来交换类型的对象，例如用于调用方法的参数。 计算机系统访问与打字对象相对应的类型对象参数。 键入的对象用消息合同模型的一个或多个消息契约属性来注释，定义了类型对象参数和相应的SOAP元素之间的映射。 计算机系统利用消息合同属性将类型化对象参数映射到SOAP元素中，并将SOAP元素插入到SOAP信封中。 接收计算机系统访问SOAP元素并利用消息合同属性将SOAP元素映射回类型对象参数。
-
23.发明授权Systems and methods for filter processing using hierarchical data and data structures 有权使用分层数据和数据结构进行过滤处理的系统和方法公开(公告)号：US07277885B2
公开(公告)日：2007-10-02
申请号：US10781390
申请日：2004-02-18
申请人： Ceary L. Eppley , Umesh Madan , David Wortendyke
发明人： Ceary L. Eppley , Umesh Madan , David Wortendyke
CPC分类号： G06F17/30557 , G06F17/30961 , Y10S707/99932 , Y10S707/99933
摘要： At least one implementation described herein relates to maintaining filters according to hierarchical data associated with the filters. The filters are maintained in a tree structure that is used to match inputs with filters. A filter hierarchy is an in-memory tree of string segments where each node corresponds to a string segment and references zero or more filters. When an input is received, a path associated with the input is parsed into string segments and the tree is traversed according to the string segments to locate nodes that match the input (primary matching). The input is then compared to filters referenced by matching nodes to locate filters that match the input (secondary matching). As a result, the input is tested against significantly fewer filters and greater efficiency is achieved over typical systems. Also, the primary matching process returns filters in a sorted order which facilitates the secondary matching process.
摘要翻译： 本文描述的至少一个实现涉及根据与滤波器相关联的层级数据来维护滤波器。 滤波器保持在树结构中，用于将输入与滤波器匹配。 过滤器层次结构是字符串段的内存中树，其中每个节点对应于字符串段，并引用零个或多个过滤器。 当接收到输入时，将与输入相关联的路径解析为字符串段，并根据字符串段遍历树，以定位与输入匹配的节点（主要匹配）。 然后将输入与匹配节点引用的过滤器进行比较，以定位与输入匹配的过滤器（辅助匹配）。 因此，对输入进行了测试，显着减少了滤波器，并且在典型系统上实现了更高的效率。 此外，主要匹配过程以排序顺序返回过滤器，这有助于辅助匹配过程。
-
24.发明申请公开(公告)号：US20060174016A1
公开(公告)日：2006-08-03
申请号：US11048346
申请日：2005-02-01
申请人： Craig Critchley , David Wortendyke , Elliot Waingold , Eric Zinda , Erik Christensen , Giovanni Della-Libera , Kenneth Wolf , Michael Vernal , Shy Cohen , Stefan Pharies , Stephen Millet , Stephen Swartz , Tomasz Janczuk , Uday Hegde , Yaniv Pessach
发明人： Craig Critchley , David Wortendyke , Elliot Waingold , Eric Zinda , Erik Christensen , Giovanni Della-Libera , Kenneth Wolf , Michael Vernal , Shy Cohen , Stefan Pharies , Stephen Millet , Stephen Swartz , Tomasz Janczuk , Uday Hegde , Yaniv Pessach
CPC分类号： G06F9/546
摘要： The present invention provides for an automated, user friendly way of constructing and using a binding object. A developer is presenting and selects binding elements that will ultimately be used to create a runtime communication channel for transporting a message between a client and service endpoint. After receiving the user input, metadata, a channel factory and listener factory are created. The metadata describes binding elements and provides an abstract representation of a protocol stack that implements communication aspects at runtime. The channel factory is configured to use the collection of metadata at runtime to generate the runtime communication channel. Further, the listener factory is configured to accept the runtime communication channel for de-multiplex the communication aspects in order to process the message at a service endpoint. The present invention also provides for groupings of binding elements and standardized binging objects organized based on industry need.
摘要翻译： 本发明提供了一种自动化，用户友好的构造和使用绑定对象的方式。 开发人员正在呈现并选择将最终用于创建用于在客户端和服务端点之间传输消息的运行时通信通道的绑定元素。 收到用户输入后，创建元数据，渠道工厂和监听工厂。 元数据描述绑定元素，并提供在运行时实现通信方面的协议栈的抽象表示。 通道工厂配置为在运行时使用元数据的集合来生成运行时通信通道。 此外，收听工厂被配置为接受运行时通信信道以解复用通信方面，以便在服务端点处理消息。 本发明还提供了基于行业需要组织的结合元件和标准化ing物的分组。
-
公开(公告)号：US20050198098A1
公开(公告)日：2005-09-08
申请号：US10783751
申请日：2004-02-20
申请人： David Levin , Erik Christensen , Saurab Nog , Donald Box , Christopher Kaler , Giovanni Della-Libera , Alfred Lee , David Wortendyke
发明人： David Levin , Erik Christensen , Saurab Nog , Donald Box , Christopher Kaler , Giovanni Della-Libera , Alfred Lee , David Wortendyke
IPC分类号： G06F15/16
CPC分类号： H04L41/0853 , H04L41/0873 , H04L67/141 , H04L69/03 , H04L69/24
摘要： A method includes advertising a policy characterizing communication properties supported by a node. The policy may be distributed to another node in response to a request for the policy. Policy expressions in the policy include one or more assertions that may be grouped and related to each other in a plurality of ways. A system includes a policy generator for generating at least one policy characterizing properties of a node. A policy retriever retrieves a policy from another node and a message generator generates a message to the other node, wherein the message conforms to the policy from the other node.
摘要翻译： 一种方法包括广告表征由节点支持的通信属性的策略。 响应于对策略的请求，该策略可以被分发到另一个节点。 策略中的策略表达式包括可以以多种方式彼此分组和相关的一个或多个断言。 系统包括用于生成节点的至少一个策略特性属性的策略生成器。 策略检索器从另一节点检索策略，并且消息生成器向另一个节点生成消息，其中消息符合来自另一个节点的策略。
-
公开(公告)号：US20050187979A1
公开(公告)日：2005-08-25
申请号：US10775760
申请日：2004-02-09
申请人： Erik Christensen , Kenneth Wolf , Michael Coulson , David Wortendyke , Douglas Walter , Mike Vernal
发明人： Erik Christensen , Kenneth Wolf , Michael Coulson , David Wortendyke , Douglas Walter , Mike Vernal
CPC分类号： H04L67/325 , G06F16/9574 , H04L67/02
摘要： A concept for providing a data structure handing process is described. The concept includes determining a size of a data structure, selecting a data streaming protocol when the size exceeds a predetermined limit and selecting a buffered data protocol otherwise.
摘要翻译： 描述了提供数据结构处理过程的概念。 该概念包括确定数据结构的大小，当尺寸超过预定限制时选择数据流协议，否则选择缓冲的数据协议。
-
公开(公告)号：US20050187947A1
公开(公告)日：2005-08-25
申请号：US10783343
申请日：2004-02-20
申请人： David Wortendyke , Umesh Madan , Geary Eppley
发明人： David Wortendyke , Umesh Madan , Geary Eppley
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
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.
摘要翻译： 反向查询引擎，它使用指令树来表示要针对输入应用的查询，而不是单独应用每个查询。 指令树中的每个节点表示可执行代码。 从根节点到终止分支节点执行时，指令树的每个分支表示要针对输入处理该查询的执行指令。 指令树是前向的，因为一旦根据输入处理树中的一个节点，与该节点相关联的可执行代码就不会再次被该节点处理。 因此，节省了处理资源和时间。
-
公开(公告)号：US20130191842A1
公开(公告)日：2013-07-25
申请号：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
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.
摘要翻译： 本发明扩展到用于在架构中使用单个供应主机的多租户架构中实现租户供应系统的方法，系统和计算机程序产品，以及在架构中的每个数据中心中的数据中心提供器。 配置主服务器接收用户请求以提供服务的租户，并将这些请求发送到适当的数据中心提供者。 多租户架构中的每个服务实现了一个公共接口，相应的数据中心提供者可以通过该接口获得从数据中心中部署的每个不同服务的负载的公共指示，从而便于选择提供租户的规模单元。 公共接口还使服务能够通过向提供主服务器注册端点地址来动态地注册（即不重新部署租户供应系统）与供应主设备作为多租户服务。
-
公开(公告)号：US07584170B2
公开(公告)日：2009-09-01
申请号：US11079164
申请日：2005-03-14
IPC分类号： G06F7/00
CPC分类号： G06F17/30569 , Y10S707/917 , Y10S707/957 , Y10S707/99932 , Y10S707/99937 , Y10S707/99954
摘要： A conversion method for converting numeric multi-dimensional database members to textual representations may be provided. The conversion may allow textual representations for the numeric dimension members to be sorted and converted back into numeric representations with accuracy. All numeric and date data may be transformed during conversion, such that the textual representation of the numeric and date data is properly sorted as a text string, in the same order as it would be sorted as a number. Accurate reverse-conversion (i.e., from textual representation to numeric representation) may also be provided. The reverse-conversion may include converting into text, information that may be necessary to support a precision required by the relevant convention of the numeric representation and a convention for determining the data type of the textual representations of values. The textual representation may be configured to sort by value independent of the numeric data-types.
摘要翻译： 可以提供用于将数字多维数据库成员转换为文本表示的转换方法。 转换可以允许数字维度成员的文本表示被排序并且精确地转换成数字表示。 所有数字和日期数据可以在转换期间被转换，使得数字和日期数据的文本表示被正确地排序为文本字符串，其顺序与将被排序为数字相同。 还可以提供精确的反向转换（即从文本表示到数字表示）。 反向转换可以包括转换为文本，可能必需的信息以支持数字表示的相关约定所要求的精度以及用于确定值的文本表示的数据类型的约定。 文本表示可以被配置为独立于数字数据类型的值排序。
-
-
-
-
-
-
-
-
-
搜索结果
43 条记录 (耗时 0.059 秒)
