GRAPH DATABASE WITH ONE OR MORE INFRASTRUCTURE IMPARTED ASPECTS

• US 20150066989A1
• Filed: 08/28/2013
• Published: 03/05/2015
• Est. Priority Date: 08/28/2013
• Status: Active Grant

• Current Assignee: Bank of America Corp.
• Original Assignee: Bank of America Corp.
• Inventors: Yu, Sounil
• Granted Patent: US 9,218,438 B2
• Time in Patent Office: Days
• US Class Current: 707/798
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence
• CPC Class Codes: G06F 16/90335 Query processing

Abstract

Data specifying a new edge of a graph database may be received. A data store for storing the new edge may be identified from amongst a plurality of data stores utilized to store one or more portions of the graph database. Each of the plurality of data stores may be associated with a set of values corresponding to an aspect of edges of the graph database. The data store for storing the new edge may be identified based on the new edge being associated with a value corresponding to the aspect of edges of the graph database that is within a set of values corresponding to the aspect of edges of the graph database associated with the data store for storing the new edge.

Claims

1. A method, comprising:

at a computing platform comprising at least one processor, a memory, and a communication interface;

receiving, via the communication interface, data specifying a new edge of a graph database, wherein the data specifying the new edge of the graph database comprises information identifying a first node of the graph database and a second node of the graph database, the new edge associating the first node of the graph database with the second node of the graph database; and

identifying, by the at least one processor and from amongst a plurality of data stores utilized to store one or more portions of the graph database, a data store for storing the new edge, wherein each of the plurality of data stores is associated with a set of values corresponding to an aspect of edges of the graph database, and wherein the data store for storing the new edge is identified based on the new edge being associated with a value corresponding to the aspect of edges of the graph database that is within a set of values corresponding to the aspect of edges of the graph database associated with the data store for storing the new edge.

2. The method of claim 1, wherein the aspect of the edges of the graph database is a time when nodes of the graph database were associated with one another.

3. The method of claim 2, wherein the value corresponding to the aspect of edges of the graph database comprises a time when the first node of the graph database and the second node of the graph database were associated with one another, wherein the set of values corresponding to the aspect of edges of the graph database associated with the data store for storing the new edge comprises a time range, and wherein identifying the data store for storing the new edge comprises determining that the time when the first node of the graph database and the second node of the graph database were associated with each other is within the time range.

4. The method of claim 1, wherein the aspect of the edges of the graph database is a geographic location where nodes of the graph database were associated with one another.

5. The method of claim 4, wherein the value corresponding to the aspect of edges of the graph database comprises a geographic location where the first node of the graph database and the second node of the graph database were associated with one another, wherein the set of values corresponding to the aspect of edges of the graph database associated with the data store for storing the new edge comprises one or more geographic locations, and wherein identifying the data store for storing the new edge comprises determining that the geographic location where the first node of the graph database and the second node of the graph database were associated with each other is one of the one or more geographic locations.

6. The method of claim 1, wherein the plurality of data stores utilized to store one or more portions of the graph database comprises a plurality of distinct computing platforms, each of the plurality of distinct computing platforms being associated with a set of values corresponding to the aspect of edges of the graph database.

7. The method of claim 6, wherein the plurality of distinct computing platforms comprises at least two distinct physical computing platforms, each of the two distinct physical computing platforms being associated with a different set of values corresponding to the aspect of the edges of the graph database.

8. The method of claim 6, wherein the plurality of distinct computing platforms comprises at least two distinct virtual computing platforms, each of the two distinct virtual computing platforms being associated with a different set of values corresponding to the aspect of the edges of the graph database.

9. The method of claim 1, wherein each of the plurality of data stores is associated with an additional set of values corresponding to an additional aspect of edges of the graph database, and wherein the data store for storing the new edge is identified based on the new edge being associated with a value corresponding to the additional aspect of edges of the graph database that is within an additional set of values corresponding to the additional aspect of edges of the graph database associated with the data store for storing the new edge.

