中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

38 records (took 0.023 seconds)

    Pushdown of sorting and set operations (union, intersection, minus) to a large number of low-power cores in a heterogeneous system
    21.
    发明授权
    Pushdown of sorting and set operations (union, intersection, minus) to a large number of low-power cores in a heterogeneous system 有权
    在异构系统中对大量低功耗核心进行排序和设置操作（union，intersection，minus）的下推

    公开(公告)号：US09135301B2

    公开(公告)日：2015-09-15

    申请号：US13831279

    申请日：2013-03-14

    Applicant: Oracle International Corporation

    Inventor： Sabina Petride ,  Sam Idicula ,  Rajkumar Sen ,  Nipun Agarwal

    IPC: G06F17/30

    CPC classification number: G06F17/30442 ,  G06F17/30306 ,  G06F17/30463 ,  G06F17/30595

    Abstract: A system and method for performing a query operation on a pair of relations in a database system coupled to a heterogeneous system (HS) is disclosed. Assuming that that pair of relations is partitioned and already loaded into the HS, the database system receives a query on the pair of relations and based on the type of query operation computes the cost of performing the query operation on the database alone or the costs of performing the query operation with the assistance of the HS, each of the costs corresponding to a particular algorithm. If the costs indicate that the HS improves the performance of the query operation, then the HS computes portions of the operation, and returns the results back to the database system. If any parts of the relation are out of sync with the database system, the database system performs operations to maintain transactional consistency.

    Abstract translation: 公开了一种用于对耦合到异构系统（HS）的数据库系统中的一对关系执行查询操作的系统和方法。 假设该对关系被分割并已经加载到HS中，则数据库系统接收关于该对关系的查询，并且基于查询操作的类型来计算对数据库执行查询操作的成本或单独的成本 在HS的帮助下执行查询操作，每个成本对应于特定算法。 如果成本表明HS提高了查询操作的性能，则HS计算操作的一部分，并将结果返回到数据库系统。 如果关系的任何部分与数据库系统不同步，则数据库系统将执行操作以维护事务一致性。

    Bitmap-based count distinct query rewrite in a relational SQL algebra
    23.
    发明授权
    Bitmap-based count distinct query rewrite in a relational SQL algebra 有权

    公开(公告)号：US11379476B2

    公开(公告)日：2022-07-05

    申请号：US16653639

    申请日：2019-10-15

    Applicant: Oracle International Corporation

    Inventor： Sabina Petride ,  Mohamed Ziauddin ,  Praveen T. J. Kumar ,  Huagang Li ,  Andrew Witkowski ,  Sankar Subramanian

    IPC: G06F16/00 ,  G06F16/2453 ,  G06F16/22 ,  G06F16/23 ,  G06F16/242

    Abstract: Techniques are described for storing and maintaining, in a materialized view, bitmap data that represents a bitmap of each possible distinct value of an expression and rewriting a query for a count of distinct values of the expression using the materialized view. The materialized view contains bitmap data that represents a bitmap of each possible distinct value of a first expression, and aggregate values of additional expressions, and is stored in memory or on disk by a database system. The database system receives a query that requests a number of distinct values, of the first expression, and an aggregate value for an additional expression. In response, the database system, rewrites the query to: compute the number of distinct values by counting the bits in the bitmap data of the materialized view that are set to the first value, and obtains the aggregate value for the additional expression in the materialized view.

    Distributed relational dictionaries
    24.
    发明授权
    Distributed relational dictionaries 有权

    公开(公告)号：US10810195B2

    公开(公告)日：2020-10-20

    申请号：US15861212

    申请日：2018-01-03

    Applicant: Oracle International Corporation

    Inventor： Anantha Kiran Kandukuri ,  Seema Sundara ,  Sam Idicula ,  Pit Fender ,  Nitin Kunal ,  Sabina Petride ,  Georgios Giannikis ,  Nipun Agarwal

    IPC: G06F17/00 ,  G06F16/2453 ,  H04L29/08 ,  G06F16/22 ,  G06F16/174 ,  G06F40/242 ,  G06F16/23

    Abstract: Techniques related to distributed relational dictionaries are disclosed. In some embodiments, one or more non-transitory storage media store a sequence of instructions which, when executed by one or more computing devices, cause performance of a method. The method involves generating, by a query optimizer at a distributed database system (DDS), a query execution plan (QEP) for generating a code dictionary and a column of encoded database data. The QEP specifies a sequence of operations for generating the code dictionary. The code dictionary is a database table. The method further involves receiving, at the DDS, a column of unencoded database data from a data source that is external to the DDS. The DDS generates the code dictionary according to the QEP. Furthermore, based on joining the column of unencoded database data with the code dictionary, the DDS generates the column of encoded database data according to the QEP.

    SPARSE DICTIONARY TREE
    25.
    发明申请
    SPARSE DICTIONARY TREE 审中-公开

    公开(公告)号：US20190155925A1

    公开(公告)日：2019-05-23

    申请号：US15819891

    申请日：2017-11-21

    Applicant: Oracle International Corporation

    Inventor： Georgios Giannikis ,  Seema Sundara ,  Sabina Petride ,  Nipun Agarwal

    IPC: G06F17/30

    Abstract: Techniques related to a sparse dictionary tree are disclosed. In some embodiments, computing device(s) execute instructions, which are stored on non-transitory storage media, for performing a method. The method comprises storing an encoding dictionary as a token-ordered tree comprising a first node and a second node, which are adjacent nodes. The token-ordered tree maps ordered tokens to ordered codes. The ordered tokens include a first token and a second token. The ordered codes include a first code and a second code, which are non-consecutive codes. The first node maps the first token to the first code. The second node maps the second token to the second code. The encoding dictionary is updated based on inserting a third node between the first node and the second node. The third node maps a third token to a third code that is greater than the first code and less than the second code.

    DATA RECOVERY FOR A COMPUTE NODE IN A HETEROGENEOUS DATABASE SYSTEM
    26.
    发明申请
    DATA RECOVERY FOR A COMPUTE NODE IN A HETEROGENEOUS DATABASE SYSTEM 有权
    数据恢复在异构数据库系统中的计算机节点

    公开(公告)号：US20160292037A1

    公开(公告)日：2016-10-06

    申请号：US14675497

    申请日：2015-03-31

    Applicant: Oracle International Corporation

    Inventor： Anantha Kiran Kandukuri ,  Sabina Petride

    IPC: G06F11/14 ,  G06F17/30

    CPC classification number: G06F11/1402 ,  G06F11/00 ,  G06F11/1448 ,  G06F11/1458 ,  G06F11/1658 ,  G06F11/2046 ,  G06F17/30575 ,  G06F2201/80

    Abstract: Data recovery for a compute node in a heterogeneous database system is provided. A failure is detected of a particular compute node of a compute cluster comprising a plurality of compute nodes. The compute cluster is configured to store, in memory, data stored by a RDBMS. Particular data of the data stored by the RDBMS is identified that is assigned to the particular compute node. The particular compute node is restored. After restoring the particular compute node, the particular data assigned to the particular compute node is reloaded without taking the particular data offline. During reloading, the particular compute node receives pending modified data comprising data of the particular data that was modified during said reloading.

    Abstract translation: 提供异构数据库系统中计算节点的数据恢复。 检测到包括多个计算节点的计算集群的特定计算节点的故障。 计算集群配置为在内存中存储由RDBMS存储的数据。 识别由RDBMS存储的数据的特定数据，分配给特定的计算节点。 特定的计算节点被还原。 在还原特定的计算节点之后，重新加载分配给特定计算节点的特定数据，而不使特定数据脱机。 在重新加载期间，特定的计算节点接收等待修改的数据，包括在所述重新加载期间被修改的特定数据的数据。

    Efficient file access in a large repository using a two-level cache
    27.
    发明授权
    Efficient file access in a large repository using a two-level cache 有权
    使用两级缓存在大型存储库中高效地进行文件访问

    公开(公告)号：US09256607B2

    公开(公告)日：2016-02-09

    申请号：US13692014

    申请日：2012-12-03

    Applicant: Oracle International Corporation

    Inventor： Sam Idicula ,  Sabina Petride ,  Bhushan Khaladkar ,  Nipun Agarwal

    IPC: G06F7/00 ,  G06F17/00 ,  G06F17/30 ,  G06F12/08

    CPC classification number: G06F17/30097 ,  G06F12/0811 ,  G06F12/084 ,  G06F17/30929

    Abstract: A two-level cache to facilitate resolving resource path expressions for a hierarchy of resources is described, which includes a system-wide shared cache and a session-level cache. The shared cache is organized as a hierarchy of hash tables that mirrors the structure of a repository hierarchy. A particular hash table in a shared cache includes information for the child resources of a particular resource. A database management system that manages a shared cache may control the amount of memory used by the cache by implementing a replacement policy for the cache based on one or more characteristics of the resources in the repository. The session-level cache is a single level cache in which information for target resources of resolved path expressions may be tracked. In the session-level cache, the resource information is associated with the entire path expression of the associated resource.

    Abstract translation: 描述了用于促进解决资源层级的资源路径表达式的两级缓存，其包括系统范围共享高速缓存和会话级缓存。 共享缓存被组织为映射存储库层次结构的散列表的层次结构。 共享缓存中的特定哈希表包括特定资源的子资源的信息。 管理共享高速缓存的数据库管理系统可以基于存储库中的资源的一个或多个特性来实现对高速缓存的替换策略来控制高速缓存所使用的存储器量。 会话级缓存是单级缓存，其中可以跟踪解析的路径表达式的目标资源的信息。 在会话级缓存中，资源信息与相关资源的整个路径表达式相关联。

    PROBING A HASH TABLE USING VECTORIZED INSTRUCTIONS
    29.
    发明申请
    PROBING A HASH TABLE USING VECTORIZED INSTRUCTIONS 有权
    使用VECTORIZED指令来检测一张表

    公开(公告)号：US20150039627A1

    公开(公告)日：2015-02-05

    申请号：US13956350

    申请日：2013-07-31

    Applicant: Oracle International Corporation

    Inventor： Rajkumar Sen ,  Sabina Petride ,  Nipun Agarwal

    IPC: G06F17/30

    CPC classification number: G06F17/3033

    Abstract: Techniques for performing database operations using vectorized instructions are provided. In one technique, a hash table probe phase involves executing vectorized instructions to determine where in a bucket a particular key is located. This determination may be preceded by one or more vectorized instructions that are used to determine whether the bucket contains the particular key.

    Abstract translation: 提供了使用向量化指令执行数据库操作的技术。 在一种技术中，散列表探测阶段涉及执行向量化指令以确定特定密钥位于桶中的哪里。 该确定之前可以是用于确定桶是否包含特定密钥的一个或多个向量化指令。

Patent Agency Ranking