-
Notifications
You must be signed in to change notification settings - Fork 542
/
algebra.py
1690 lines (1446 loc) · 59.3 KB
/
algebra.py
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
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
"""
Converting the 'parse-tree' output of pyparsing to a SPARQL Algebra expression
http://www.w3.org/TR/sparql11-query/#sparqlQuery
"""
from __future__ import annotations
import collections
import functools
import operator
import typing
from functools import reduce
from typing import (
Any,
Callable,
DefaultDict,
Dict,
Iterable,
List,
Mapping,
Optional,
Set,
Tuple,
overload,
)
from pyparsing import ParseResults
from rdflib.paths import (
AlternativePath,
InvPath,
MulPath,
NegatedPath,
Path,
SequencePath,
)
from rdflib.plugins.sparql.operators import TrueFilter, and_
from rdflib.plugins.sparql.operators import simplify as simplifyFilters
from rdflib.plugins.sparql.parserutils import CompValue, Expr
from rdflib.plugins.sparql.sparql import Prologue, Query, Update
# ---------------------------
# Some convenience methods
from rdflib.term import BNode, Identifier, Literal, URIRef, Variable
def OrderBy(p: CompValue, expr: List[CompValue]) -> CompValue:
return CompValue("OrderBy", p=p, expr=expr)
def ToMultiSet(p: typing.Union[List[Dict[Variable, str]], CompValue]) -> CompValue:
return CompValue("ToMultiSet", p=p)
def Union(p1: CompValue, p2: CompValue) -> CompValue:
return CompValue("Union", p1=p1, p2=p2)
def Join(p1: CompValue, p2: Optional[CompValue]) -> CompValue:
return CompValue("Join", p1=p1, p2=p2)
def Minus(p1: CompValue, p2: CompValue) -> CompValue:
return CompValue("Minus", p1=p1, p2=p2)
def Graph(term: Identifier, graph: CompValue) -> CompValue:
return CompValue("Graph", term=term, p=graph)
def BGP(
triples: Optional[List[Tuple[Identifier, Identifier, Identifier]]] = None
) -> CompValue:
return CompValue("BGP", triples=triples or [])
def LeftJoin(p1: CompValue, p2: CompValue, expr) -> CompValue:
return CompValue("LeftJoin", p1=p1, p2=p2, expr=expr)
def Filter(expr: Expr, p: CompValue) -> CompValue:
return CompValue("Filter", expr=expr, p=p)
def Extend(
p: CompValue, expr: typing.Union[Identifier, Expr], var: Variable
) -> CompValue:
return CompValue("Extend", p=p, expr=expr, var=var)
def Values(res: List[Dict[Variable, str]]) -> CompValue:
return CompValue("values", res=res)
def Project(p: CompValue, PV: List[Variable]) -> CompValue:
return CompValue("Project", p=p, PV=PV)
def Group(p: CompValue, expr: Optional[List[Variable]] = None) -> CompValue:
return CompValue("Group", p=p, expr=expr)
def _knownTerms(
triple: Tuple[Identifier, Identifier, Identifier],
varsknown: Set[typing.Union[BNode, Variable]],
varscount: Dict[Identifier, int],
) -> Tuple[int, int, bool]:
return (
len(
[
x
for x in triple
if x not in varsknown and isinstance(x, (Variable, BNode))
]
),
-sum(varscount.get(x, 0) for x in triple),
not isinstance(triple[2], Literal),
)
def reorderTriples(
l_: Iterable[Tuple[Identifier, Identifier, Identifier]]
) -> List[Tuple[Identifier, Identifier, Identifier]]:
"""
Reorder triple patterns so that we execute the
ones with most bindings first
"""
def _addvar(term: str, varsknown: Set[typing.Union[Variable, BNode]]):
if isinstance(term, (Variable, BNode)):
varsknown.add(term)
# NOTE on type errors: most of these are because the same variable is used
# for different types.
# type error: List comprehension has incompatible type List[Tuple[None, Tuple[Identifier, Identifier, Identifier]]]; expected List[Tuple[Identifier, Identifier, Identifier]]
l_ = [(None, x) for x in l_] # type: ignore[misc]
varsknown: Set[typing.Union[BNode, Variable]] = set()
varscount: Dict[Identifier, int] = collections.defaultdict(int)
for t in l_:
for c in t[1]:
if isinstance(c, (Variable, BNode)):
varscount[c] += 1
i = 0
# Done in steps, sort by number of bound terms
# the top block of patterns with the most bound terms is kept
# the rest is resorted based on the vars bound after the first
# block is evaluated
# we sort by decorate/undecorate, since we need the value of the sort keys
while i < len(l_):
# type error: Generator has incompatible item type "Tuple[Any, Identifier]"; expected "Tuple[Identifier, Identifier, Identifier]"
# type error: Argument 1 to "_knownTerms" has incompatible type "Identifier"; expected "Tuple[Identifier, Identifier, Identifier]"
l_[i:] = sorted((_knownTerms(x[1], varsknown, varscount), x[1]) for x in l_[i:]) # type: ignore[misc,arg-type]
# type error: Incompatible types in assignment (expression has type "str", variable has type "Tuple[Identifier, Identifier, Identifier]")
t = l_[i][0][0] # type: ignore[assignment] # top block has this many terms bound
j = 0
while i + j < len(l_) and l_[i + j][0][0] == t:
for c in l_[i + j][1]:
_addvar(c, varsknown)
j += 1
i += 1
# type error: List comprehension has incompatible type List[Identifier]; expected List[Tuple[Identifier, Identifier, Identifier]]
return [x[1] for x in l_] # type: ignore[misc]
def triples(
l: typing.Union[ # noqa: E741
List[List[Identifier]], List[Tuple[Identifier, Identifier, Identifier]]
]
) -> List[Tuple[Identifier, Identifier, Identifier]]:
_l = reduce(lambda x, y: x + y, l)
if (len(_l) % 3) != 0:
raise Exception("these aint triples")
return reorderTriples((_l[x], _l[x + 1], _l[x + 2]) for x in range(0, len(_l), 3))
# type error: Missing return statement
def translatePName( # type: ignore[return]
p: typing.Union[CompValue, str], prologue: Prologue
) -> Optional[Identifier]:
"""
Expand prefixed/relative URIs
"""
if isinstance(p, CompValue):
if p.name == "pname":
# type error: Incompatible return value type (got "Union[CompValue, str, None]", expected "Optional[Identifier]")
return prologue.absolutize(p) # type: ignore[return-value]
if p.name == "literal":
# type error: Argument "datatype" to "Literal" has incompatible type "Union[CompValue, str, None]"; expected "Optional[str]"
return Literal(
p.string, lang=p.lang, datatype=prologue.absolutize(p.datatype) # type: ignore[arg-type]
)
elif isinstance(p, URIRef):
# type error: Incompatible return value type (got "Union[CompValue, str, None]", expected "Optional[Identifier]")
return prologue.absolutize(p) # type: ignore[return-value]
@overload
def translatePath(p: URIRef) -> None: ...
@overload
def translatePath(p: CompValue) -> Path: ...
# type error: Missing return statement
def translatePath(p: typing.Union[CompValue, URIRef]) -> Optional[Path]: # type: ignore[return]
"""
Translate PropertyPath expressions
"""
if isinstance(p, CompValue):
if p.name == "PathAlternative":
if len(p.part) == 1:
return p.part[0]
else:
return AlternativePath(*p.part)
elif p.name == "PathSequence":
if len(p.part) == 1:
return p.part[0]
else:
return SequencePath(*p.part)
elif p.name == "PathElt":
if not p.mod:
return p.part
else:
if isinstance(p.part, list):
if len(p.part) != 1:
raise Exception("Denkfehler!")
return MulPath(p.part[0], p.mod)
else:
return MulPath(p.part, p.mod)
elif p.name == "PathEltOrInverse":
if isinstance(p.part, list):
if len(p.part) != 1:
raise Exception("Denkfehler!")
return InvPath(p.part[0])
else:
return InvPath(p.part)
elif p.name == "PathNegatedPropertySet":
if isinstance(p.part, list):
return NegatedPath(AlternativePath(*p.part))
else:
return NegatedPath(p.part)
def translateExists(
e: typing.Union[Expr, Literal, Variable, URIRef]
) -> typing.Union[Expr, Literal, Variable, URIRef]:
"""
Translate the graph pattern used by EXISTS and NOT EXISTS
http://www.w3.org/TR/sparql11-query/#sparqlCollectFilters
"""
def _c(n):
if isinstance(n, CompValue):
if n.name in ("Builtin_EXISTS", "Builtin_NOTEXISTS"):
n.graph = translateGroupGraphPattern(n.graph)
if n.graph.name == "Filter":
# filters inside (NOT) EXISTS can see vars bound outside
n.graph.no_isolated_scope = True
e = traverse(e, visitPost=_c)
return e
def collectAndRemoveFilters(parts: List[CompValue]) -> Optional[Expr]:
"""
FILTER expressions apply to the whole group graph pattern in which
they appear.
http://www.w3.org/TR/sparql11-query/#sparqlCollectFilters
"""
filters = []
i = 0
while i < len(parts):
p = parts[i]
if p.name == "Filter":
filters.append(translateExists(p.expr))
parts.pop(i)
else:
i += 1
if filters:
# type error: Argument 1 to "and_" has incompatible type "*List[Union[Expr, Literal, Variable]]"; expected "Expr"
return and_(*filters) # type: ignore[arg-type]
return None
def translateGroupOrUnionGraphPattern(graphPattern: CompValue) -> Optional[CompValue]:
A: Optional[CompValue] = None
for g in graphPattern.graph:
g = translateGroupGraphPattern(g)
if not A:
A = g
else:
A = Union(A, g)
return A
def translateGraphGraphPattern(graphPattern: CompValue) -> CompValue:
return Graph(graphPattern.term, translateGroupGraphPattern(graphPattern.graph))
def translateInlineData(graphPattern: CompValue) -> CompValue:
return ToMultiSet(translateValues(graphPattern))
def translateGroupGraphPattern(graphPattern: CompValue) -> CompValue:
"""
http://www.w3.org/TR/sparql11-query/#convertGraphPattern
"""
if graphPattern.name == "SubSelect":
# The first output from translate cannot be None for a subselect query
# as it can only be None for certain DESCRIBE queries.
# type error: Argument 1 to "ToMultiSet" has incompatible type "Optional[CompValue]";
# expected "Union[List[Dict[Variable, str]], CompValue]"
return ToMultiSet(translate(graphPattern)[0]) # type: ignore[arg-type]
if not graphPattern.part:
graphPattern.part = [] # empty { }
filters = collectAndRemoveFilters(graphPattern.part)
g: List[CompValue] = []
for p in graphPattern.part:
if p.name == "TriplesBlock":
# merge adjacent TripleBlocks
if not (g and g[-1].name == "BGP"):
g.append(BGP())
g[-1]["triples"] += triples(p.triples)
else:
g.append(p)
G = BGP()
for p in g:
if p.name == "OptionalGraphPattern":
A = translateGroupGraphPattern(p.graph)
if A.name == "Filter":
G = LeftJoin(G, A.p, A.expr)
else:
G = LeftJoin(G, A, TrueFilter)
elif p.name == "MinusGraphPattern":
G = Minus(p1=G, p2=translateGroupGraphPattern(p.graph))
elif p.name == "GroupOrUnionGraphPattern":
G = Join(p1=G, p2=translateGroupOrUnionGraphPattern(p))
elif p.name == "GraphGraphPattern":
G = Join(p1=G, p2=translateGraphGraphPattern(p))
elif p.name == "InlineData":
G = Join(p1=G, p2=translateInlineData(p))
elif p.name == "ServiceGraphPattern":
G = Join(p1=G, p2=p)
elif p.name in ("BGP", "Extend"):
G = Join(p1=G, p2=p)
elif p.name == "Bind":
# translateExists will translate the expression if it is EXISTS, and otherwise return
# the expression as is. This is needed because EXISTS has a graph pattern
# which must be translated to work properly during evaluation.
G = Extend(G, translateExists(p.expr), p.var)
else:
raise Exception(
"Unknown part in GroupGraphPattern: %s - %s" % (type(p), p.name)
)
if filters:
G = Filter(expr=filters, p=G)
return G
class StopTraversal(Exception): # noqa: N818
def __init__(self, rv: bool):
self.rv = rv
def _traverse(
e: Any,
visitPre: Callable[[Any], Any] = lambda n: None,
visitPost: Callable[[Any], Any] = lambda n: None,
):
"""
Traverse a parse-tree, visit each node
if visit functions return a value, replace current node
"""
_e = visitPre(e)
if _e is not None:
return _e
if e is None:
return None
if isinstance(e, (list, ParseResults)):
return [_traverse(x, visitPre, visitPost) for x in e]
elif isinstance(e, tuple):
return tuple([_traverse(x, visitPre, visitPost) for x in e])
elif isinstance(e, CompValue):
for k, val in e.items():
e[k] = _traverse(val, visitPre, visitPost)
_e = visitPost(e)
if _e is not None:
return _e
return e
def _traverseAgg(e, visitor: Callable[[Any, Any], Any] = lambda n, v: None):
"""
Traverse a parse-tree, visit each node
if visit functions return a value, replace current node
"""
res = []
if isinstance(e, (list, ParseResults, tuple)):
res = [_traverseAgg(x, visitor) for x in e]
elif isinstance(e, CompValue):
for k, val in e.items():
if val is not None:
res.append(_traverseAgg(val, visitor))
return visitor(e, res)
def traverse(
tree,
visitPre: Callable[[Any], Any] = lambda n: None,
visitPost: Callable[[Any], Any] = lambda n: None,
complete: Optional[bool] = None,
) -> Any:
"""
Traverse tree, visit each node with visit function
visit function may raise StopTraversal to stop traversal
if complete!=None, it is returned on complete traversal,
otherwise the transformed tree is returned
"""
try:
r = _traverse(tree, visitPre, visitPost)
if complete is not None:
return complete
return r
except StopTraversal as st:
return st.rv
def _hasAggregate(x) -> None:
"""
Traverse parse(sub)Tree
return true if any aggregates are used
"""
if isinstance(x, CompValue):
if x.name.startswith("Aggregate_"):
raise StopTraversal(True)
# type error: Missing return statement
def _aggs(e, A) -> Optional[Variable]: # type: ignore[return]
"""
Collect Aggregates in A
replaces aggregates with variable references
"""
# TODO: nested Aggregates?
if isinstance(e, CompValue) and e.name.startswith("Aggregate_"):
A.append(e)
aggvar = Variable("__agg_%d__" % len(A))
e["res"] = aggvar
return aggvar
# type error: Missing return statement
def _findVars(x, res: Set[Variable]) -> Optional[CompValue]: # type: ignore[return]
"""
Find all variables in a tree
"""
if isinstance(x, Variable):
res.add(x)
if isinstance(x, CompValue):
if x.name == "Bind":
res.add(x.var)
return x # stop recursion and finding vars in the expr
elif x.name == "SubSelect":
if x.projection:
res.update(v.var or v.evar for v in x.projection)
return x
def _addVars(x, children: List[Set[Variable]]) -> Set[Variable]:
"""
find which variables may be bound by this part of the query
"""
if isinstance(x, Variable):
return set([x])
elif isinstance(x, CompValue):
if x.name == "RelationalExpression":
x["_vars"] = set()
elif x.name == "Extend":
# vars only used in the expr for a bind should not be included
x["_vars"] = reduce(
operator.or_,
[child for child, part in zip(children, x) if part != "expr"],
set(),
)
else:
x["_vars"] = set(reduce(operator.or_, children, set()))
if x.name == "SubSelect":
if x.projection:
s = set(v.var or v.evar for v in x.projection)
else:
s = set()
return s
return x["_vars"]
return reduce(operator.or_, children, set())
# type error: Missing return statement
def _sample(e: typing.Union[CompValue, List[Expr], Expr, List[str], Variable], v: Optional[Variable] = None) -> Optional[CompValue]: # type: ignore[return]
"""
For each unaggregated variable V in expr
Replace V with Sample(V)
"""
if isinstance(e, CompValue) and e.name.startswith("Aggregate_"):
return e # do not replace vars in aggregates
if isinstance(e, Variable) and v != e:
return CompValue("Aggregate_Sample", vars=e)
def _simplifyFilters(e: Any) -> Any:
if isinstance(e, Expr):
return simplifyFilters(e)
def translateAggregates(
q: CompValue, M: CompValue
) -> Tuple[CompValue, List[Tuple[Variable, Variable]]]:
E: List[Tuple[Variable, Variable]] = []
A: List[CompValue] = []
# collect/replace aggs in :
# select expr as ?var
if q.projection:
for v in q.projection:
if v.evar:
v.expr = traverse(v.expr, functools.partial(_sample, v=v.evar))
v.expr = traverse(v.expr, functools.partial(_aggs, A=A))
# having clause
if traverse(q.having, _hasAggregate, complete=True):
q.having = traverse(q.having, _sample)
traverse(q.having, functools.partial(_aggs, A=A))
# order by
if traverse(q.orderby, _hasAggregate, complete=False):
q.orderby = traverse(q.orderby, _sample)
traverse(q.orderby, functools.partial(_aggs, A=A))
# sample all other select vars
# TODO: only allowed for vars in group-by?
if q.projection:
for v in q.projection:
if v.var:
rv = Variable("__agg_%d__" % (len(A) + 1))
A.append(CompValue("Aggregate_Sample", vars=v.var, res=rv))
E.append((rv, v.var))
return CompValue("AggregateJoin", A=A, p=M), E
def translateValues(
v: CompValue,
) -> typing.Union[List[Dict[Variable, str]], CompValue]:
# if len(v.var)!=len(v.value):
# raise Exception("Unmatched vars and values in ValueClause: "+str(v))
res: List[Dict[Variable, str]] = []
if not v.var:
return res
if not v.value:
return res
if not isinstance(v.value[0], list):
for val in v.value:
res.append({v.var[0]: val})
else:
for vals in v.value:
res.append(dict(zip(v.var, vals)))
return Values(res)
def translate(q: CompValue) -> Tuple[Optional[CompValue], List[Variable]]:
"""
http://www.w3.org/TR/sparql11-query/#convertSolMod
"""
_traverse(q, _simplifyFilters)
q.where = traverse(q.where, visitPost=translatePath)
# TODO: Var scope test
VS: Set[Variable] = set()
# All query types have a WHERE clause EXCEPT some DESCRIBE queries
# where only explicit IRIs are provided.
if q.name == "DescribeQuery":
# For DESCRIBE queries, use the vars provided in q.var.
# If there is no WHERE clause, vars should be explicit IRIs to describe.
# If there is a WHERE clause, vars can be any combination of explicit IRIs
# and variables.
VS = set(q.var)
# If there is no WHERE clause, just return the vars projected
if q.where is None:
return None, list(VS)
# Otherwise, evaluate the WHERE clause like SELECT DISTINCT
else:
q.modifier = "DISTINCT"
else:
traverse(q.where, functools.partial(_findVars, res=VS))
# depth-first recursive generation of mapped query tree
M = translateGroupGraphPattern(q.where)
aggregate = False
if q.groupby:
conditions = []
# convert "GROUP BY (?expr as ?var)" to an Extend
for c in q.groupby.condition:
if isinstance(c, CompValue) and c.name == "GroupAs":
M = Extend(M, c.expr, c.var)
c = c.var
conditions.append(c)
M = Group(p=M, expr=conditions)
aggregate = True
elif (
traverse(q.having, _hasAggregate, complete=False)
or traverse(q.orderby, _hasAggregate, complete=False)
or any(
traverse(x.expr, _hasAggregate, complete=False)
for x in q.projection or []
if x.evar
)
):
# if any aggregate is used, implicit group by
M = Group(p=M)
aggregate = True
if aggregate:
M, aggregateAliases = translateAggregates(q, M)
else:
aggregateAliases = []
# Need to remove the aggregate var aliases before joining to VALUES;
# else the variable names won't match up correctly when aggregating.
for alias, var in aggregateAliases:
M = Extend(M, alias, var)
# HAVING
if q.having:
M = Filter(expr=and_(*q.having.condition), p=M)
# VALUES
if q.valuesClause:
M = Join(p1=M, p2=ToMultiSet(translateValues(q.valuesClause)))
if not q.projection:
# select *
# Find the first child projection in each branch of the mapped query tree,
# then include the variables it projects out in our projected variables.
for child_projection in _find_first_child_projections(M):
VS |= set(child_projection.PV)
PV = list(VS)
else:
E = list()
PV = list()
for v in q.projection:
if v.var:
if v not in PV:
PV.append(v.var)
elif v.evar:
if v not in PV:
PV.append(v.evar)
E.append((v.expr, v.evar))
else:
raise Exception("I expected a var or evar here!")
for e, v in E:
M = Extend(M, e, v)
# ORDER BY
if q.orderby:
M = OrderBy(
M,
[
CompValue("OrderCondition", expr=c.expr, order=c.order)
for c in q.orderby.condition
],
)
# PROJECT
M = Project(M, PV)
if q.modifier:
if q.modifier == "DISTINCT":
M = CompValue("Distinct", p=M)
elif q.modifier == "REDUCED":
M = CompValue("Reduced", p=M)
if q.limitoffset:
offset = 0
if q.limitoffset.offset is not None:
offset = q.limitoffset.offset.toPython()
if q.limitoffset.limit is not None:
M = CompValue(
"Slice", p=M, start=offset, length=q.limitoffset.limit.toPython()
)
else:
M = CompValue("Slice", p=M, start=offset)
return M, PV
def _find_first_child_projections(M: CompValue) -> Iterable[CompValue]:
"""
Recursively find the first child instance of a Projection operation in each of
the branches of the query execution plan/tree.
"""
for child_op in M.values():
if isinstance(child_op, CompValue):
if child_op.name == "Project":
yield child_op
else:
for child_projection in _find_first_child_projections(child_op):
yield child_projection
# type error: Missing return statement
def simplify(n: Any) -> Optional[CompValue]: # type: ignore[return]
"""Remove joins to empty BGPs"""
if isinstance(n, CompValue):
if n.name == "Join":
if n.p1.name == "BGP" and len(n.p1.triples) == 0:
return n.p2
if n.p2.name == "BGP" and len(n.p2.triples) == 0:
return n.p1
elif n.name == "BGP":
n["triples"] = reorderTriples(n.triples)
return n
def analyse(n: Any, children: Any) -> bool:
"""
Some things can be lazily joined.
This propegates whether they can up the tree
and sets lazy flags for all joins
"""
if isinstance(n, CompValue):
if n.name == "Join":
n["lazy"] = all(children)
return False
elif n.name in ("Slice", "Distinct"):
return False
else:
return all(children)
else:
return True
def translatePrologue(
p: ParseResults,
base: Optional[str],
initNs: Optional[Mapping[str, Any]] = None,
prologue: Optional[Prologue] = None,
) -> Prologue:
if prologue is None:
prologue = Prologue()
prologue.base = ""
if base:
prologue.base = base
if initNs:
for k, v in initNs.items():
prologue.bind(k, v)
x: CompValue
for x in p:
if x.name == "Base":
prologue.base = x.iri
elif x.name == "PrefixDecl":
prologue.bind(x.prefix, prologue.absolutize(x.iri))
return prologue
def translateQuads(
quads: CompValue,
) -> Tuple[
List[Tuple[Identifier, Identifier, Identifier]],
DefaultDict[str, List[Tuple[Identifier, Identifier, Identifier]]],
]:
if quads.triples:
alltriples = triples(quads.triples)
else:
alltriples = []
allquads: DefaultDict[str, List[Tuple[Identifier, Identifier, Identifier]]] = (
collections.defaultdict(list)
)
if quads.quadsNotTriples:
for q in quads.quadsNotTriples:
if q.triples:
allquads[q.term] += triples(q.triples)
return alltriples, allquads
def translateUpdate1(u: CompValue, prologue: Prologue) -> CompValue:
if u.name in ("Load", "Clear", "Drop", "Create"):
pass # no translation needed
elif u.name in ("Add", "Move", "Copy"):
pass
elif u.name in ("InsertData", "DeleteData", "DeleteWhere"):
t, q = translateQuads(u.quads)
u["quads"] = q
u["triples"] = t
if u.name in ("DeleteWhere", "DeleteData"):
pass # TODO: check for bnodes in triples
elif u.name == "Modify":
if u.delete:
u.delete["triples"], u.delete["quads"] = translateQuads(u.delete.quads)
if u.insert:
u.insert["triples"], u.insert["quads"] = translateQuads(u.insert.quads)
u["where"] = translateGroupGraphPattern(u.where)
else:
raise Exception("Unknown type of update operation: %s" % u)
u.prologue = prologue
return u
def translateUpdate(
q: CompValue,
base: Optional[str] = None,
initNs: Optional[Mapping[str, Any]] = None,
) -> Update:
"""
Returns a list of SPARQL Update Algebra expressions
"""
res: List[CompValue] = []
prologue = None
if not q.request:
# type error: Incompatible return value type (got "List[CompValue]", expected "Update")
return res # type: ignore[return-value]
for p, u in zip(q.prologue, q.request):
prologue = translatePrologue(p, base, initNs, prologue)
# absolutize/resolve prefixes
u = traverse(u, visitPost=functools.partial(translatePName, prologue=prologue))
u = _traverse(u, _simplifyFilters)
u = traverse(u, visitPost=translatePath)
res.append(translateUpdate1(u, prologue))
# type error: Argument 1 to "Update" has incompatible type "Optional[Any]"; expected "Prologue"
return Update(prologue, res) # type: ignore[arg-type]
def translateQuery(
q: ParseResults,
base: Optional[str] = None,
initNs: Optional[Mapping[str, Any]] = None,
) -> Query:
"""
Translate a query-parsetree to a SPARQL Algebra Expression
Return a rdflib.plugins.sparql.sparql.Query object
"""
# We get in: (prologue, query)
prologue = translatePrologue(q[0], base, initNs)
# absolutize/resolve prefixes
q[1] = traverse(
q[1], visitPost=functools.partial(translatePName, prologue=prologue)
)
P, PV = translate(q[1])
datasetClause = q[1].datasetClause
if q[1].name == "ConstructQuery":
template = triples(q[1].template) if q[1].template else None
res = CompValue(q[1].name, p=P, template=template, datasetClause=datasetClause)
else:
res = CompValue(q[1].name, p=P, datasetClause=datasetClause, PV=PV)
res = traverse(res, visitPost=simplify)
_traverseAgg(res, visitor=analyse)
_traverseAgg(res, _addVars)
return Query(prologue, res)
class ExpressionNotCoveredException(Exception): # noqa: N818
pass
class _AlgebraTranslator:
"""
Translator of a Query's algebra to its equivalent SPARQL (string).
Coded as a class to support storage of state during the translation process,
without use of a file.
Anticipated Usage:
.. code-block:: python
translated_query = _AlgebraTranslator(query).translateAlgebra()
An external convenience function which wraps the above call,
`translateAlgebra`, is supplied, so this class does not need to be
referenced by client code at all in normal use.
"""
def __init__(self, query_algebra: Query):
self.query_algebra = query_algebra
self.aggr_vars: DefaultDict[Identifier, List[Identifier]] = (
collections.defaultdict(list)
)
self._alg_translation: str = ""
def _replace(
self,
old: str,
new: str,
search_from_match: str = None,
search_from_match_occurrence: int = None,
count: int = 1,
):
def find_nth(haystack, needle, n):
start = haystack.lower().find(needle)
while start >= 0 and n > 1:
start = haystack.lower().find(needle, start + len(needle))
n -= 1
return start
if search_from_match and search_from_match_occurrence:
position = find_nth(
self._alg_translation, search_from_match, search_from_match_occurrence
)
filedata_pre = self._alg_translation[:position]
filedata_post = self._alg_translation[position:].replace(old, new, count)
self._alg_translation = filedata_pre + filedata_post
else:
self._alg_translation = self._alg_translation.replace(old, new, count)
def convert_node_arg(
self, node_arg: typing.Union[Identifier, CompValue, Expr, str]