公开(公告)号：US11921785B2

公开(公告)日：2024-03-05

申请号：US17584262

申请日：2022-01-25

Applicant: Oracle International Corporation

Inventor： Hugo Kapp ,  Laurent Daynes ,  Vlad Ioan Haprian ,  Jean-Pierre Lozi ,  Zhen Hua Liu ,  Marco Arnaboldi ,  Sabina Petride ,  Andrew Witkowski ,  Hassan Chafi ,  Sungpack Hong

IPC: G06F16/901 ,  G06F16/903

CPC classification number: G06F16/9024 ,  G06F16/90335

Abstract: Techniques described herein allow a user of an RDBMS to specify a graph algorithm function (GAF) declaration, which defines a graph algorithm that takes a graph object as input and returns a logical graph object as output. A database dictionary stores the GAF declaration, which allows addition of GAFs without changing the RDBMS kernel. GAFs are used within graph queries to compute output properties of property graph objects. Output properties are accessible in the enclosing graph pattern matching query, and are live for the duration of the query cursor execution. According to various embodiments, the declaration of a GAF includes a DESCRIBE function, used for semantic analysis of the GAF, and an EXECUTE function, which defines the operations performed by the GAF. Furthermore, composition of GAFs in a graph query is done by supplying, as the input graph argument of an outer GAF, the result of an inner GAF.

公开(公告)号：US20230252077A1

公开(公告)日：2023-08-10

申请号：US17584262

申请日：2022-01-25

Applicant: Oracle International Corporation

Inventor： Hugo Kapp ,  Laurent Daynes ,  Vlad Ioan Haprian ,  Jean-Pierre Lozi ,  Zhen Hua Liu ,  Marco Arnaboldi ,  Sabina Petride ,  Andrew Witkowski ,  Hassan Chafi ,  Sungpack Hong

IPC: G06F16/901 ,  G06F16/903

CPC classification number: G06F16/9024 ,  G06F16/90335

Abstract: Techniques described herein allow a user of an RDBMS to specify a graph algorithm function (GAF) declaration, which defines a graph algorithm that takes a graph object as input and returns a logical graph object as output. A database dictionary stores the GAF declaration, which allows addition of GAFs without changing the RDBMS kernel. GAFs are used within graph queries to compute output properties of property graph objects. Output properties are accessible in the enclosing graph pattern matching query, and are live for the duration of the query cursor execution. According to various embodiments, the declaration of a GAF includes a DESCRIBE function, used for semantic analysis of the GAF, and an EXECUTE function, which defines the operations performed by the GAF. Furthermore, composition of GAFs in a graph query is done by supplying, as the input graph argument of an outer GAF, the result of an inner GAF.

公开(公告)号：US11429606B2

公开(公告)日：2022-08-30

申请号：US16726597

申请日：2019-12-24

Applicant: ORACLE INTERNATIONAL CORPORATION

Inventor： Sabina Petride ,  Mohamed Ziauddin ,  Praveen T.J. Kumar

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

Abstract: Techniques are provided for bitmap-based computation of a COUNT(DISTINCT) function, where the bitmaps are generated based on ranks of target expression values. According to an embodiment, the ranks are computed using the DENSE_RANK function. The bitmaps may be maintained in a materialized view. Bitmap data that represents the ranks for target expression values occurring in data for a given group is divided across multiple bucket bitmaps, each corresponding to a distinct sub-range of the ranks. According to an embodiment, target expression value ranks are computed relative to partitions of the target expression values. When these partitions correspond to a subset (not necessarily strict) of the target query grouping keys for a query rewrite, the resulting bitmaps allow computation of multiple levels of aggregation from the single set of bitmaps.

公开(公告)号：US11126626B2

公开(公告)日：2021-09-21

申请号：US16272829

申请日：2019-02-11

Applicant: Oracle International Corporation

Inventor： Sabina Petride ,  Sam Idicula ,  Nipun Agarwal

