公开(公告)号：US20250139474A1

公开(公告)日：2025-05-01

申请号：US18544899

申请日：2023-12-19

Applicant: Oracle International Corporation

Inventor： Yasha Pushak ,  Ehsan Soltan Aghai ,  Hesam Fathi Moghadam ,  Sungpack Hong ,  Hassan Chafi

IPC: G06N7/01 ,  G06N5/04

Abstract: A computer obtains multipliers of a sensitive feature. From an input that contains a value of the feature, a probability of a class is inferred. Based on the value of the feature in the input, one of the multipliers of the feature is selected. The multiplier is specific to both of the feature and the value of the feature. The input is classified based on a multiplicative product of the probability of the class and the multiplier that is specific to both of the feature and the value of the feature. In an embodiment, a black-box tri-objective optimizer generates multipliers on a three-way Pareto frontier from which a user may interactively select a combination of multipliers that provides a best three-way tradeoff between fairness and accuracy. The optimizer has three objectives to respectively optimize three distinct validation metrics that may, for example, be accuracy, fairness, and favorable outcome rate decrease.

公开(公告)号：US20250094224A1

公开(公告)日：2025-03-20

申请号：US18369254

申请日：2023-09-18

Applicant: Oracle International Corporation

Inventor： Calin Iorgulescu ,  Martin Kucera ,  Vasileios Trigonakis ,  Arnaud Delamare ,  Petr Koupy ,  Jinsu Lee ,  Sungpack Hong ,  Hassan Chafi

IPC: G06F9/50 ,  G06F9/48

Abstract: A resource manager tracks the amount of available memory for a cluster of machines and for each machine in the cluster. The resource manager receives a reservation request from a job for a graph processing operation. The reservation request specifies an identification of the job, a type of reservation, and an amount of memory requested. The resource manager determines whether to grant the reservation request based on the type of reservation, the amount of memory requested, and the amount of available memory in the cluster or in one or more machines in the cluster. In response to determining to grant the reservation request, the resource manager sends a response to the job indicating an amount of memory reserved and adjusts the amount of available cluster memory and the amount of available machine memory for at least one machine in the cluster based on the amount of memory reserved.

公开(公告)号：US20240394557A1

公开(公告)日：2024-11-28

申请号：US18202472

申请日：2023-05-26

Applicant: Oracle International Corporation

Inventor： Yasha Pushak ,  Mobina Mahdavi ,  Ali Asgari Khoshouyeh ,  Ali Seyfi ,  Zahra Zohrevand ,  Ritesh Ahuja ,  Moein Owhadi Kareshk ,  Hesam Fathi Moghadam ,  Sungpack Hong ,  Hassan Chafi

IPC: G06N20/00

Abstract: In an embodiment, a computer combines first original hyperparameters and second original hyperparameters into combined hyperparameters. In each iteration of a binary search that selects hyperparameters, these are selected: a) important hyperparameters from the combined hyperparameters and b) based on an estimated complexity decrease by including only important hyperparameters as compared to the combined hyperparameters, which only one boundary of the binary search to adjust. For the important hyperparameters of a last iteration of the binary search that selects hyperparameters, a pruned value range of a particular hyperparameter is generated based on a first original value range of the particular hyperparameter for the first original hyperparameters and a second original value range of the same particular hyperparameter for the second original hyperparameters. To accelerate hyperparameter optimization (HPO), the particular hyperparameter is tuned only within the pruned value range to discover an optimal value for configuring and training a machine learning model.

公开(公告)号：US11989178B2

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

申请号：US17080700

申请日：2020-10-26

Applicant: Oracle International Corporation

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

IPC: G06F16/2453 ,  G06F16/2455 ,  G06F16/901

CPC classification number: G06F16/24537 ,  G06F16/24558 ,  G06F16/9024

Abstract: Techniques support graph pattern matching queries inside a relational database management system (RDBMS) that supports SQL execution. The techniques compile a graph pattern matching query into a SQL query that can then be executed by the relational engine. As a result, techniques enable execution of graph pattern matching queries on top of the relational engine by avoiding any change in the existing SQL engine.

公开(公告)号：US20230376366A1

公开(公告)日：2023-11-23

申请号：US17992743

申请日：2022-11-22

Applicant: Oracle International Corporation

Inventor： Ali Seyfi ,  Yasha Pushak ,  Sungpack Hong ,  Hesam Fathi Moghadam ,  Hassan Chafi

IPC: G06F11/00 ,  G06N20/00

CPC classification number: G06F11/006 ,  G06N20/00 ,  G06F2201/82

Abstract: The present invention relates to machine learning (ML) explainability (MLX). Herein are local explanation techniques for black box ML models based on coalitions of features in a dataset. In an embodiment, a computer receives a request to generate a local explanation of which coalitions of features caused an anomaly detector to detect an anomaly. During unsupervised generation of a new coalition, a first feature is randomly selected from features in a dataset. Which additional features in the dataset can join the coalition, because they have mutual information with the first feature that exceeds a threshold, is detected. For each feature that is not in the coalition, values of the feature are permuted in imperfect copies of original tuples in the dataset. An average anomaly score of the imperfect copies is measured. Based on the average anomaly score of the imperfect copies, a local explanation is generated that references (e.g. defines) the coalition.

