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
|
/*******************************************************************************
* Copyright (c) 2004-2010 Gabor Bergmann and Daniel Varro
* This program and the accompanying materials are made available under the
* terms of the Eclipse Public License v. 2.0 which is available at
* http://www.eclipse.org/legal/epl-v20.html.
*
* SPDX-License-Identifier: EPL-2.0
*******************************************************************************/
package tools.refinery.viatra.runtime.rete.construction.quasitree;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.stream.Collectors;
import java.util.stream.Stream;
import tools.refinery.viatra.runtime.matchers.planning.SubPlan;
import tools.refinery.viatra.runtime.matchers.planning.SubPlanFactory;
import tools.refinery.viatra.runtime.matchers.planning.helpers.FunctionalDependencyHelper;
import tools.refinery.viatra.runtime.matchers.planning.operations.PJoin;
import tools.refinery.viatra.runtime.matchers.psystem.PConstraint;
import tools.refinery.viatra.runtime.matchers.psystem.PVariable;
import tools.refinery.viatra.runtime.matchers.psystem.analysis.QueryAnalyzer;
import tools.refinery.viatra.runtime.matchers.util.CollectionsFactory;
/**
* @author Gabor Bergmann
*
*/
class JoinCandidate {
private QueryAnalyzer analyzer;
SubPlan primary;
SubPlan secondary;
Set<PVariable> varPrimary;
Set<PVariable> varSecondary;
Set<PVariable> varCommon;
List<PConstraint> consPrimary;
List<PConstraint> consSecondary;
JoinCandidate(SubPlan primary, SubPlan secondary, QueryAnalyzer analyzer) {
super();
this.primary = primary;
this.secondary = secondary;
this.analyzer = analyzer;
varPrimary = getPrimary().getVisibleVariables();
varSecondary = getSecondary().getVisibleVariables();
varCommon = CollectionsFactory.createSet(varPrimary);
varCommon.retainAll(varSecondary);
consPrimary = new ArrayList<PConstraint>(primary.getAllEnforcedConstraints());
Collections.sort(consPrimary, TieBreaker.CONSTRAINT_COMPARATOR);
consSecondary = new ArrayList<PConstraint>(secondary.getAllEnforcedConstraints());
Collections.sort(consSecondary, TieBreaker.CONSTRAINT_COMPARATOR);
}
/**
* @return the a
*/
public SubPlan getPrimary() {
return primary;
}
/**
* @return the b
*/
public SubPlan getSecondary() {
return secondary;
}
public SubPlan getJoinedPlan(SubPlanFactory factory) {
// check special cases first
if (isTrivial())
return primary;
if (isSubsumption())
return
(consPrimary.size() > consSecondary.size()) ? primary : secondary;
// default case
return factory.createSubPlan(new PJoin(), primary, secondary);
}
@Override
public String toString() {
return primary.toString() + " |x| " + secondary.toString();
}
/**
* @return the varPrimary
*/
public Set<PVariable> getVarPrimary() {
return varPrimary;
}
/**
* @return the varSecondary
*/
public Set<PVariable> getVarSecondary() {
return varSecondary;
}
/**
* @return constraints of primary, sorted according to {@link TieBreaker#CONSTRAINT_COMPARATOR}.
*/
public List<PConstraint> getConsPrimary() {
return consPrimary;
}
/**
* @return constraints of secondary, sorted according to {@link TieBreaker#CONSTRAINT_COMPARATOR}.
*/
public List<PConstraint> getConsSecondary() {
return consSecondary;
}
public boolean isTrivial() {
return getPrimary().equals(getSecondary());
}
public boolean isSubsumption() {
return consPrimary.containsAll(consSecondary) || consSecondary.containsAll(consPrimary);
}
public boolean isCheckOnly() {
return varPrimary.containsAll(varSecondary) || varSecondary.containsAll(varPrimary);
}
public boolean isDescartes() {
return Collections.disjoint(varPrimary, varSecondary);
}
private Boolean heath;
// it is a Heath-join iff common variables functionally determine either all primary or all secondary variables
public boolean isHeath() {
if (heath == null) {
Set<PConstraint> union = Stream.concat(
primary.getAllEnforcedConstraints().stream(),
secondary.getAllEnforcedConstraints().stream()
).collect(Collectors.toSet());
Map<Set<PVariable>, Set<PVariable>> dependencies =
analyzer.getFunctionalDependencies(union, false);
// does varCommon determine either varPrimary or varSecondary?
Set<PVariable> varCommonClosure = FunctionalDependencyHelper.closureOf(varCommon, dependencies);
heath = varCommonClosure.containsAll(varPrimary) || varCommonClosure.containsAll(varSecondary);
}
return heath;
}
}
|
