×

Computing architecture for storing a graph database based on temporal aspects of its edges

  • US 9,218,438 B2
  • Filed: 08/28/2013
  • Issued: 12/22/2015
  • Est. Priority Date: 08/28/2013
  • Status: Active Grant
First Claim
Patent Images

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 and comprising information identifying a first node of the graph database and a second node of the graph database, the new edge associating the first node with the second node;

    identifying, by the at least one processor, from amongst a plurality of data stores utilized to store one or more portions of the graph database, and based on a time when an element represented by the first node was associated with an element represented by the second node, a data store for storing the new edge, each data store of the plurality of data stores being associated with a time range corresponding to when elements represented by nodes of the graph database associated by edges of the graph database stored in the data store were associated with one another, and the data store for storing the new edge being associated with a time range comprising the time;

    deleting, by the at least one processor, one or more edges of the graph database stored by a data store of the plurality of data stores associated with a time range comprising one or more past times;

    altering, by the at least one processor, the time range comprising the one or more past times to comprise one or more future times; and

    querying, by the at least one processor, the graph database for one or more values associated with a specified time range.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×