When you query data while in the Graph View, a resolution algorithm navigates the relationships between data to return the correct values for the query's context. The resolution algorithm follows relationships both forwards and backwards. Arrows connecting nodes indicate the relationship direction.
The algorithm gives forward resolution higher priority than backward resolution. When there are no more forward transitions to resolve, the algorithm follows reverse transitions. The following provides examples of each type of resolution using three nodes: A, B, and C. Both A and C hold foreign key relationships to B.
Forward resolution: When you query node 'A', you have to select one or more records in node A that create a context. After you select, the algorithm follows the FK to table 'B' to return the values in table 'B' for the chosen context. When there are no more transitions to follow, the algorithm begins reverse resolution.
Reverse resolution: From 'B', the algorithm resolves backwards to 'C' and retrieves the FK value that fulfills this context.
Resolution will not exceed the 'Max. Nb. of resolved records' property value. When the number of records resolved would be greater than this value, resolution stops and the node displays with an unknown number of related records (indicated by '*' in the node label).