利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

37 条记录 (耗时 0.018 秒)

    Distributed authentication, authorization and accounting
    1.
    发明授权
    Distributed authentication, authorization and accounting 失效
    分布式认证，授权和会计

    公开(公告)号：US08763088B2

    公开(公告)日：2014-06-24

    申请号：US12518636

    申请日：2007-12-12

    申请人： Roy Liang Chua ,  Sean Joseph Convery ,  Andrew Keith Pearce ,  Ashish Thusoo

    发明人： Roy Liang Chua ,  Sean Joseph Convery ,  Andrew Keith Pearce ,  Ashish Thusoo

    IPC分类号： H04L9/32 ,  H04L29/06

    CPC分类号： H04L63/08 ,  H04L63/0823 ,  H04L63/083 ,  H04L63/0892 ,  H04L63/104 ,  H04L63/20

    摘要： In some embodiments, computer systems, storage mediums, and methods are provided for controlling a connecting device's access to a plurality of computer networks. In other embodiments, the provided computer systems, storage mediums, and methods may provide for authentication, authorization, and accounting of connecting devices connecting to a plurality of computer networks. In other embodiments, the provided computer systems, storage mediums, and methods may provide for the distribution of authentication routing data and authorization policies among a plurality of computer networks. In yet other embodiments, the provided computer systems, storage mediums, and methods may provide for the distribution of accounting among a plurality of computer networks.

    摘要翻译： 在一些实施例中，提供了计算机系统，存储介质和方法，用于控制连接设备对多个计算机网络的访问。 在其他实施例中，所提供的计算机系统，存储介质和方法可以提供连接到多个计算机网络的连接设备的认证，授权和记帐。 在其他实施例中，提供的计算机系统，存储介质和方法可以在多个计算机网络之间提供认证路由数据和授权策略的分发。 在其他实施例中，所提供的计算机系统，存储介质和方法可以在多个计算机网络之间提供计费分配。

    Aggregate functions in DML returning clause
    2.
    发明授权
    Aggregate functions in DML returning clause 有权
    DML返回子句中的聚合函数

    公开(公告)号：US08108443B2

    公开(公告)日：2012-01-31

    申请号：US10662095

    申请日：2003-09-12

    申请人： Ashish Thusoo

    发明人： Ashish Thusoo

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

    CPC分类号： G06F17/30412 ,  G06F17/30365 ,  Y10S707/954

    摘要： A statement is provided having a clause that can specify an aggregate function that is performed on a set of data. The statement may alter the data in the data set by deleting or updating the data. The clause may be a returning clause that accepts one or more aggregate functions for its arguments, operates on the set of data, and returns the result of the aggregate function without returning the entire set of data. Alternatively, a statement is provided for changing multiple sets of data without the need to place the multiple sets in a single array.

    摘要翻译： 提供了一个语句，该语句具有可以指定对一组数据执行的聚合函数的子句。 该语句可以通过删除或更新数据来更改数据集中的数据。 该子句可以是一个返回子句，它接受一个或多个聚合函数的参数，对该数据集进行操作，并返回聚合函数的结果，而不返回整个数据集。 或者，提供了用于更改多组数据的语句，而不需要将多个集合放置在单个数组中。

    Mechanism for efficiently evaluating operator trees
    8.
    发明授权
    Mechanism for efficiently evaluating operator trees 有权
    有效评估操作树的机制

    公开(公告)号：US07603347B2

    公开(公告)日：2009-10-13

    申请号：US10944171

    申请日：2004-09-16

    申请人： Ashish Thusoo ,  Ravi Murthy ,  Sivasankaran Chandrasekar ,  Eric Sedlar ,  Nipun Agarwal

    发明人： Ashish Thusoo ,  Ravi Murthy ,  Sivasankaran Chandrasekar ,  Eric Sedlar ,  Nipun Agarwal

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30917 ,  G06F17/30911 ,  Y10S707/99934

    摘要： An XPath expression is converted into a tree-based representation where each node represents an operation to be performed and the links between nodes in the tree represent the flow of data between operations. The conversion may involve creating a parse tree for the XPath expression, and then converting the parse tree into an operator tree. The operator tree is constructed in such a way that execution of the XPath expression begins at the leaf nodes of the operator tree, and the results are then passed up the tree. After each node is executed, the results are either (1) passed to a filter that filters the results with a predicate statement or (2) passed to another node to be operated upon. This occurs until no nodes remain to be executed.

    摘要翻译： XPath表达式被转换为基于树的表示，其中每个节点表示要执行的操作，并且树中的节点之间的链接表示操作之间的数据流。 转换可能涉及为XPath表达式创建解析树，然后将解析树转换为运算符树。 运算符树的构造方式是在运算符树的叶节点处开始执行XPath表达式，然后将结果传递给树。 在执行每个节点后，结果将被传递给过滤器的过滤器，该过滤器使用谓词语句或（2）传递给另一个要运行的节点的结果。 直到没有节点保持执行才发生。