You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Is your feature request related to a problem? Please describe.
We have supported a optimized intersection in pattern matching. E.g., for a triangle pattern with vertices a, b, c, we can first expand a->b, and then intersect a->c and b->c, to find the matchings for the triangle. However, currently, we cannot preserve the edge matchings for a->c and b->c during the intersection process (we only preserve the matchings for the vertices). Thus, we need to support a more general Intersection if the edge matchings are needed.
The text was updated successfully, but these errors were encountered:
/cc @BingqingLyu, this issus/pr has had no activity for for a long time, could you folks help to review the status ?
To suppress further notifications,
for issues,
if it is waiting for further response from the reporter/author, please help to add the label requires-further-info,
if you have already started working on it, please add the label work-in-progress to the issue,
if this issue requires further designing discussion and not in current plan, or won't be fixed, please add the label requires-further-discussion or wontfix to the issue,
for pull requests,
if you are still working on it and it is not ready for reviewing, please convert this pull request as draft PR,
if you have decided to hold this development on, please add the requires-further-discussion label to the pull request.
Thanks!
… Runtime (#3689)
<!--
Thanks for your contribution! please review
https://github.com/alibaba/GraphScope/blob/main/CONTRIBUTING.md before
opening an issue.
-->
## What do these changes do?
<!-- Please give a short brief about these changes. -->
As titled.
This pr mainly includes:
1. Refactor the convert logic of `Intersect` in
`GraphRelToProtoConverter` in Compiler
2. Refactor the parsing and processing logic of `Intersect` in assembly
in Runtime
3. Support a more general `Intersect` that can preserve the edges during
intersection, in Runtime
4. Add a micro benchmark framework, and testing for general_intersection
v.s. optimized_intersection. The results shows that, on ldbc dataset
(sf=1), to find matches for a triangle (a,b,c knows each other),
general_intersection's time cost is about 1.7\times of
optimized_intersection's, as the general_intersection further preserves
all matched edges during the intersection computation.
## Related issue number
<!-- Are there any issues opened that will be resolved by merging this
change? -->
Fixes#3685#3745
---------
Co-authored-by: xiao.zl <xiaolei.zl@alibaba-inc.com>
Co-authored-by: Longbin Lai <longbin.lailb@alibaba-inc.com>
Is your feature request related to a problem? Please describe.
We have supported a optimized intersection in pattern matching. E.g., for a triangle pattern with vertices
a
,b
,c
, we can first expanda->b
, and then intersecta->c
andb->c
, to find the matchings for the triangle. However, currently, we cannot preserve the edge matchings fora->c
andb->c
during the intersection process (we only preserve the matchings for the vertices). Thus, we need to support a more generalIntersection
if the edge matchings are needed.The text was updated successfully, but these errors were encountered: