fix(tier0): Fix Pinnedness Algorithm #83
Merged
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Summary
This PR refines the Pinnedness Algorithm used to select the starting node for multihop TRAPI→Dgraph queries. The fix ensures nodes with more-selective constraints (especially single IDs) are preferred.
Motivation
Previous pinnedness sometimes chose a less-constrained node when adjacency was dense.
Tests revealed cases where a node with an ID should have been the root but wasn’t.
The slow Dgraph query generated is below:
The fixed Dgraph query generated is below: