com.redhat.lightblue.mediator.QueryPlanNodeExecutor Maven / Gradle / Ivy
The newest version!
/*
Copyright 2013 Red Hat, Inc. and/or its affiliates.
This file is part of lightblue.
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see sources=new ArrayList<>();
private final DocIdExtractor docIdx;
private final Finder finder;
private final CompositeMetadata root;
private final List sourceBindings=new ArrayList<>();
private QueryExpression runExpression;
private final Map documentCache;
private final ResolvedReferenceField resolvedReference;
private Long fromIndex;
private Long toIndex;
private List docs=new ArrayList<>();
public QueryPlanNodeExecutor(QueryPlanNode node,
Factory factory,
CompositeMetadata root,
Map documentCache) {
this.node=node;
this.finder=new SimpleFindImpl(node.getMetadata(),factory);
LOGGER.debug("Creating finder for {} for node {}",node.getMetadata().getName(),node.getName());
docIdx=new DocIdExtractor(node.getMetadata());
this.root=root;
this.documentCache=documentCache;
if(node.getMetadata().getParent()!=null) {
resolvedReference=root.getResolvedReferenceOfField(node.getMetadata().getEntityPath());
} else {
resolvedReference=null;
}
LOGGER.debug("ctor {}: resolved reference={}",node.getName(),resolvedReference);
}
public void setRange(Long from,Long to) {
if(node.getMetadata().getParent()==null) {
fromIndex=from;
toIndex=to;
} else
throw new UnsupportedOperationException("Can set range for root node only");
}
public void init(QueryPlan qplan) {
QueryPlanNode[] sourceNodes=node.getSources();
for(QueryPlanNode s:sourceNodes)
sources.add(s.getProperty(QueryPlanNodeExecutor.class));
List queryClauses=new ArrayList<>();
// Rewrite node conjuncts relative to this node
List clauses=node.getData().getConjuncts();
if(clauses!=null) {
RelativeRewriteIterator rritr=new RelativeRewriteIterator(new Path(node.getMetadata().getEntityPath(),
Path.ANYPATH));
for(Conjunct c:clauses) {
if(node.getMetadata().getParent()==null) {
queryClauses.add(c.getClause());
} else {
queryClauses.add(rritr.iterate(c.getClause()));
}
}
}
// Rewrite source edge conjuncts relative to this node, and keep binding information
for(QueryPlanNode d:sourceNodes) {
QueryPlanData edgeData=qplan.getEdgeData(node,d);
if(edgeData!=null) {
List edgeClauses = edgeData.getConjuncts();
if (edgeClauses != null && !edgeClauses.isEmpty()) {
ResolvedFieldBinding.BindResult result = ResolvedFieldBinding.bind(edgeClauses, node, root);
queryClauses.add(result.getRelativeQuery());
sourceBindings.addAll(result.getBindings());
}
}
}
if(queryClauses.size()==1) {
runExpression=queryClauses.get(0);
} else if(queryClauses.size()>0) {
runExpression=new NaryLogicalExpression(NaryLogicalOperator._and,queryClauses);
} else {
runExpression=null;
}
LOGGER.debug("Node expression: {}",runExpression);
}
public void execute(OperationContext ctx,
Sort sort) {
LOGGER.debug("execute {}: start",node.getName());
CRUDFindRequest findRequest=new CRUDFindRequest();
findRequest.setQuery(runExpression);
// TODO: Project only those fields we need
findRequest.setProjection(FieldProjection.ALL);
if(sort!=null) {
findRequest.setSort(sort);
} else if(resolvedReference!=null) {
findRequest.setSort(resolvedReference.getReferenceField().getSort());
}
findRequest.setFrom(fromIndex);
findRequest.setTo(toIndex);
LOGGER.debug("execute {}: findRequest.query={}, projection={}, sort={}", node.getName(),
findRequest.getQuery(),findRequest.getProjection(),findRequest.getSort());
if(sources.isEmpty()) {
execute(ctx,findRequest,null);
} else {
// We will evaluate this node for every possible combination of parent docs
Tuples tuples=new Tuples<>();
for(QueryPlanNodeExecutor source:sources) {
tuples.add(source.docs);
}
// Iterate n-tuples
for(Iterator> tupleItr=tuples.tuples();tupleItr.hasNext();) {
List tuple=tupleItr.next();
LOGGER.debug("Processing an {}-tuple",tuple.size());
// Tuple elements are ordered the same way as the
// sources. tuple[i] is from sources[i]
LOGGER.debug("execute {}: refreshing bindings",node.getName());
Iterator qpdItr = tuple.iterator();
// TODO can this for loop change to a while(qpdItr.hasNext())?
for(int i=0;i getDocs() {
return docs;
}
public void setDocs(List docs) {
this.docs=docs;
}
public QueryPlanNode getNode() {
return node;
}
private void execute(OperationContext ctx,
CRUDFindRequest findRequest,
List parents) {
OperationContext nodeCtx=ctx.getDerivedOperationContext(node.getMetadata().getName(),findRequest);
LOGGER.debug("execute {}: entity={}, findRequest.query={}, projection={}, sort={}", node.getName(),
nodeCtx.getEntityName(),
findRequest.getQuery(),findRequest.getProjection(),findRequest.getSort());
// note the response is not used, but find method changes the supplied context.
finder.find(nodeCtx,findRequest);
LOGGER.debug("execute {}: storing documents", node.getName());
for(DocCtx doc:nodeCtx.getDocuments()) {
DocId id=docIdx.getDocId(doc.getOutputDocument());
if(documentCache!=null) {
JsonDoc jdoc=documentCache.get(id);
if(jdoc==null) {
jdoc=doc.getOutputDocument();
documentCache.put(id,jdoc);
}
}
QueryPlanDoc qplanDoc=new QueryPlanDoc(doc.getOutputDocument(),id,node);
docs.add(qplanDoc);
}
if(parents!=null) {
for(QueryPlanDoc parent:parents) {
parent.addChildren(node,docs);
}
}
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy