中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

17 records (took 0.028 seconds)

    Pushdown of sorting and set operations (union, intersection, minus) to a large number of low-power cores in a heterogeneous system
    13.
    发明授权
    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计算操作的一部分，并将结果返回到数据库系统。 如果关系的任何部分与数据库系统不同步，则数据库系统将执行操作以维护事务一致性。

    Estimating a cost of performing database operations using vectorized instructions
    14.
    发明授权
    Estimating a cost of performing database operations using vectorized instructions 有权
    使用向量化指令估计执行数据库操作的成本

    公开(公告)号：US09411842B2

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

    申请号：US13956357

    申请日：2013-08-01

    Applicant: Oracle International Corporation

    Inventor： Rajkumar Sen ,  Sam Idicula ,  Nipun Agarwal

    IPC: G06F15/80 ,  G06F17/30 ,  G06F9/30

    CPC classification number: G06F17/3033 ,  G06F9/30021 ,  G06F9/30032 ,  G06F9/30036 ,  G06F17/30466

    Abstract: Techniques for performing database operations using vectorized instructions are provided. In one technique, it is determined whether to perform a database operation using one or more vectorized instructions or without using any vectorized instructions. This determination may comprise estimating a first cost of performing the database operation using one or more vectorized instructions and estimating a second cost of performing the database operation without using any vectorized instructions. Multiple factors that may be used to determine which approach to follow, such as the number of data elements that may fit into a SIMD register, a number of vectorized instructions in the vectorized approach, a number of data movement instructions that involve moving data from a SIMD register to a non-SIMD register and/or vice versa, a size of a cache, and a projected size of a hash table.

    Abstract translation: 提供了使用向量化指令执行数据库操作的技术。 在一种技术中，确定是使用一个或多个矢量化指令执行数据库操作还是不使用任何矢量化指令。 该确定可以包括使用一个或多个向量化指令估计执行数据库操作的第一成本，并且估计在不使用任何向量化指令的情况下执行数据库操作的第二成本。 可以用于确定哪种方法的多个因素，诸如可以适合于SIMD寄存器的数据元素的数量，向量化方法中的多个向量化指令，涉及从 SIMD向非SIMD寄存器寄存器和/或反之亦然，高速缓存的大小以及散列表的投影大小。

    BUILDING A HASH TABLE USING VECTORIZED INSTRUCTIONS
    15.
    发明申请
    BUILDING A HASH TABLE USING VECTORIZED INSTRUCTIONS 审中-公开

    公开(公告)号：US20160117323A1

    公开(公告)日：2016-04-28

    申请号：US14990589

    申请日：2016-01-07

    Applicant: Oracle International Corporation

    Inventor： Rajkumar Sen ,  Nipun Agarwal

    IPC: G06F17/30

    CPC classification number: G06F17/3033 ,  G06F9/30021 ,  G06F9/30032 ,  G06F9/30036 ,  G06F17/30466

    Abstract: Techniques for performing database operations using vectorized instructions are provided. In one technique, a hash table build phase involves executing vectorized instructions to determine whether a bucket in a hash table includes a free slot for inserting a key. A number of data elements from the bucket are loaded in a register. A vectorized instruction is executed against the register may be used to determine a position, within the register, that contains the “smallest” data element. If the data element at that position is zero (or negative), then it is determined that the corresponding position in the bucket is an available slot for inserting a key and corresponding data value.

    Building a hash table using vectorized instructions
    16.
    发明授权
    Building a hash table using vectorized instructions 有权
    使用向量化指令构建哈希表

    公开(公告)号：US09256631B2

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

    申请号：US13956343

    申请日：2013-07-31

    Applicant: Oracle International Corporation

    Inventor： Rajkumar Sen ,  Nipun Agarwal

    IPC: G06F17/30 ,  G06F9/30

    CPC classification number: G06F17/3033 ,  G06F9/30021 ,  G06F9/30032 ,  G06F9/30036 ,  G06F17/30466

    Abstract: Techniques for performing database operations using vectorized instructions are provided. In one technique, a hash table build phase involves executing vectorized instructions to determine whether a bucket in a hash table includes a free slot for inserting a key. A number of data elements from the bucket are loaded in a register. A vectorized instruction is executed against the register may be used to determine a position, within the register, that contains the “smallest” data element. If the data element at that position is zero (or negative), then it is determined that the corresponding position in the bucket is an available slot for inserting a key and corresponding data value.

    Abstract translation: 提供了使用向量化指令执行数据库操作的技术。 在一种技术中，散列表构建阶段涉及执行向量化指令以确定散列表中的桶是否包括用于插入密钥的空闲时隙。 来自桶的多个数据元素被加载到寄存器中。 对寄存器执行的向量化指令可用于确定寄存器内包含“最小”数据元素的位置。 如果该位置的数据元素为零（否定），则确定桶中的对应位置是用于插入密钥和相应数据值的可用时隙。

    Pushdown Of Sorting And Set Operations (Union, Intersection, Minus) To A Large Number Of Low-Power Cores In A Heterogeneous System
    17.
    发明申请
    Pushdown Of Sorting And Set Operations (Union, Intersection, Minus) To A Large Number Of Low-Power Cores In A Heterogeneous System 有权
    在异质系统中对大量低功率核心的排序和设置操作（联合，交叉，减号）的下推

    公开(公告)号：US20140280037A1

    公开(公告)日：2014-09-18

    申请号：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计算操作的一部分，并将结果返回到数据库系统。 如果关系的任何部分与数据库系统不同步，则数据库系统将执行操作以维护事务一致性。

Patent Agency Ranking