-
公开(公告)号:US11593398B2
公开(公告)日:2023-02-28
申请号:US17067479
申请日:2020-10-09
Applicant: Oracle International Corporation
Inventor: Iraklis Psaroudakis , Stefan Kaestle , Daniel J. Goodman , Jean-Pierre Lozi , Matthias Grimmer , Timothy L. Harris
Abstract: Adaptive data collections may include various type of data arrays, sets, bags, maps, and other data structures. A simple interface for each adaptive collection may provide access via a unified API to adaptive implementations of the collection. A single adaptive data collection may include multiple, different adaptive implementations. A system configured to implement adaptive data collections may include the ability to adaptively select between various implementations, either manually or automatically, and to map a given workload to differing hardware configurations. Additionally, hardware resource needs of different configurations may be predicted from a small number of workload measurements. Adaptive data collections may provide language interoperability, such as by leveraging runtime compilation to build adaptive data collections and to compile and optimize implementation code and user code together. Adaptive data collections may also provide language-independent such that implementation code may be written once and subsequently used from multiple programming languages.
-
公开(公告)号:US11593323B2
公开(公告)日:2023-02-28
申请号:US17370418
申请日:2021-07-08
Applicant: Oracle International Corporation
Inventor: Marco Arnaboldi , Jean-Pierre Lozi , Laurent Phillipe Daynes , Vlad Ioan Haprian , Shasank Kisan Chavan , Hugo Kapp , Sungpack Hong
IPC: G06F16/21 , G06F16/27 , G06F16/28 , G06F16/901 , G06F16/22
Abstract: Herein are techniques that concurrently populate entries in a compressed sparse row (CSR) encoding, of a type of edge of a heterogenous graph. In an embodiment, a computer obtains a mapping of a relational schema to a graph data model. The relational schema defines vertex tables that correspond to vertex types in the graph data model, and edge tables that correspond to edge types in the graph data model. Each edge type is associated with a source vertex type and a target vertex type. For each vertex type, a sequence of persistent identifiers of vertices is obtained. Based on the mapping and for a CSR representation of each edge type, a source array is populated that, for a same vertex ordering as the sequence of persistent identifiers for the source vertex type, is based on counts of edges of the edge type that originate from vertices of the source vertex type. For the CSR, the computer populates, in parallel and based on said mapping, a destination array that contains canonical offsets as sequence positions within the sequence of persistent identifiers of the vertices.
-
公开(公告)号:US20220129451A1
公开(公告)日:2022-04-28
申请号: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/22 , G06F16/25 , G06F16/2452
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.
-
公开(公告)号:US11250059B2
公开(公告)日:2022-02-15
申请号:US16738972
申请日:2020-01-09
Applicant: ORACLE INTERNATIONAL CORPORATION
Inventor: Arnaud Delamare , Vasileios Trigonakis , Jean-Pierre Lozi , Vlad Ioan Haprian , Petr Koupy , Hassan Chafi , Sungpack Hong
IPC: G06F16/00 , G06F16/901 , G06F16/2453 , G06F16/903 , G06F16/9032
Abstract: Techniques are described herein for early pruning of potential graph query results. Specifically, based on determining that property values of a path through graph data cannot affect results of a query, the path is pruned from a set of potential query solutions prior to fully exploring the path. Early solution pruning is performed on prunable queries that project prunable functions including MIN, MAX, SUM, and DISTINCT, the results of which are not tied to a number of paths explored for query execution. A database system implements early solution pruning for a prunable query based on intermediate results maintained for the query during query execution. Specifically, when a system determines that property values of a given potential solution path cannot affect the query results reflected in intermediate results maintained for the query, the path is discarded from the set of possible query solutions without further exploration of the path.
-
公开(公告)号:US20230214407A1
公开(公告)日:2023-07-06
申请号:US18174535
申请日:2023-02-24
Applicant: Oracle International Corporation
Inventor: Iraklis Psaroudakis , Stefan Kaestle , Daniel J. Goodman , Jean-Pierre Lozi , Matthias Grimmer , Timothy L. Harris
CPC classification number: G06F16/27 , G06F9/54 , G06F9/45558 , G06F9/45516 , G06F2009/45583 , G06F2009/4557 , G06F2009/45595
Abstract: Adaptive data collections may include various type of data arrays, sets, bags, maps, and other data structures. A simple interface for each adaptive collection may provide access via a unified API to adaptive implementations of the collection. A single adaptive data collection may include multiple, different adaptive implementations. A system configured to implement adaptive data collections may include the ability to adaptively select between various implementations, either manually or automatically, and to map a given workload to differing hardware configurations. Additionally, hardware resource needs of different configurations may be predicted from a small number of workload measurements. Adaptive data collections may provide language interoperability, such as by leveraging runtime compilation to build adaptive data collections and to compile and optimize implementation code and user code together. Adaptive data collections may also provide language-independent such that implementation code may be written once and subsequently used from multiple programming languages.
-
公开(公告)号: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.
-
公开(公告)号:US11500868B2
公开(公告)日:2022-11-15
申请号:US17162527
申请日:2021-01-29
Applicant: Oracle International Corporation
Inventor: Andrea Segalini , Jean-Pierre Lozi , Laurent Daynes , Marco Arnaboldi , Vlad Ioan Haprian , Hugo Kapp , Shasank Kisan Chavan , Zhen Hua Liu , Danica Porobic
IPC: G06F16/245 , G06F16/22 , G06F16/2453 , G06F16/2452 , G06F16/2455
Abstract: Vertex/edge table rows are mapped to unique integer identifiers, to enable construction of in-memory representation of a graph from existing, unmodified RDBMS tables. The unique integer identifiers are based on an encoding of primary key values of the table rows. The unique integer identifiers are used as graph indexes of the in-memory representation.
-
公开(公告)号:US20220245147A1
公开(公告)日:2022-08-04
申请号:US17162527
申请日:2021-01-29
Applicant: Oracle International Corporation
Inventor: Andrea Segalini , Jean-Pierre Lozi , Laurent Daynes , Marco Arnaboldi , Vlad Ioan Haprian , Hugo Kapp , Shasank Kisan Chavan , Zhen Hua Liu , Danica Porobic
IPC: G06F16/2453 , G06F16/2452 , G06F16/2455 , G06F16/22
Abstract: Techniques are provided for mapping vertex/edge table rows to unique integer identifiers, to enable construction of in-memory representation of a graph from existing, unmodified RDBMS tables. The unique integer identifiers are based on an encoding of primary key values of the table rows. The unique integer identifiers are used as graph indexes of the in-memory representation.
-
公开(公告)号:US20220129465A1
公开(公告)日:2022-04-28
申请号:US17080719
申请日: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/2455 , G06F16/2453
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.
-
10.
公开(公告)号:US20220129461A1
公开(公告)日:2022-04-28
申请号: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/901 , G06F16/2455
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.
-
-
-
-
-
-
-
-
-