公开(公告)号：US20230267120A1

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

申请号：US17585146

申请日：2022-01-26

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/2453

CPC classification number: G06F16/24539

Abstract: Techniques described herein allow a user of an RDBMS to specify a graph algorithm function (GAF) that takes a graph object as input and returns a logical graph object as output. GAFs are used within graph queries to compute temporary and output properties (“GAF-computed properties”), which are live for the duration of the query cursor execution. GAF-computed output properties are accessible in the enclosing graph pattern matching query as though they were part of the input graph object of the GAF. Temporary cursor-duration tables are generated for the query cursor during compilation of a graph query that includes a GAF, and are used to store the GAF-computed properties. Each temporary table corresponds to one of the primary tables of the input graph, and includes, as a foreign key, primary key information from the corresponding primary table. Thus, the input graph of a GAF may be a “heterogeneous” graph.

公开(公告)号：US20230095703A1

公开(公告)日：2023-03-30

申请号：US17479006

申请日：2021-09-20

Applicant: Oracle International Corporation

Inventor： Bence Czipo ,  Vlad Ioan Haprian ,  Oskar Van Rest ,  Damien Hilloulin ,  Vasileios Trigonakis ,  Yahya Ez-zainabi ,  Sungpack Hong ,  Hassan Chafi

IPC: G06F16/23 ,  G06F11/07

Abstract: Efficiently implemented herein is a deterministic semantic for property updates by graph queries. Mechanisms of determinism herein ensure data consistency for graph mutation. These mechanisms facilitate optimistic execution of graph access despite a potential data access conflict. This approach may include various combinations of special activities such as detecting potential conflicts during query compile time, applying query transformations to eliminate those conflicts during code generation where possible, and executing updates in an optimistic way that safely fails if determinism cannot be guaranteed. In an embodiment, a computer receives a request to modify a graph. The request to modify the graph is optimistically executed after preparation and according to safety precautions as presented herein. Based on optimistically executing the request, a data access conflict actually occurs and is automatically detected. Based on the data access conflict, optimistically executing the request is prematurely and automatically halted without finishing executing the request.

公开(公告)号：US11537609B2

公开(公告)日：2022-12-27

申请号：US16917621

申请日：2020-06-30

Applicant: Oracle International Corporation

Inventor： Martijn Dwars ,  Martin Sevenich ,  Sungpack Hong ,  Guido Wachsmuth ,  Hassan Chafi

IPC: G06F16/2455 ,  G06F16/2453 ,  G06F16/901 ,  G06F16/248

Abstract: To execute function-step-based graph queries on a graph engine that has its own graph query language, rather than re-implementing an existing infrastructure to support function-step-based graph protocols, function-step-based graph queries are transformed to the graph query language that is understood by the graph engine. The existing infrastructure computes the results of the transformed queries. Result sets are then transformed to function-based-based result sets, which are returned to customers. In this manner, the graph engine supports function-step-based graph query workloads without implementation of the function-step-based graph protocol.

公开(公告)号：US11531652B2

公开(公告)日：2022-12-20

申请号：US16556847

申请日：2019-08-30

Applicant: Oracle International Corporation

Inventor： Pit Fender ,  Harshad Kasture ,  Alexander Ulrich ,  Benjamin Schlegel ,  Matthias Brantner ,  Hassan Chafi

IPC: G06F16/21

Abstract: Herein are techniques that extend a software system to embed new guest programing languages (GPLs) that interoperate in a transparent, modular, and configurable way. In embodiments, a computer inserts an implementation of a GPL into a deployment of the system. A command registers the GPL, define subroutines for the GPL, generates a guest virtual environment, and adds a binding of a dependency to a guest module. In an embodiment, a native programing language invokes a guest programing language to cause importing intra- or inter-language dependencies. An embodiment defines a guest object that is implemented in a first GPL and accessed from a second GPL. In an embodiment, dependencies are retrieved from a virtual file system having several alternative implementation mechanisms that include: an archive file or an actual file system, and a memory buffer or a column of a database table.

公开(公告)号：US20220391392A1

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

申请号：US17889712

申请日：2022-08-17

Applicant: Oracle International Corporation

Inventor： Pit Fender ,  Alexander Ulrich ,  Laurent Daynes ,  Matthias Brantner ,  Bastian Hossbach ,  Benjamin Schlegel ,  Hassan Chafi

IPC: G06F16/2453 ,  G06F16/2455 ,  G06F8/41

Abstract: The present invention relates to execution optimization of database queries. Herein are techniques for optimal execution based on query interpretation by translation to a domain specific language (DSL), with optimizations such as partial evaluation, abstract syntax tree (AST) rewriting, just in time (JIT) compilation, dynamic profiling, speculative logic, and Futamura projection. In an embodiment, a database management system (DBMS) that is hosted on a computer generates a query tree that represents a database query that contains an expression that is represented by a subtree of the query tree. The DBMS generates a sequence of DSL instructions that represents the subtree. The sequence of DSL instructions is executed to evaluate the expression during execution of the database query. In an embodiment, an AST is generated from the sequence of DSL instructions. In an embodiment, the DSL AST is optimally rewritten based on a runtime feedback loop that includes dynamic profiling information.