Hybrid graph and relational database architecture

Patent metadata

Field	Value
Publication number	US-2020175071-A1
Application number	US-201816203861-A
Country	US
Kind code	A1
Filing date	Nov 29, 2018
Priority date	Nov 29, 2018
Publication date	Jun 4, 2020
Grant date	—

Abstract

Aspects of the disclosure relate to searching a dual database graph. The dual database graph is resident on a dual database graph platform. The platform includes two or more nodes interconnected by one or more edges. The graph database stores graph data corresponding to the graph(s) and a relational database for storing metadata corresponding to the graph(s). The method includes receiving as input a search criterion. The search criterion may include a plurality of data points corresponding to a relational database node profile or a relational database subgraph profile. The platform may search the relational database for a subset of graphs that each includes a relational database node or a relational database subgraph that matches the node profile or subgraph profile of the search criterion. The platform may then retrieve a relational database node or a relational database subgraph that matches the node profile or subgraph profile.

First claim

What is claimed is:

1 . A dual database graph search platform, said platform comprising:
a set of one or more graphs, at least one graph from said set of graphs comprising two or more nodes interconnected by one or more edges; and a graph database for storing graph data corresponding to the one or more graphs; a relational database for storing metadata corresponding to the one or more graphs; and a set of computer executable code, said computer executable code that, when run on a processor, is configured to:
receive as input a search criterion, said search criterion being one or more data points corresponding to a relational database node profile or a relational database subgraph profile;
search the relational database for a subset of graphs that each includes a relational database node or a relational database subgraph that matches the relational database node profile or relational database subgraph profile of the search criterion; and
retrieve a relational database node or a relational database subgraph that matches the node profile or subgraph profile of the search criterion.

2 . The platform of claim 1 , wherein the set of computer executable code is further configured to create and store one or more historical versions of the one or more graphs in the relational database.

3 . The platform of claim 2 , wherein the set of computer executable code is further configured to revert the one or more graphs to one or more historical versions of the one or more graphs stored in the relational database.

4 . The platform of claim 1 , wherein the set of computer executable code is further configured to store one or more reference tables corresponding to the one or more graphs in the relational database.

5 . The platform of claim 1 , wherein the receiving the search criterion comprises receiving a search criterion via a user interface (“UI”) module and converting said search criterion into the relational database node profile or the relational database subgraph profile.

6 . The platform of claim 1 , wherein each node of each graph in the set of graphs comprises an event, said event that is defined by a predetermined set of properties.

7 . The platform of claim 1 , wherein the metadata comprises data involving the entire one or more graphs.

8 . A method for searching a dual database graph, wherein the dual database graph is resident on a dual database graph platform, includes two or more nodes interconnected by one or more edges, a graph database for storing graph data corresponding to the one or more graphs and a relational database for storing metadata corresponding to the one or more graphs, the method comprising:
receiving as input a search criterion, said search criterion being a plurality of data points corresponding to a relational database node profile or a relational database subgraph profile; searching the relational database for a subset of graphs that each includes a relational database node or a relational database subgraph that matches the node profile or subgraph profile of the search criterion; and retrieving relational database node or a relational database subgraph that matches the node profile or subgraph profile of the search criterion.

9 . The method of claim 8 further comprising creating and storing one or more historical versions of the dual database graph in the relational database.

10 . The method of claim 9 , wherein the set of computer executable code is further configured to revert the one or more graphs to one or more historical versions of the dual database graph stored in the relational database.

11 . The method of claim 8 , wherein the set of computer executable code is further configured to store one or more reference tables corresponding to the dual database graph in the relational database.

12 . The method of claim 8 , the receiving the search criterion comprising converting the search criterion into the relational database node profile or the relational database subgraph profile.

13 . The method of claim 8 , wherein each node of the dual database graph comprises an event, said event that is defined by a predetermined set of properties.

14 . The method of claim 8 , wherein the metadata comprises data involving the entire dual database graph.

15 . A dual database graph search platform, said platform comprising:
a set of one or more graphs, at least one graph from said set of graphs comprising two or more nodes interconnected by one or more edges; a graph database for storing graph data corresponding to the one or more graphs; a relational database for storing metadata corresponding to the one or more graphs; and a set of computer executable code, said computer executable code that, when run on a processor, is configured to:
create and store one or more historical versions of the one or more graphs in the relational database; and
receive as input a search criterion via a user interface (“UI”) module, said search criterion being expressed as one or more data points corresponding to a relational database node profile or a relational database subgraph profile.

16 . The platform of claim 15 , wherein the executable code is further configured to:
search the relational database for a subset of graphs that each includes a relational database node or a relational database subgraph that matches the node profile or subgraph profile of the search criterion; and retrieve a relational database node or a relational database subgraph that matches the node profile or subgraph profile of the search criterion.

17 . The platform of claim 15 , wherein the set of computer executable code is further configured to revert the one or more graphs to one or more historical versions of the one or more graphs stored in the relational database.

18 . The platform of claim 15 , wherein the set of computer executable code is further configured to store one or more reference tables corresponding to the one or more graphs in the relational database.

19 . The platform of claim 15 , wherein the receiving the search criterion comprises receiving a search criterion via the user interface (“UI”) module and converting said search criterion into the relational database node profile or the relational database subgraph profile.

20 . The platform of claim 15 , wherein each node of each graph in the set of graphs comprises an event, said event that is defined by a predetermined set of properties.

21 . The platform of claim 15 , wherein the metadata comprises data involving the entire one or more graphs.

Assignees

• Bank Of America

Inventors

• Ogrinz Michael
• Linn Heather

Classifications

• G06F16/9024 Primary

  Graphs; Linked lists (G06F16/9027 takes precedence) · CPC title

• G06F16/245

  Query processing · CPC title

• G06F16/284

  Relational databases · CPC title

• G06F16/2423

  Interactive query statement specification based on a database schema · CPC title

• G06F16/219

  Managing data history or versioning (querying versioned data G06F16/2474; querying temporal data G06F16/2477) · CPC title