Fig. 4

Toy example describing the matching process performed by TemporalRI. a A query Q, a target T and the values of all variables computed before starting the matching process, including compatibility domains Dom, ordering \(\mu\) and \({\mathcal {O}}\) of processing query nodes and edges, respectively, and sorted list qTimes of query timestamps. b Computational graph describing all steps performed by the algorithm during matching. Each node represent a state of the process and is annotated with the values of all the auxiliary variables described in Algorithm 3. Edges correspond to transitions from one state of the computation to another one. Numbers indicate the order in which transitions from one state to another one in the SST are done