use of annis.sqlgen.model.CommonAncestor in project ANNIS by korpling.
the class TestDefaultWhereClauseGenerator method shouldSkipToplevelCorpusPredicateForCommonAncestorIfCorpusListIsNull.
/**
* The common ancestor operator should skip the predicate on toplevel_corpus
* in the EXISTS subquery if the corpus list is NULL.
*/
@Theory
public void shouldSkipToplevelCorpusPredicateForCommonAncestorIfCorpusListIsNull(String componentPredicate) {
// given
generator.setUseToplevelCorpusPredicateInCommonAncestorSubquery(true);
given(queryData.getCorpusList()).willReturn(null);
node23.addOutgoingJoin(new CommonAncestor(node42));
// then
checkEdgeConditions(componentPredicate, "d", null, true, "EXISTS (SELECT 1 FROM (SELECT * FROM facts LIMIT 0) AS ancestor WHERE" + "\n\t" + "ancestor.pre < _rank23.pre AND _rank23.pre < ancestor.post AND" + "\n\t" + "ancestor.pre < _rank42.pre AND _rank42.pre < ancestor.post" + "\n\t" + "LIMIT 1)", join("<>", "_node23.id", "_node42.id"));
}
use of annis.sqlgen.model.CommonAncestor in project ANNIS by korpling.
the class TestDefaultWhereClauseGenerator method shouldUseToplevelCorpusPredicateForCommonAncestor.
/**
* The common ancestor operator may optionally use a predicate on toplevel_corpus
* in the EXISTS subquery.
*/
@Theory
public void shouldUseToplevelCorpusPredicateForCommonAncestor(String componentPredicate) {
// given
generator.setUseToplevelCorpusPredicateInCommonAncestorSubquery(true);
long corpusId = uniqueLong();
given(queryData.getCorpusList()).willReturn(asList(corpusId));
node23.addOutgoingJoin(new CommonAncestor(node42));
// then
checkEdgeConditions(componentPredicate, "d", null, true, "EXISTS (SELECT 1 FROM facts_" + corpusId + " AS ancestor WHERE" + "\n\t" + "ancestor.pre < _rank23.pre AND _rank23.pre < ancestor.post AND" + "\n\t" + "ancestor.pre < _rank42.pre AND _rank42.pre < ancestor.post AND toplevel_corpus IN(" + corpusId + ")" + "\n\t" + "LIMIT 1)", join("<>", "_node23.id", "_node42.id"));
}
use of annis.sqlgen.model.CommonAncestor in project ANNIS by korpling.
the class AbstractWhereClauseGenerator method whereConditions.
@Override
public Set<String> whereConditions(QueryData queryData, List<QueryNode> alternative, String indent) {
List<String> conditions = new ArrayList<>();
for (QueryNode node : alternative) {
// node constraints
if (node.getSpannedText() != null) {
addSpanConditions(conditions, queryData, node);
}
if (node.isToken()) {
addIsTokenConditions(conditions, queryData, node);
}
if (node.isRoot()) {
addIsRootConditions(conditions, queryData, node);
}
if (node.getArity() != null) {
addNodeArityConditions(conditions, queryData, node);
}
if (node.getTokenArity() != null) {
addTokenArityConditions(conditions, queryData, node);
}
// node joins
for (Join join : node.getOutgoingJoins()) {
QueryNode target = join.getTarget();
if (join instanceof SameSpan) {
addSameSpanConditions(conditions, node, target, (SameSpan) join, queryData);
} else if (join instanceof Identical) {
addIdenticalConditions(conditions, node, target, (Identical) join, queryData);
} else if (join instanceof LeftAlignment) {
addLeftAlignmentConditions(conditions, node, target, (LeftAlignment) join, queryData);
} else if (join instanceof RightAlignment) {
addRightAlignmentConditions(conditions, node, target, (RightAlignment) join, queryData);
} else if (join instanceof Inclusion) {
addInclusionConditions(conditions, node, target, (Inclusion) join, queryData);
} else if (join instanceof Overlap) {
addOverlapConditions(conditions, node, target, (Overlap) join, queryData);
} else if (join instanceof LeftOverlap) {
addLeftOverlapConditions(conditions, target, node, (LeftOverlap) join, queryData);
} else if (join instanceof RightOverlap) {
addRightOverlapConditions(conditions, target, node, (RightOverlap) join, queryData);
} else if (join instanceof Precedence) {
addPrecedenceConditions(conditions, node, target, (Precedence) join, queryData);
} else if (join instanceof Near) {
addNearConditions(conditions, node, target, (Near) join, queryData);
} else if (join instanceof Sibling) {
addSiblingConditions(conditions, node, target, (Sibling) join, queryData);
} else if (join instanceof CommonAncestor) {
addCommonAncestorConditions(conditions, node, target, (CommonAncestor) join, queryData);
} else if (join instanceof LeftDominance) {
addLeftDominanceConditions(conditions, node, target, (LeftDominance) join, queryData);
} else if (join instanceof RightDominance) {
addRightDominanceConditions(conditions, node, target, (RightDominance) join, queryData);
} else if (join instanceof Dominance) {
addDominanceConditions(conditions, node, target, (Dominance) join, queryData);
} else if (join instanceof PointingRelation) {
addPointingRelationConditions(conditions, node, target, (PointingRelation) join, queryData);
} else if (join instanceof EqualValue) {
addEqualValueConditions(conditions, node, target, (EqualValue) join, queryData);
} else if (join instanceof NotEqualValue) {
addNotEqualValueConditions(conditions, node, target, (NotEqualValue) join, queryData);
}
}
// node annotations
int i = 0;
for (QueryAnnotation annotation : node.getNodeAnnotations()) {
++i;
addAnnotationConditions(conditions, node, i, annotation, NODE_ANNOTATION_TABLE, queryData);
}
// relation annotations
int j = 0;
for (QueryAnnotation annotation : node.getEdgeAnnotations()) {
++j;
addAnnotationConditions(conditions, node, j, annotation, EDGE_ANNOTATION_TABLE, queryData);
}
}
return new HashSet<>(conditions);
}
Aggregations