Patents by Inventor Ciprian Baetu

Ciprian Baetu has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Hybrid in-memory BFS-DFS approach for computing graph queries involving complex path patterns including trees and cycles inside relational database systems
    Patent number: 11397732
    Abstract: An in-memory graph query runtime is integrated inside a database management system and is capable of performing simple patter-matching queries against homogeneous graphs. The runtime efficiently combines breadth-first (BFS) and depth-first (DFS) neighbor traversal algorithms to achieve a hybrid runtime that takes the best from both sides. As a result, the hybrid runtime is able to process arbitrarily large queries with a fixed amount of memory, optimizing for memory locality.
    Type: Grant
    Filed: December 11, 2019
    Date of Patent: July 26, 2022
    Assignee: Oracle International Corporation
    Inventors: Vlad Haprian, Laurent Daynes, Shasank K. Chavan, Jean-Pierre Lozi, Vasileios Trigonakis, Sungpack Hong, Marco Arnaboldi, Ciprian Baetu
  • Hybrid in-memory BFS-DFS approach for computing graph queries against heterogeneous graphs inside relational database systems
    Patent number: 11392623
    Abstract: An in-memory graph query runtime is integrated inside a database management system and is capable of performing simple patter-matching queries against homogeneous graphs. The runtime efficiently combines breadth-first (BFS) and depth-first (DFS) neighbor traversal algorithms to achieve a hybrid runtime that takes the best from both sides. As a result, the hybrid runtime is able to process arbitrarily large queries with a fixed amount of memory, optimizing for memory locality.
    Type: Grant
    Filed: December 11, 2019
    Date of Patent: July 19, 2022
    Assignee: Oracle International Corporation
    Inventors: Vlad Haprian, Laurent Daynes, Shasank K. Chavan, Jean-Pierre Lozi, Vasileios Trigonakis, Sungpack Hong, Marco Arnaboldi, Ciprian Baetu
  • Hybrid in-memory BFS-DFS approach for computing graph queries against homogeneous graphs inside relational database systems
    Patent number: 11392624
    Abstract: An in-memory graph query runtime is integrated inside a database management system and is capable of performing simple patter-matching queries against homogeneous graphs. The runtime efficiently combines breadth-first (BFS) and depth-first (DFS) neighbor traversal algorithms to achieve a hybrid runtime that takes the best from both sides. As a result, the hybrid runtime is able to process arbitrarily large queries with a fixed amount of memory, optimizing for memory locality.
    Type: Grant
    Filed: December 11, 2019
    Date of Patent: July 19, 2022
    Assignee: Oracle International Corporation
    Inventors: Vlad Haprian, Laurent Daynes, Shasank K. Chavan, Jean-Pierre Lozi, Vasileios Trigonakis, Sungpack Hong, Marco Arnaboldi, Ciprian Baetu
  • HYBRID IN-MEMORY BFS-DFS APPROACH FOR COMPUTING GRAPH QUERIES AGAINST HETEROGENEOUS GRAPHS INSIDE RELATIONAL DATABASE SYSTEMS
    Publication number: 20210182315
    Abstract: An in-memory graph query runtime is integrated inside a database management system and is capable of performing simple patter-matching queries against homogeneous graphs. The runtime efficiently combines breadth-first (BFS) and depth-first (DFS) neighbor traversal algorithms to achieve a hybrid runtime that takes the best from both sides. As a result, the hybrid runtime is able to process arbitrarily large queries with a fixed amount of memory, optimizing for memory locality.
    Type: Application
    Filed: December 11, 2019
    Publication date: June 17, 2021
    Inventors: Vlad Haprian, Laurent Daynes, Shasank K. Chavan, Jean-Pierre Lozi, Vasileios Trigonakis, Sungpack Hong, Marco Arnaboldi, Ciprian Baetu
  • HYBRID IN-MEMORY BFS-DFS APPROACH FOR COMPUTING GRAPH QUERIES INVOLVING COMPLEX PATH PATTERNS INCLUDING TREES AND CYCLES INSIDE RELATIONAL DATABASE SYSTEMS
    Publication number: 20210182285
    Abstract: An in-memory graph query runtime is integrated inside a database management system and is capable of performing simple patter-matching queries against homogeneous graphs. The runtime efficiently combines breadth-first (BFS) and depth-first (DFS) neighbor traversal algorithms to achieve a hybrid runtime that takes the best from both sides. As a result, the hybrid runtime is able to process arbitrarily large queries with a fixed amount of memory, optimizing for memory locality.
    Type: Application
    Filed: December 11, 2019
    Publication date: June 17, 2021
    Inventors: Vlad Haprian, Laurent Daynes, Shasank K. Chavan, Jean-Pierre Lozi, Vasileios Trigonakis, Sungpack Hong, Marco Arnaboldi, Ciprian Baetu
  • HYBRID IN-MEMORY BFS-DFS APPROACH FOR COMPUTING GRAPH QUERIES AGAINST HOMOGENEOUS GRAPHS INSIDE RELATIONAL DATABASE SYSTEMS
    Publication number: 20210182316
    Abstract: An in-memory graph query runtime is integrated inside a database management system and is capable of performing simple patter-matching queries against homogeneous graphs. The runtime efficiently combines breadth-first (BFS) and depth-first (DFS) neighbor traversal algorithms to achieve a hybrid runtime that takes the best from both sides. As a result, the hybrid runtime is able to process arbitrarily large queries with a fixed amount of memory, optimizing for memory locality.
    Type: Application
    Filed: December 11, 2019
    Publication date: June 17, 2021
    Inventors: Vlad Haprian, Laurent Daynes, Shasank K. Chavan, Jean-Pierre Lozi, Vasileios Trigonakis, Sungpack Hong, Marco Arnaboldi, Ciprian Baetu