SSP pipeline #1489
Merged
SSP pipeline #1489
Conversation
This file contains 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
Codecov ReportPatch coverage:
Additional details and impacted files@@ Coverage Diff @@
## master #1489 +/- ##
==========================================
- Coverage 92.20% 92.13% -0.08%
==========================================
Files 671 675 +4
Lines 24069 24018 -51
==========================================
- Hits 22194 22130 -64
- Misses 1875 1888 +13
☔ View full report in Codecov by Sentry. |
semihsalihoglu-uw
approved these changes
Apr 27, 2023
src/include/processor/operator/var_length_extend/recursive_join.h
Outdated
Show resolved
Hide resolved
andyfengHKU
force-pushed
the
ssp-pipeline
branch
from
9a63709
to
dbfd1fa
Compare
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 PR implements the non-blocking version of shortest path.
In the front end, SHORTEST_PATH edge is treated in the same way as a regular query edge except that we don't allow property reading on SHORTEST_PATH edge.
In the back end, we add a RecursiveJoin operator that computes the SHORTEST_PATH for a single src node. Parallelism is achieved by having different threads working on different source node. Note this approach will suffer from skewness.