Skip to content
Navigation Menu
{{ message }}
forked from RedisGraph/RedisGraph
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest_relation_patterns.py
More file actions
302 lines (251 loc) · 13.3 KB
/
Copy pathtest_relation_patterns.py
File metadata and controls
302 lines (251 loc) · 13.3 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
from common import *
GRAPH_ID = "G"
redis_con = None
redis_graph = None
class testRelationPattern(FlowTestsBase):
def __init__(self):
self.env = Env(decodeResponses=True)
global redis_con
global redis_graph
redis_con = self.env.getConnection()
redis_graph = Graph(redis_con, GRAPH_ID)
self.populate_graph()
def populate_graph(self):
# Construct a graph with the form:
# (v1)-[:e]->(v2)-[:e]->(v3)
node_props = ['v1', 'v2', 'v3']
nodes = []
for idx, v in enumerate(node_props):
node = Node(label="L", properties={"val": v})
nodes.append(node)
redis_graph.add_node(node)
edge = Edge(nodes[0], "e", nodes[1])
redis_graph.add_edge(edge)
edge = Edge(nodes[1], "e", nodes[2])
redis_graph.add_edge(edge)
redis_graph.commit()
# Test patterns that traverse 1 edge.
def test01_one_hop_traversals(self):
# Conditional traversal with label
query = """MATCH (a)-[:e]->(b) RETURN a.val, b.val ORDER BY a.val, b.val"""
result_a = redis_graph.query(query)
# Conditional traversal without label
query = """MATCH (a)-[]->(b) RETURN a.val, b.val ORDER BY a.val, b.val"""
result_b = redis_graph.query(query)
# Fixed-length 1-hop traversal with label
query = """MATCH (a)-[:e*1]->(b) RETURN a.val, b.val ORDER BY a.val, b.val"""
result_c = redis_graph.query(query)
# Fixed-length 1-hop traversal without label
query = """MATCH (a)-[*1]->(b) RETURN a.val, b.val ORDER BY a.val, b.val"""
result_d = redis_graph.query(query)
self.env.assertEquals(result_b.result_set, result_a.result_set)
self.env.assertEquals(result_c.result_set, result_a.result_set)
self.env.assertEquals(result_d.result_set, result_a.result_set)
# Test patterns that traverse 2 edges.
def test02_two_hop_traversals(self):
# Conditional two-hop traversal without referenced intermediate node
query = """MATCH (a)-[:e]->()-[:e]->(b) RETURN a.val, b.val ORDER BY a.val, b.val"""
actual_result = redis_graph.query(query)
expected_result = [['v1', 'v3']]
self.env.assertEquals(actual_result.result_set, expected_result)
# Fixed-length two-hop traversal (same expected result)
query = """MATCH (a)-[:e*2]->(b) RETURN a.val, b.val ORDER BY a.val, b.val"""
self.env.assertEquals(actual_result.result_set, expected_result)
# Variable-length traversal with a minimum bound of 2 (same expected result)
query = """MATCH (a)-[*2..]->(b) RETURN a.val, b.val ORDER BY a.val, b.val"""
actual_result = redis_graph.query(query)
self.env.assertEquals(actual_result.result_set, expected_result)
# Conditional two-hop traversal with referenced intermediate node
query = """MATCH (a)-[:e]->(b)-[:e]->(c) RETURN a.val, b.val, c.val ORDER BY a.val, b.val"""
actual_result = redis_graph.query(query)
expected_result = [['v1', 'v2', 'v3']]
self.env.assertEquals(actual_result.result_set, expected_result)
# Test variable-length patterns
def test03_var_len_traversals(self):
# Variable-length traversal with label
query = """MATCH (a)-[:e*]->(b) RETURN a.val, b.val ORDER BY a.val, b.val"""
actual_result = redis_graph.query(query)
expected_result = [['v1', 'v2'],
['v1', 'v3'],
['v2', 'v3']]
self.env.assertEquals(actual_result.result_set, expected_result)
# Variable-length traversal without label (same expected result)
query = """MATCH (a)-[*]->(b) RETURN a.val, b.val ORDER BY a.val, b.val"""
actual_result = redis_graph.query(query)
self.env.assertEquals(actual_result.result_set, expected_result)
# Variable-length traversal with bounds 1..2 (same expected result)
query = """MATCH (a)-[:e*1..2]->(b) RETURN a.val, b.val ORDER BY a.val, b.val"""
actual_result = redis_graph.query(query)
self.env.assertEquals(actual_result.result_set, expected_result)
# Variable-length traversal with bounds 0..1
# This will return every node and itself, as well as all
# single-hop edges.
query = """MATCH (a)-[:e*0..1]->(b) RETURN a.val, b.val ORDER BY a.val, b.val"""
actual_result = redis_graph.query(query)
expected_result = [['v1', 'v1'],
['v1', 'v2'],
['v2', 'v2'],
['v2', 'v3'],
['v3', 'v3']]
self.env.assertEquals(actual_result.result_set, expected_result)
# Test variable-length patterns with alternately labeled source
# and destination nodes, which can cause different execution sequences.
def test04_variable_length_labeled_nodes(self):
# Source and edge labeled variable-length traversal
query = """MATCH (a:L)-[:e*]->(b) RETURN a.val, b.val ORDER BY a.val, b.val"""
actual_result = redis_graph.query(query)
expected_result = [['v1', 'v2'],
['v1', 'v3'],
['v2', 'v3']]
self.env.assertEquals(actual_result.result_set, expected_result)
# Destination and edge labeled variable-length traversal (same expected result)
query = """MATCH (a)-[:e*]->(b:L) RETURN a.val, b.val ORDER BY a.val, b.val"""
actual_result = redis_graph.query(query)
self.env.assertEquals(actual_result.result_set, expected_result)
# Source labeled variable-length traversal (same expected result)
query = """MATCH (a:L)-[*]->(b) RETURN a.val, b.val ORDER BY a.val, b.val"""
actual_result = redis_graph.query(query)
self.env.assertEquals(actual_result.result_set, expected_result)
# Destination labeled variable-length traversal (same expected result)
query = """MATCH (a)-[*]->(b:L) RETURN a.val, b.val ORDER BY a.val, b.val"""
actual_result = redis_graph.query(query)
self.env.assertEquals(actual_result.result_set, expected_result)
# Test traversals over explicit relationship types
def test05_relation_types(self):
# Add two nodes and two edges of a new type.
# The new form of the graph will be:
# (v1)-[:e]->(v2)-[:e]->(v3)-[:q]->(v4)-[:q]->(v5)
query = """MATCH (n {val: 'v3'}) CREATE (n)-[:q]->(:L {val: 'v4'})-[:q]->(:L {val: 'v5'})"""
actual_result = redis_graph.query(query)
self.env.assertEquals(actual_result.nodes_created, 2)
self.env.assertEquals(actual_result.relationships_created, 2)
# Verify the graph structure
query = """MATCH (a)-[e]->(b) RETURN a.val, b.val, TYPE(e) ORDER BY TYPE(e), a.val, b.val"""
actual_result = redis_graph.query(query)
expected_result = [['v1', 'v2', 'e'],
['v2', 'v3', 'e'],
['v3', 'v4', 'q'],
['v4', 'v5', 'q']]
self.env.assertEquals(actual_result.result_set, expected_result)
# Verify conditional traversals with explicit relation types
query = """MATCH (a)-[:e]->(b) RETURN a.val, b.val ORDER BY a.val, b.val"""
actual_result = redis_graph.query(query)
expected_result = [['v1', 'v2'],
['v2', 'v3']]
self.env.assertEquals(actual_result.result_set, expected_result)
query = """MATCH (a)-[:q]->(b) RETURN a.val, b.val ORDER BY a.val, b.val"""
actual_result = redis_graph.query(query)
expected_result = [['v3', 'v4'],
['v4', 'v5']]
self.env.assertEquals(actual_result.result_set, expected_result)
# Verify conditional traversals with multiple explicit relation types
query = """MATCH (a)-[e:e|:q]->(b) RETURN a.val, b.val, TYPE(e) ORDER BY TYPE(e), a.val, b.val"""
actual_result = redis_graph.query(query)
expected_result = [['v1', 'v2', 'e'],
['v2', 'v3', 'e'],
['v3', 'v4', 'q'],
['v4', 'v5', 'q']]
self.env.assertEquals(actual_result.result_set, expected_result)
# Verify variable-length traversals with explicit relation types
query = """MATCH (a)-[:e*]->(b) RETURN a.val, b.val ORDER BY a.val, b.val"""
actual_result = redis_graph.query(query)
expected_result = [['v1', 'v2'],
['v1', 'v3'],
['v2', 'v3']]
self.env.assertEquals(actual_result.result_set, expected_result)
query = """MATCH (a)-[:q*]->(b) RETURN a.val, b.val ORDER BY a.val, b.val"""
actual_result = redis_graph.query(query)
expected_result = [['v3', 'v4'],
['v3', 'v5'],
['v4', 'v5']]
self.env.assertEquals(actual_result.result_set, expected_result)
# Verify variable-length traversals with multiple explicit relation types
query = """MATCH (a)-[:e|:q*]->(b) RETURN a.val, b.val ORDER BY a.val, b.val"""
actual_result = redis_graph.query(query)
expected_result = [['v1', 'v2'],
['v1', 'v3'],
['v1', 'v4'],
['v1', 'v5'],
['v2', 'v3'],
['v2', 'v4'],
['v2', 'v5'],
['v3', 'v4'],
['v3', 'v5'],
['v4', 'v5']]
self.env.assertEquals(actual_result.result_set, expected_result)
# Test traversals over transposed edge matrices.
def test06_transposed_traversals(self):
# The intermediate node 'b' will be used to form the scan operation because it is filtered.
# As such, one of the traversals must be transposed.
query = """MATCH (a)-[e]->(b {val:'v3'})-[]->(c:L) RETURN COUNT(e)"""
plan = redis_graph.execution_plan(query)
# Verify that the execution plan contains two traversals following opposing edge directions.
self.env.assertIn("<-", plan)
self.env.assertIn("->", plan)
# Verify results.
actual_result = redis_graph.query(query)
expected_result = [[1]]
self.env.assertEquals(actual_result.result_set, expected_result)
def test07_transposed_multi_hop(self):
redis_con = self.env.getConnection()
g = Graph(redis_con, "tran_multi_hop")
# (a)-[R]->(b)-[R]->(c)<-[R]-(d)<-[R]-(e)
a = Node(properties={"val": 'a'})
b = Node(properties={"val": 'b'})
c = Node(properties={"val": 'c'})
d = Node(properties={"val": 'd'})
e = Node(properties={"val": 'e'})
g.add_node(a)
g.add_node(b)
g.add_node(c)
g.add_node(d)
g.add_node(e)
ab = Edge(a, "R", b)
bc = Edge(b, "R", c)
ed = Edge(e, "R", d)
dc = Edge(d, "R", c)
g.add_edge(ab)
g.add_edge(bc)
g.add_edge(ed)
g.add_edge(dc)
g.flush()
q = """MATCH (a)-[*2]->(b)<-[*2]-(c) RETURN a.val, b.val, c.val ORDER BY a.val, b.val, c.val"""
actual_result = g.query(q)
expected_result = [['a', 'c', 'a'], ['a', 'c', 'e'], ['e', 'c', 'a'], ['e', 'c', 'e']]
self.env.assertEquals(actual_result.result_set, expected_result)
def test08_transposed_varlen_traversal(self):
# Verify that variable-length traversals with nested transpose operations perform correctly.
query = """MATCH (a {val: 'v1'})-[*]-(b {val: 'v2'})-[:e]->(:L {val: 'v3'}) RETURN a.val ORDER BY a.val"""
actual_result = redis_graph.query(query)
expected_result = [['v1']]
self.env.assertEquals(actual_result.result_set, expected_result)
def test09_transposed_elem_order(self):
redis_con = self.env.getConnection()
g = Graph(redis_con, "transpose_patterns")
# Create a new graph of the form:
# (A)<-[1]-(B)-[2]->(C)
g.query("CREATE (a:A)<-[:E {val:'ba'}]-(b:B)-[:E {val:'bc'}]->(c:C)")
queries = ["MATCH (a:A)<-[e1]-(b:B)-[e2]->(c:C) RETURN e1.val, e2.val",
"MATCH (a:A) WITH a MATCH (a)<-[e1]-(b:B)-[e2]->(c:C) RETURN e1.val, e2.val",
"MATCH (b:B) WITH b MATCH (a:A)<-[e1]-(b)-[e2]->(c:C) RETURN e1.val, e2.val",
"MATCH (c:C) WITH c MATCH (a:A)<-[e1]-(b:B)-[e2]->(c) RETURN e1.val, e2.val",
]
expected_result = [['ba', 'bc']]
for query in queries:
actual_result = g.query(query)
self.env.assertEquals(actual_result.result_set, expected_result)
def test10_triple_edge_type(self):
# Construct a simple graph:
# (A)-[X]->(B)
# (A)-[Y]->(C)
# (A)-[Z]->(D)
g = Graph(redis_con, "triple_edge_type")
q = "CREATE(a:A), (b:B), (c:C), (d:D), (a)-[:X]->(b), (a)-[:Y]->(c), (a)-[:Z]->(d)"
g.query(q)
labels = ['X', 'Y', 'Z']
expected_result = [[['B']], [['C']], [['D']]]
q = "MATCH (a)-[:{L0}|:{L1}|:{L2}]->(b) RETURN labels(b) AS label ORDER BY label"
import itertools
for perm in itertools.permutations(labels):
res = g.query(q.format(L0=perm[0], L1=perm[1], L2=perm[2]))
self.env.assertEquals(res.result_set, expected_result)
You can’t perform that action at this time.