中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

17 records (took 0.024 seconds)

    DYNAMIC GROUPING OF IN-MEMORY DATA PROCESSING OPERATIONS
    1.
    发明申请
    DYNAMIC GROUPING OF IN-MEMORY DATA PROCESSING OPERATIONS 审中-公开

    公开(公告)号：US20180357331A1

    公开(公告)日：2018-12-13

    申请号：US15616777

    申请日：2017-06-07

    Applicant: Oracle International Corporation

    Inventor： Jian Wen ,  Sam Idicula ,  Nitin Kunal ,  Negar Koochakzadeh ,  Seema Sundara ,  Thomas Chang ,  Aarti Basant ,  Nipun Agarwal ,  Farhan Tauheed

    IPC: G06F17/30 ,  G06F9/48

    CPC classification number: G06F16/90335 ,  G06F9/48

    Abstract: Techniques are described herein for grouping of operations in local memory of a processing unit. The techniques involve adding a first operation for a first leaf operator of a query execution plan to a first pipelined group. The query execution plan includes a set of leaf operators and a set of non-leaf operators. Each leaf operator of the set of one or more leaf operators has a respective parent non-leaf operator and each non-leaf operator has one or more child operators from among the set of leaf operators or others of the set of non-leaf operators. The techniques further involve determining a memory requirement of executing the first operation for the first leaf operator and executing a second operation for the respective parent non-leaf operator of the first leaf operator. The output of the first operation is input to the second operation. The techniques further involve determining whether the memory requirement is satisfied by an amount of local memory. If it is determined that the memory requirement is satisfied by the amount of local memory the second operation for the respective parent non-leaf operator is added to the first pipelined group. The techniques further involve assigning the first pipelined group to a first thread and the first thread executing the first pipelined group. Executing the first pipelined group involves: storing first output of the first operation in the local memory of the first thread; using the first output as input for the second operation; storing second output of the second operation in the local memory; and moving second output from the local memory to a tier of memory different than the local memory relative to the first thread.

    PROPAGATING USER IDENTITIES IN A SECURE FEDERATED SEARCH SYSTEM
    3.
    发明申请
    PROPAGATING USER IDENTITIES IN A SECURE FEDERATED SEARCH SYSTEM 有权
    在安全的联合搜索系统中传播用户标识

    公开(公告)号：US20140046978A1

    公开(公告)日：2014-02-13

    申请号：US14060635

    申请日：2013-10-23

    Applicant: Oracle International Corporation

    Inventor： Muralidhar Krishnaprasad ,  Sachin Bhatkar ,  Visar Nimani ,  Thomas Chang ,  Meeten Bhavsar

    IPC: G06F17/30

    CPC classification number: G06F17/30477 ,  G06F17/30427 ,  H04L63/0815

    Abstract: A method of implementing a universal framework for searching across multiple search platforms in a secure federated search. The method includes receiving, at a federated broker, a query from an authorized user, obtaining a plurality of user credentials associated with the authenticated user, wherein each of the plurality of user credentials are used to access at least one source of a plurality of sources, determining a required query format for each of the plurality of sources, translating the query into a plurality of queries formatted according to the required query format of each of the plurality of sources, propagating the plurality of translated queries and the plurality of user credentials to each corresponding source to appear to each corresponding source to be the authorized user, receiving, at the federated broker, results of each of the plurality of queries from each source of the plurality of sources, and consolidating the results of each of the plurality of queries to be displayed in a uniform manner.

    Abstract translation: 一种在安全联合搜索中实现跨多个搜索平台搜索的通用框架的方法。 该方法包括在联合经纪人处接收来自授权用户的查询，获得与经认证的用户相关联的多个用户凭证，其中多个用户证书中的每一个用于访问多个源的至少一个源 确定所述多个源中的每个源的所需查询格式，将所述查询转换成根据所述多个源中的每一个的所需查询格式格式化的多个查询，将所述多个翻译查询和所述多个用户凭证传播到 每个对应的源将每个对应的源显示为授权用户，在联合代理处接收来自多个源的每个源的多个查询中的每一个的结果，并且合并多个查询中的每一个的结果 以均匀的方式显示。

    Secure search performance improvement
    8.
    发明授权
    Secure search performance improvement 有权
    安全的搜索性能提升

    公开(公告)号：US08725770B2

    公开(公告)日：2014-05-13

    申请号：US13676592

    申请日：2012-11-14

    Applicant: Oracle International Corporation

    Inventor： Hiroshi Koide ,  Mark Ture ,  Muralidhar Krishnaprasad ,  Mark Davis ,  Cindy Hsin ,  Meeten Bhavsar ,  Steve Yang ,  Visar Nimani ,  Hui Ouyang ,  Sachin Bhatkar ,  Thomas Chang ,  Thomas Baby ,  David Liao

    IPC: G06F17/30

    CPC classification number: G06F21/6218 ,  G06F21/6236 ,  H04L63/0815

    Abstract: A flexible and extensible architecture allows for secure searching across an enterprise. Such an architecture can provide a simple Internet-like search experience to users searching secure content inside (and outside) the enterprise. The architecture allows for the crawling and searching of a variety or of sources across an enterprise, regardless of whether any of these sources conform to a conventional user role model. The architecture further allows for security attributes to be submitted at query time, for example, in order to provide real-time secure access to enterprise resources. The user query also can be transformed to provide for dynamic querying that provides for a more current result list than can be obtained for static queries.

    Abstract translation: 灵活可扩展的架构允许跨企业进行安全搜索。 这样的架构可以为在企业内部（和外部）搜索安全内容的用户提供简单的类似Internet的搜索体验。 该架构允许在整个企业中爬行和搜索各种或各种源，而不管这些源是否符合常规用户角色模型。 该体系结构进一步允许在查询时提交安全属性，例如为了提供对企业资源的实时安全访问。 用户查询也可以被转换以提供动态查询，其提供比静态查询可获得的更多当前结果列表。

    Dynamic grouping of in-memory data processing operations
    9.
    发明授权
    Dynamic grouping of in-memory data processing operations 有权

    公开(公告)号：US10366124B2

    公开(公告)日：2019-07-30

    申请号：US15616777

    申请日：2017-06-07

    Applicant: Oracle International Corporation

    Inventor： Jian Wen ,  Sam Idicula ,  Nitin Kunal ,  Negar Koochakzadeh ,  Seema Sundara ,  Thomas Chang ,  Aarti Basant ,  Nipun Agarwal ,  Farhan Tauheed

    IPC: G06F17/30 ,  G06F16/903 ,  G06F9/48

    Abstract: Techniques are described herein for grouping of operations in local memory of a processing unit. The techniques involve adding a first operation for a first leaf operator of a query execution plan to a first pipelined group. The query execution plan includes a set of leaf operators and a set of non-leaf operators. Each leaf operator of the set of one or more leaf operators has a respective parent non-leaf operator and each non-leaf operator has one or more child operators from among the set of leaf operators or others of the set of non-leaf operators. The techniques further involve determining a memory requirement of executing the first operation for the first leaf operator and executing a second operation for the respective parent non-leaf operator of the first leaf operator. The output of the first operation is input to the second operation. The techniques further involve determining whether the memory requirement is satisfied by an amount of local memory. If it is determined that the memory requirement is satisfied by the amount of local memory the second operation for the respective parent non-leaf operator is added to the first pipelined group. The techniques further involve assigning the first pipelined group to a first thread and the first thread executing the first pipelined group. Executing the first pipelined group involves: storing first output of the first operation in the local memory of the first thread; using the first output as input for the second operation; storing second output of the second operation in the local memory; and moving second output from the local memory to a tier of memory different than the local memory relative to the first thread.

Patent Agency Ranking