10. The method of claim 9, wherein the aspect of edges of the graph database and the additional aspect of edges of the graph database specify a common aspect of edges of the graph database, the additional aspect of edges of the graph database specifying the common aspect of edges of the graph database at a greater level of specificity than the aspect of edges of the graph database.

11. The method of claim 9, wherein the aspect of edges of the graph database and the additional aspect of edges of the graph database specify a different aspect of edges of the graph database.

12. The method of claim 11, wherein the aspect of the edges of the graph database is a time when nodes of the graph database were associated with one another, and wherein the additional aspect of the edges of the graph database is a geographic location where nodes of the graph database were associated with one another.

13. The method of claim 1, wherein the aspect of the edges of the graph database is a time when nodes of the graph database were associated with one another, wherein a set of values corresponding to the aspect of edges of the graph database that is associated with at least one data store of the plurality of data stores comprises a time range, the time range comprising one or more past times, the method comprising:

deleting one or more edges of the graph database stored by the at least one data store; and

altering the set of values to comprise a new time range, the new time range comprising one or more future times.

14. The method of claim 1, wherein the aspect of the edges of the graph database is a time when nodes of the graph database were associated with one another, wherein a set of values corresponding to the aspect of edges of the graph database that is associated with at least one data store of the plurality of data stores comprises a time range, the time range comprising one or more past times, and wherein the plurality of data stores utilized to store one or more portions of the graph database are associated with the graph database, the method comprising:

disassociating the at least one data store from the graph database; and

associating a new data store with the graph database, the new data store being associated with a set of values corresponding to the aspect of edges of the graph database, the set of values comprising a new time range, the new time range comprising one or more future times.

15. The method of claim 1, comprising querying the graph database based on the aspect of edges of the graph database.

16. The method of claim 15, comprising querying the graph database for a set of edges of the graph database that are associated with one or more values within a specified set of values corresponding to the aspect of edges of the graph database.

17. The method of claim 15, comprising:

identifying a portion of the plurality of data stores, each data store of the portion of the plurality of data stores being associated with a set of values corresponding to the aspect of edges of the graph database that includes at least one of the one or more values within the specified set of values; and

constraining querying of the graph database to the portion of the plurality of data stores.

18. The method of claim 15, comprising:

identifying a portion of the plurality of data stores, each data store of the portion of the plurality data stores being associated with a set of values corresponding to the aspect of edges of the graph database that fails to include a value within the specified set of values; and

excluding the portion of the plurality of data stores from querying of the graph database.

19. An apparatus, comprising:

at least one processor; and

a memory storing instructions that when executed by the at least one processor cause the apparatus to;

receive data specifying a new edge of a graph database, wherein the data specifying the new edge of the graph database comprises information identifying a first node of the graph database and a second node of the graph database, the new edge associating the first node of the graph database with the second node of the graph database;

identify, from amongst a plurality of data stores utilized to store one or more portions of the graph database, a data store for storing the new edge, wherein each of the plurality of data stores is associated with a set of values corresponding to an aspect of edges of the graph database, and wherein the data store for storing the new edge is identified based on the new edge being associated with a value corresponding to the aspect of edges of the graph database that is within a set of values corresponding to the aspect of edges of the graph database associated with the data store for storing the new edge; and

store the data specifying the new edge of the graph database in the data store.

20. One or more non-transitory computer-readable media having instructions stored thereon, that when executed by one or more computers, cause the one or more computers to:

receive data specifying a new edge of a graph database, wherein the data specifying the new edge of the graph database comprises information identifying a first node of the graph database and a second node of the graph database, the new edge associating the first node of the graph database with the second node of the graph database;

identify, from amongst a plurality of data stores utilized to store one or more portions of the graph database, a data store for storing the new edge, wherein each of the plurality of data stores is associated with a set of values corresponding to an aspect of edges of the graph database, and wherein the data store for storing the new edge is identified based on the new edge being associated with a value corresponding to the aspect of edges of the graph database that is within a set of values corresponding to the aspect of edges of the graph database associated with the data store for storing the new edge; and

create one or more data entries in the data store, the one or more data entries specifying the new edge of the graph database.