IPC: G06F16/2455

Abstract: A system and method for processing a group and aggregate query on a relation are disclosed. A database system determines whether assistance of a heterogeneous system (HS) of compute nodes is beneficial in performing the query. Assuming that the relation has been partitioned and loaded into the HS, the database system determines, in a compile phase, whether the HS has the functional capabilities to assist, and whether the cost and benefit favor performing the operation with the assistance of the HS. If the cost and benefit favor using the assistance of the HS, then the system enters the execution phase. The database system starts, in the execution phase, an optimal number of parallel processes to produce and consume the results from the compute nodes of the HS. After any needed transaction consistency checks, the results of the query are returned by the database system.

公开(公告)号：US20180157710A1

公开(公告)日：2018-06-07

申请号：US15368345

申请日：2016-12-02

Applicant: Oracle International Corporation

Inventor： Shenoda Guirguis ,  Sabina Petride

IPC: G06F17/30

CPC classification number: G06F16/24545 ,  G06F16/27

Abstract: Techniques are presented herein for efficient query processing and data change propagation at a secondary database system. The techniques involve determining execution costs for executing a query at a primary DBMS and for executing the query at an offload DBMS. The cost for executing the query at the offload DBMS includes the cost of propagating changes to database objects required by the query to the offload DBMS. Based on the execution cost, the query is sent to either the primary DBMS or the offload DBMS.

公开(公告)号：US20160328456A1

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

申请号：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.

Abstract translation: 这里描述了在系统的节点之间实现负载平衡的分布式查询处理系统的数据放置方案。 为了识别放置特定数据的节点，管理员节点对特定数据的标识符执行放置算法，其中放置算法利用两个或更多个散列函数。 管理员节点运行放置算法，直到识别到可用于存储数据的目标节点，或者管理员节点已经建立了放置算法已建立的次数。 如果使用放置算法没有识别可用节点，则识别特定数据的可用目的地节点，并且识别数据的信息和所选择的目的地节点被包括在异常映射中。 大多数数据可以由系统中的任何节点基于执行所需数据的放置算法的节点来定位。

公开(公告)号：US20160292049A1

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

申请号：US14675490

申请日：2015-03-31

Applicant: Oracle International Corporation

Inventor： Anantha Kiran Kandukuri ,  Sabina Petride

IPC: G06F11/14 ,  G06F17/30

CPC classification number: G06F11/1469 ,  G06F11/00 ,  G06F11/1451 ,  G06F11/1471 ,  G06F11/2023 ,  G06F11/2074 ,  G06F11/2094 ,  G06F17/30595 ,  G06F2201/80

Abstract: A method and apparatus for data recovery for a RDBMS instance in a heterogeneous database system is provided. A failure of a first RDBMS instance is detected in a plurality of RDBMS instances of a shared-disk database system. A compute cluster is configured to store, in memory, one or more tables stored by the shared-disk database system. The first RDBMS instance is configured to modify the one or more tables stored by the shared-disk database system and transfer modified data to the compute cluster to update the one or more tables at the compute cluster. After detecting the failure of the first RDBMS instance, redo records generated by the first RDBMS instance are scanned, pending modified data that was not transferred to the compute cluster before the failure is identified, and the pending modified data is transferred to the compute cluster.

Abstract translation: 提供了用于异构数据库系统中的RDBMS实例的数据恢复的方法和装置。 在共享磁盘数据库系统的多个RDBMS实例中检测到第一RDBMS实例的故障。 计算集群配置为在内存中存储由共享磁盘数据库系统存储的一个或多个表。 第一个RDBMS实例被配置为修改由共享磁盘数据库系统存储的一个或多个表，并将修改的数据传输到计算集群，以更新计算集群中的一个或多个表。 在检测到第一个RDBMS实例的故障之后，将扫描由第一个RDBMS实例生成的重做记录，在发现故障之前尚未传输到计算集群的待修改数据，并将待处理的修改数据传输到计算集群。

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