公开(公告)号：US10671583B2

公开(公告)日：2020-06-02

申请号：US15684943

申请日：2017-08-24

Applicant: Oracle International Corporation

Inventor： Rajkumar Sen ,  Sam Idicula ,  Nipun Agarwal

IPC: G06F16/00 ,  G06F16/22 ,  G06F16/2453 ,  G06F9/30

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.

公开(公告)号：US10529049B2

公开(公告)日：2020-01-07

申请号：US15470673

申请日：2017-03-27

Applicant: Oracle International Corporation

Inventor： Venkatanathan Varadarajan ,  Arun Raghavan ,  Sam Idicula ,  Nipun Agarwal

IPC: G06T1/20 ,  G06T1/60 ,  G06K9/46

Abstract: Techniques are provided herein for generating an integral image of an input image in parallel across the cores of a multi-core processor. The input image is split into a plurality of tiles, each of which is stored in a scratchpad memory associated with a distinct core. At each tile, a partial integral image of the tile is first computed over the tile, using a Single-Pass Algorithm. This is followed by aggregating partial sums belonging to subsets of tiles using a 2D Inclusive Parallel Prefix Algorithm. A summation is finally performed over the aggregated partial sums to generate the integral image over the entire input image.

公开(公告)号：US09984081B2

公开(公告)日：2018-05-29

申请号：US14610892

申请日：2015-01-30

Applicant: Oracle International Corporation

Inventor： Danica Porobic ,  Sabina Petride ,  Sam Idicula

IPC: G06F17/30

CPC classification number: G06F17/30094 ,  G06F17/30129 ,  G06F17/30498 ,  G06F17/30979

Abstract: A method for distributing tables to a cluster of nodes managed by database management system (DBMS), is disclosed. Multiple data placement schemes are evaluated based on a query workload set to select a data placement scheme for the cluster of nodes. Tables, used in join operations in the workload set, are selected for evaluation of data placement schemes. Query execution costs for the workload set are generated based on estimating a query execution cost for each data placement scheme for the tables. The data placement scheme that has least costly estimated execution cost for the workload set is selected as the data placement scheme for the cluster of nodes managed by DBMS.

公开(公告)号：US09898545B2

公开(公告)日：2018-02-20

申请号：US14608029

申请日：2015-01-28

Applicant: Oracle International Corporation

Inventor： Sam Idicula ,  Nipun Agarwal ,  Ravi Murthy ,  Eric Sedlar

IPC: G06F15/173 ,  G06F17/30 ,  G06F12/02 ,  G06F12/0817 ,  G06F12/0831

CPC classification number: G06F17/30893 ,  G06F12/0246 ,  G06F12/0817 ,  G06F12/0833 ,  G06F17/30091 ,  G06F17/30595 ,  G06F2212/62 ,  G06F2212/622 ,  G06F2212/7204

Abstract: A method and apparatus for processing path-based database operations is provided. According to one aspect, a path cache is maintained. For each hierarchical node that is traversed during a path-determining operation, it is determined whether a cache entry corresponding to that node is already contained in the path cache. If such a cache entry is already contained in the path cache, then the path indicated in that cache entry is used to complete the pathname for the node for which the operation is being performed. As a result, hierarchically higher nodes do not need to be traversed to complete the operation. Alternatively, if such a cache entry is not already contained in the path cache, then a cache entry for the node currently being traversed is generated and inserted into the path cache for use in subsequent path-determining operations.

公开(公告)号：US09842148B2

公开(公告)日：2017-12-12

申请号：US14704825

申请日：2015-05-05

Applicant: Oracle International Corporation

Inventor： Gong Zhang ,  Sabina Petride ,  Boris Klots ,  Sam Idicula ,  Nipun Agarwal

IPC: G06F17/30

CPC classification number: G06F17/30545

