Traverse relations graph right to left when checking relations#103
Merged
Traverse relations graph right to left when checking relations#103
Conversation
Codecov ReportAttention: Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## main #103 +/- ##
==========================================
+ Coverage 93.11% 93.17% +0.06%
==========================================
Files 18 18
Lines 1307 1304 -3
Branches 161 160 -1
==========================================
- Hits 1217 1215 -2
Misses 64 64
+ Partials 26 25 -1 ☔ View full report in Codecov by Sentry. |
neculalaura
previously approved these changes
Jun 3, 2024
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
This is a slight optimisation to reduce the BFS graph traversal cost with the expectation that the graph is narrower on the left and wider on the right. Most of the time this would be the case if principals are on the left.
e.g.
In the following example, to check
user:jane -> reader -> doc:notes.txtwith left to right BFS will require 10003 lookups whereas right to left will only take 3 lookups.Benchmarks
Before