公开(公告)号：US12271402B2

公开(公告)日：2025-04-08

申请号：US17808083

申请日：2022-06-21

Applicant: Oracle International Corporation

Inventor： Florian Gratzer ,  Oskar Van Rest ,  Vlad Ioan Haprian ,  Vasileios Trigonakis ,  Korbinian Schmid ,  Steven Serra ,  Sungpack Hong ,  Hassan Chafi

IPC: G06F16/29 ,  G06F16/21 ,  G06F16/242

Abstract: A method, apparatus, and product to provide a parser for property graph queries with precise error reporting and auto-completion based on information from property graph schemas. The approach generally comprises analysis of graph queries prior to their execution to identify issues prior to execution. In some embodiments, the approach includes any of: use of a property graph schema to determine whether names in a received property graph query exist within a corresponding property graph; determining whether the property graph query includes a comparison of mismatched data types; providing an autocomplete suggestion feature for assistance in resolving errors or corresponding to a cursor position within a query string; or evaluation of a property graph query to determine whether it would return an empty result. In some embodiments, property graph query analysis is performed using a context aware approach.

公开(公告)号：US20250094862A1

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

申请号：US18529182

申请日：2023-12-05

Applicant: Oracle International Corporation

Inventor： Yasha Pushak ,  Mathieu Godbout ,  Hesam Fathi Moghadam ,  Sungpack Hong ,  Hassan Chafi

IPC: G06N20/00

Abstract: In an embodiment, a computer generates a respective original inference from each of many records. Permuted values are selected for a feature from original values of the feature. Based on the permuted values for the feature, a permuted inference is generated from each record. Fairness and accuracy of the original and permuted inferences are measured. For each of many features, the computer measures a respective impact on fairness of a machine learning model, and a respective impact on accuracy of the machine learning model. A global explanation of the machine learning model is generated and presented based on, for multiple features, the impacts on fairness and accuracy. Based on the global explanation, an interactive indication to exclude or include a particular feature is received. The machine learning model is (re-)trained based on the interactive indication to exclude or include the particular feature, which may increase the fairness of the model.

公开(公告)号：US12174831B2

公开(公告)日：2024-12-24

申请号：US18073629

申请日：2022-12-02

Applicant: Oracle International Corporation

Inventor： Tomáš Faltín ,  Vasileios Trigonakis ,  Sungpack Hong ,  Hassan Chafi

IPC: G06F16/245 ,  G06F16/2453 ,  G06F16/901

Abstract: A graph processing system is provided for executing scouting queries for improving query planning. A query planner creates a plurality of scouting queries, each scouting query in the plurality of scouting queries corresponding to a query plan for a graph query and having an associated confidence value. A graph processing system performs limited execution of the plurality of scouting queries and determines a metric value for each scouting query in the plurality of scouting queries based on execution of the scouting query. The system determines a score for each scouting query in the plurality of scouting queries based on its metric value and the confidence value of the corresponding query plan and selects a query plan based on the scores of the plurality of scouting queries. The system executes the graph query based on the selected query plan.

公开(公告)号：US11947539B2

公开(公告)日：2024-04-02

申请号：US17750339

申请日：2022-05-21

Applicant: ORACLE INTERNATIONAL CORPORATION

Inventor： Vasileios Trigonakis ,  Calin Iorgulescu ,  Tomas Faltin ,  Sungpack Hong ,  Hassan Chafi

IPC: G06F16/00 ,  G06F9/48 ,  G06F16/2453 ,  G06F16/27 ,  G06F16/901

CPC classification number: G06F16/24542 ,  G06F9/4881 ,  G06F16/27 ,  G06F16/9024

Abstract: Techniques to efficiently assign available workers to executing multiple graph queries concurrently on a distributed graph database are disclosed. The techniques comprise a runtime engine assigning multiple workers to executing portions of multiple graph queries, each worker in each assignment asynchronously executing a portion of a graph query within a parallel-while construct that includes return statements at different locations, and the runtime engine reassigning a worker to executing another portion of the same or a different graph query to optimize the overall performance of all workers.

公开(公告)号：US11720630B2

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

申请号：US17141018

申请日：2021-01-04

Applicant: Oracle International Corporation

