Identifying relationship instances between entities

A computing system method comprising:

• a relationship data store to store a time-varying data structure;
• a query engine communicatively coupled to the relationship data store, wherein the query engine is to:
• receive a first query specifying a first computing entity, a second computing entity, and a first window of time;
• query the time-varying data structure according to the first query to identify a set of relationship instances between the first computing entity and the second computing entity during the first window of time;
• receive a second query specifying a relationship instance of the set of relationship instances, wherein the relationship instance has an associated second window of time;
• and
• query the time-varying data structure according to the second query to identify a first set of computing entities having a relationship with an entity selected from a group consisting of:
• the first computing entity and the second computing entity during the second window of time;
• wherein querying the time-varying data structure according to the first query comprises:
• identifying a start of the first window of time in an adjacency list associated with the first computing entity;
• identifying, from the start of the first window of time, a first entry in the adjacency list that is within the first window of time;
• determining whether the first entry represents a relationship between the first computing entity and the second computing entity;
• and
• updating, based on determining that the first entry represents the relationship between the first computing entity and the second computing entity, the set of relationship instances associated with the first window of time.

A non-transitory computer-readable memory resource storing instructions that when executed cause at least one processing resource to:

• receive a query for information regarding a relationship between a first computing entity and a second computing entity during a window of time;
• query a data structure based on the query to identify a set of relationship instances between the first computing entity and the second computing entity during the window of time;
• and
• provide a representation of the first computing entity and the second computing entity
• as nodes and a representation of a relationship instance of the set of relationship instances as an edge extending between the nodes;
• wherein the instructions that cause the at least one processing resource to query the data structure comprise instructions that cause the at least one processing resource to:
• identify a start of the window of time in an adjacency list associated with the first computing entity;
• identify, from the start of the window of time, a first entry in the adjacency list that is within the window of time;
• determine whether the first entry represents a relationship between the first computing entity and the second computing entity;
• and
• update, based on determining that the first entry represents the relationship between the first computing entity and the second computing entity, the set of relationship instances based on the first entry.