Abstract: Herein is described a data placement scheme for a distributed query processing systems that achieves load balance amongst the nodes of the system. To identify a node on which to place particular data, a supervisor node performs a placement algorithm over the particular data's identifier, where the placement algorithm utilizes two or more hash functions. The supervisor node runs the placement algorithm until a destination node is identified that is available to store the data, or the supervisor node has run the placement algorithm an established number of times. If no available node is identified using the placement algorithm, then an available destination node is identified for the particular data and information identifying the data and the selected destination node is included in an exception map. Most data may be located by any node in the system based on the node performing the placement algorithm for the required data.

公开(公告)号：US20170351670A1

公开(公告)日：2017-12-07

申请号：US15684943

申请日：2017-08-24

Applicant: Oracle International Corporation

Inventor： Rajkumar Sen ,  Sam Idicula ,  Nipun Agarwal

IPC: G06F17/30 ,  G06F9/30

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.

公开(公告)号：US09813490B2

公开(公告)日：2017-11-07

申请号：US14711617

申请日：2015-05-13

Applicant: Oracle International Corporation

Inventor： Sam Idicula ,  Aarti Basant ,  Vikas Aggarwal ,  Stephan Wolf ,  Nipun Agarwal

IPC: G06F15/16 ,  H04L29/08 ,  H04L12/40 ,  G06F17/30 ,  H04L12/911

CPC classification number: H04L67/10 ,  G06F17/30545 ,  G06F17/30584 ,  H04L12/40143 ,  H04L47/828

Abstract: A method, apparatus, and system for efficiently re-partitioning data using scheduled network communication are provided. Given re-partitioning data defining the data blocks to be sent amongst a plurality of server nodes, a corresponding network schedule is determined to send the data blocks in a coordinated manner. The network schedule is divided into time slots, wherein each of the plurality of server nodes can send up to one data block and receive up to one data block in each time slot. By using a greedy selection algorithm that prioritizes by largest senders and largest receivers, a near optimal schedule can be determined even in the presence of heavy skew. The greedy selection algorithm can be implemented with a O(T*N^2) time complexity, enabling scaling to large multi-node clusters with many server nodes. The network schedule is of particular interest for database execution plans requiring re-partitioning on operators with different keys.

公开(公告)号：US09626402B2

公开(公告)日：2017-04-18

申请号：US13956356

申请日：2013-08-01

Applicant: Oracle International Corporation

Inventor： Rajkumar Sen ,  Sam Idicula ,  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, data compaction is performed using vectorized instructions to identify a shuffle mask based on matching bits and update an output array based on the shuffle mask and an input array. In a related technique, a hash table probe involves using vectorized instructions to determine whether each key in one or more hash buckets matches a particular input key.

公开(公告)号：US20160042086A1

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

申请号：US14886031

申请日：2015-10-17

Applicant: Oracle International Corporation

Inventor： Sam Idicula ,  Balasubramanyam Sthanikam ,  Nipun Agarwal

IPC: G06F17/30

CPC classification number: G06F3/0604 ,  G06F3/0631 ,  G06F3/0673 ,  G06F17/2247 ,  G06F17/2252 ,  G06F17/2258 ,  G06F17/30528 ,  G06F17/30896 ,  G06F17/30911 ,  G06F17/30938

Abstract: A method for storing XML documents a hybrid navigation/streaming format is provided to allow efficient storage and processing of queries on the XML data that provides the benefits of both navigation and streaming and ameliorates the disadvantages of each. Each XML document to be stored is independently analyzed to determine a combination of navigable and streamable storage format that optimizes the processing of the data for anticipated access patterns.

Abstract translation: 提供了一种用于存储混合导航/流格式的XML文档的方法，以便有效地存储和处理对XML数据的查询，从而提供导航和流媒体的优点，并且改善每个XML的缺点。 要存储的每个XML文档被独立分析以确定可导航和可流式存储格式的组合，其优化用于预期访问模式的数据的处理。

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