Inventor： Arnaud Delamare ,  Vasileios Trigonakis ,  Yahya Ez-Zainabi ,  Sungpack Hong ,  Hassan Chafi

IPC: G06F16/901

CPC classification number: G06F16/9024 ,  G06F16/9027

Abstract: Techniques are provided for finding unused vertex and edge identifiers (IDs) in a distributed graph engine. A run-time data structure may be built during the loading of the graph. The data structure identifies unavailable IDs that are associated with graph entities of the graph. The data structure is traversed to determine one or more ranges of free IDs. Unused IDs are generated from the ranges.

公开(公告)号：US11720562B2

公开(公告)日：2023-08-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/24 ,  G06F16/2453 ,  G06F16/2455 ,  G06F8/41

CPC classification number: G06F16/24542 ,  G06F8/427 ,  G06F8/4443 ,  G06F16/2455

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.

公开(公告)号：US11567932B2

公开(公告)日：2023-01-31

申请号：US17080698

申请日：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/242 ,  G06F16/2455 ,  G06F16/2452 ,  G06F16/25 ,  G06F16/22

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.

公开(公告)号：US11461130B2

公开(公告)日：2022-10-04

申请号：US16883317

申请日：2020-05-26

Applicant: Oracle International Corporation

Inventor： Petr Koupy ,  Vasileios Trigonakis ,  Iraklis Psaroudakis ,  Jinsoo Lee ,  Sungpack Hong ,  Hassan Chafi

IPC: G06F9/48 ,  G06F9/448 ,  G06F16/901 ,  G06F11/07 ,  G06F9/38

Abstract: In an embodiment, a computer of a cluster of computers receives graph logic that specifies a sequence of invocations, including a current invocation and a next invocation, of parallelism operations that can detect whether the graph logic should prematurely terminate. The computer initiates, on the computers of the cluster, execution of the graph logic to process a distributed graph. Before the current invocation, the graph logic registers reversion logic for a modification of the distributed graph that execution of the graph logic has caused. During the current invocation, it is detected that the graph logic should prematurely terminate. Execution of the graph logic on the cluster is terminated without performing the next invocation in the sequence of invocations. The reversion logic reverses the modification of the distributed graph to restore consistency. The distributed graph is retained in volatile memory of the cluster for reuse such as relaunch of the graph logic.

公开(公告)号：US20220284056A1

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

申请号：US17194165

申请日：2021-03-05

Applicant: Oracle International Corporation

Inventor： Damien Hilloulin ,  Vasileios Trigonakis ,  Alexander Weld ,  Valentin Venzin ,  Sungpack Hong ,  Hassan Chafi

IPC: G06F16/901 ,  G06F16/22

Abstract: Techniques are provided for updating in-memory property graphs in a fast manner, while minimizing memory consumption. A graph is represented as delta compressed sparse rows (CSR), in which its data structure stores forward edge offsets that map reverse edges to forward edges, enabling fast traversals of graph edges in forward and reverse directions. To support fast graph updates, delta logs are used to store changes to the graph. In an embodiment, a base version of the graph data structure is initially loaded or created, and subsequent versions of the graph are created from the reference to the initial graph and a delta log data structure that records the changes compared to the base version of the graph.

公开(公告)号：US11363093B2

公开(公告)日：2022-06-14

申请号：US15968637

申请日：2018-05-01

Applicant: Oracle International Corporation

Inventor： Jinsu Lee ,  Thomas Manhardt ,  Sungpack Hong ,  Petr Koupy ,  Hassan Chafi ,  Vasileios Trigonakis

IPC: H04L29/08 ,  G06F16/901 ,  H04L67/10

Abstract: Techniques are described herein for evaluating graph processing tasks using a multi-stage pipelining communication mechanism. In a multi-node system comprising a plurality of nodes, each node of said plurality of nodes executes a respective communication agent object. The respective communication agent object comprises: a sender lambda function is configured to perform sending operations and generate source messages based on the sender operations. An intermediate lambda function is configured to read source messages marked for a node, perform intermediate operations based on the source messages and generate intermediate messages based on the intermediate operations. A final receiver lambda function configured to: read intermediate messages marked for said each node, perform final operations based on the intermediate messages and generate a final result based on the final operations.