-
Notifications
You must be signed in to change notification settings - Fork 55
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Add Path Search Feature to Qlever #1335
Conversation
Current TODOs:
|
Codecov ReportAttention: Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## master #1335 +/- ##
==========================================
+ Coverage 88.39% 88.49% +0.10%
==========================================
Files 362 364 +2
Lines 27435 27927 +492
Branches 3706 3802 +96
==========================================
+ Hits 24251 24715 +464
- Misses 1943 1960 +17
- Partials 1241 1252 +11 ☔ View full report in Codecov by Sentry. |
Quality Gate passedIssues Measures |
This reverts commit d700df2.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Thank you very much, we'll try this out today.
Conformance check passed ✅No test result changes. |
Quality Gate passedIssues Measures |
This commit adds a feature that computes all paths between pairs of
(source, target)
on a given graph. The source, target, and graph can be configured. The syntax to trigger this search is using a SERVICE request with a special IRI. The details of this API are described in the filedocs/path_search.md
.The current implementation only supports the computation of all paths, which can be exponentially larger than the number of edges in the graph. The implemented infrastructure makes it simpler to implement additional features for this service in the future, such as:
Additionally it can be extended by efficiently supporting the LIMIT/OFFSET clauses and lazy evaluation to efficiently support dealing with very large results in the future.