-
Notifications
You must be signed in to change notification settings - Fork 228
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
False results with nodes k-hop relations #2934
Comments
@llooFlashooll can you please try to recreate this with RedisGraph 2.10.9? |
Ok, received with thanks! Give me some time, I'll try this. |
Come late. I think I can still keep triggering this bug in the new version 2.10.9. Here I can show you another example. Expected behavior:We construct the following scenario: we first find all the k-hop nodes AKHopNodes of node A. Then we traverse the nodes in AKHopNodes. For every node B inside this set, we find all the k-hop nodes BKHopNodes of node B. Finally, node A should in the set BKHopNodes. That is, node B is inside k-hop outgoing nodes of node A, then node A is also inside k-hop incoming nodes of node B.
Actual behavior:But it turns out that node with id 8 is not inside the incoming 2-hop node set of node with id 9. This is a logic bug related to graph structure. Steps to reproduce:We are developing a fuzzing technique to test your GraphDB. We feel sorry that because the database schema and data values are randomly generated by strings, it will cause inconvenience to your reviewing, but we believe the problem does exist.
|
We discovered a bug that False results with nodes k-hop relations.
Expected behavior:
We construct the following scenario: we first find all the k-hop nodes AKHopNodes of node A. Then we traverse the nodes in AKHopNodes. For every node B inside this set, we find all the k-hop nodes BKHopNodes of node B. Finally, node A should in the set BKHopNodes. That is, node B is inside k-hop outgoing nodes of node A, then node A is also inside k-hop incoming nodes of node B.
We generate graph schema and data based on random strings and values. Here is one of our examples that triggered the bug.
MATCH (a) MATCH path=(a)-[*2..2]->(b) WHERE (a<>b) AND (ID(a)=24) RETURN DISTINCT b
. Find all the distinct outgoing 2-hop nodes of node with id 24.MATCH (a) MATCH path=(a)<-[*2..2]-(b) WHERE (a<>b) AND (ID(a)=23) RETURN DISTINCT b
. Find all the distinct incoming 2-hop nodes of node with id 23.Actual behavior:
But it turns out that node with id 24 is not inside the incoming 2-hop node set of node with id 23. This is a logic bug related to graph structure.
Steps to reproduce:
We are developing a fuzzing technique to test your GraphDB. We feel sorry that because the database schema and data values are randomly generated by strings, it will cause inconvenience to your reviewing, but we believe the problem does exist.
Following the following graph data generation query, we can reproduce the bugs:
The text was updated successfully, but these errors were encountered: