com.bigdata.bop.join.HashIndexOpBase Maven / Gradle / Ivy
/**
Copyright (C) SYSTAP, LLC DBA Blazegraph 2006-2016. All rights reserved.
Contact:
SYSTAP, LLC DBA Blazegraph
2501 Calvert ST NW #106
Washington, DC 20008
[email protected]
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; version 2 of the License.
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, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
/*
* Created on Aug 19, 2015
*/
package com.bigdata.bop.join;
import java.util.Map;
import java.util.concurrent.Callable;
import java.util.concurrent.FutureTask;
import com.bigdata.bop.BOp;
import com.bigdata.bop.BOpContext;
import com.bigdata.bop.IBindingSet;
import com.bigdata.bop.ILocatableResourceAnnotations;
import com.bigdata.bop.IQueryAttributes;
import com.bigdata.bop.ISingleThreadedOp;
import com.bigdata.bop.IVariable;
import com.bigdata.bop.NV;
import com.bigdata.bop.PipelineOp;
import com.bigdata.bop.controller.INamedSolutionSetRef;
import com.bigdata.bop.controller.NamedSetAnnotations;
import com.bigdata.bop.engine.BOpStats;
import com.bigdata.htree.HTree;
import cutthecrap.utils.striterators.ICloseableIterator;
import cutthecrap.utils.striterators.SingleValueIterator;
/**
* Base class for operators that use a hash index.
*
* @see BLZG-1438
*
* @author Olaf Hartig
*/
abstract public class HashIndexOpBase extends PipelineOp implements ISingleThreadedOp {
/**
*
*/
private static final long serialVersionUID = 1L;
public interface Annotations extends HashJoinAnnotations, JoinAnnotations,
NamedSetAnnotations, ILocatableResourceAnnotations {
/**
* A mandatory attribute specifying the {@link IHashJoinUtilityFactory}
* from which this operator obtains a {@link IHashJoinUtility} to be
* used by this operator. This factory is invoked once, the first time
* this operator is evaluated. The obtained {@link IHashJoinUtility}
* reference is attached to the {@link IQueryAttributes} and accessed
* there on subsequent evaluation passes for this operator.
*/
final String HASH_JOIN_UTILITY_FACTORY = HashIndexOpBase.class.getName() + ".utilFactory";
/**
* An optional attribute specifying the source named solution
* set for the index build operation. Normally, the hash index is built
* from the solutions flowing through the pipeline. When this attribute
* is specified, the hash index is instead built from the solutions in
* the specified named solution set. Regardless, the solutions flowing
* through the pipeline are copied to the sink once the hash index has
* been built.
*/
final String NAMED_SET_SOURCE_REF = "namedSetSourceRef";
/**
* An optional attribute specifying the source IBindingSet[]
* for the index build operation. Normally, the hash index is built from
* the solutions flowing through the pipeline. When this attribute is
* specified, the hash index is instead built from the solutions in the
* specified IBindingSet[]. Regardless, the solutions flowing through
* the pipeline are copied to the sink once the hash index has been
* built.
*/
final String BINDING_SETS_SOURCE = "bindingSets";
}
/**
* Deep copy constructor.
*/
protected HashIndexOpBase(final HashIndexOpBase op) {
super(op);
}
/**
* Shallow copy constructor.
*
* @param args
* @param annotations
*/
protected HashIndexOpBase(final BOp[] args, final Map annotations) {
super(args, annotations);
/*
* The basic constraint is that the hash index needs to be available
* where it will be consumed. Thus, ANY is not an appropriate evaluation
* context since the hash index would be built at whatever node had a
* given intermediate solution. However, any evaluation context which
* establishes a predictable relationship between the join variables and
* the hash index partition should work. The CONTROLLER always works,
* but the index will be built and consumed on the controller.
*/
switch (getEvaluationContext()) {
case CONTROLLER:
case SHARDED:
case HASHED:
break;
default:
throw new IllegalArgumentException(
BOp.Annotations.EVALUATION_CONTEXT + "="
+ getEvaluationContext());
}
/*
* This operator writes on an object that is not thread-safe for
* mutation.
*/
assertMaxParallelOne();
if (!isLastPassRequested()) {
/*
* Last pass evaluation must be requested. This operator will not
* produce any outputs until all source solutions have been
* buffered.
*/
throw new IllegalArgumentException(PipelineOp.Annotations.LAST_PASS
+ "=" + isLastPassRequested());
}
getRequiredProperty(Annotations.NAMED_SET_REF);
@SuppressWarnings("unused")
final JoinTypeEnum joinType = (JoinTypeEnum) getRequiredProperty(Annotations.JOIN_TYPE);
@SuppressWarnings("unused")
final IHashJoinUtilityFactory factory = (IHashJoinUtilityFactory) getRequiredProperty(Annotations.HASH_JOIN_UTILITY_FACTORY);
// Join variables must be specified.
final IVariable[] joinVars = (IVariable[]) getRequiredProperty(Annotations.JOIN_VARS);
getRequiredProperty(Annotations.RELATION_NAME);
for (IVariable var : joinVars) {
if (var == null)
throw new IllegalArgumentException(Annotations.JOIN_VARS);
}
}
protected HashIndexOpBase(final BOp[] args, final NV... annotations) {
this(args, NV.asMap(annotations));
}
@Override
public BOpStats newStats() {
return new NamedSolutionSetStats();
}
@Override
public FutureTask eval(final BOpContext context) {
return new FutureTask(createChunkTask(context));
}
abstract protected ChunkTaskBase createChunkTask(final BOpContext context);
/**
* Evaluates the subquery for each source binding set. If the controller
* operator is interrupted, then the subqueries are cancelled. If a subquery
* fails, then all subqueries are cancelled.
*/
abstract protected static class ChunkTaskBase implements Callable {
protected final BOpContext context;
protected final HashIndexOpBase op;
protected final NamedSolutionSetStats stats;
protected final IHashJoinUtility state;
/**
* true iff this is the first invocation of this operator.
*/
protected final boolean first;
/**
* true iff the hash index will be generated from the
* intermediate solutions arriving from the pipeline. When
* false, the
* {@link HashIndexOpBase.Annotations#NAMED_SET_SOURCE_REF} identifies
* the source from which the index will be built.
*/
protected final boolean sourceIsPipeline;
public ChunkTaskBase(final HashIndexOpBase op,
final BOpContext context) {
if (op == null)
throw new IllegalArgumentException();
if (context == null)
throw new IllegalArgumentException();
this.context = context;
this.op = op;
this.stats = ((NamedSolutionSetStats) context.getStats());
// Metadata to identify the target named solution set.
final INamedSolutionSetRef namedSetRef = (INamedSolutionSetRef) op
.getRequiredProperty(Annotations.NAMED_SET_REF);
{
/*
* First, see if the map already exists.
*
* Note: Since the operator is not thread-safe, we do not need
* to use a putIfAbsent pattern here.
*/
/*
* Lookup the attributes for the query on which we will hang the
* solution set. See BLZG-1493 (if queryId is null, use the query
* attributes for this running query).
*/
final IQueryAttributes attrs = context.getQueryAttributes(namedSetRef.getQueryId());
IHashJoinUtility state = (IHashJoinUtility) attrs
.get(namedSetRef);
if (state == null) {
final JoinTypeEnum joinType = (JoinTypeEnum) op
.getRequiredProperty(Annotations.JOIN_TYPE);
final IHashJoinUtilityFactory factory =
(IHashJoinUtilityFactory) op.getRequiredProperty(
Annotations.HASH_JOIN_UTILITY_FACTORY);
state = factory.create(context, namedSetRef, op, joinType);
if (attrs.putIfAbsent(namedSetRef, state) != null)
throw new AssertionError();
first = true;
} else {
first = false;
}
this.state = state;
}
// true iff we will build the index from the pipeline.
this.sourceIsPipeline //
= (op.getProperty(Annotations.NAMED_SET_SOURCE_REF) == null)
&& (op.getProperty(Annotations.BINDING_SETS_SOURCE) == null)
;
}
/**
* Add solutions to the hash index. The solutions to be indexed will be
* read either from the pipeline or from an "alternate" source
* identified by an annotation.
*
* @see HashIndexOpBase.Annotations#NAMED_SET_SOURCE_REF
*/
protected void acceptSolutions() {
final ICloseableIterator src;
if (sourceIsPipeline) {
src = context.getSource();
} else if (op.getProperty(Annotations.NAMED_SET_SOURCE_REF) != null) {
/*
* Metadata to identify the optional *source* solution set. When
* null, the hash index is built from the solutions flowing
* through the pipeline. When non-null, the hash index is
* built from the solutions in the identifier solution set.
*/
final INamedSolutionSetRef namedSetSourceRef = (INamedSolutionSetRef) op
.getRequiredProperty(Annotations.NAMED_SET_SOURCE_REF);
src = context.getAlternateSource(namedSetSourceRef);
} else if (op.getProperty(Annotations.BINDING_SETS_SOURCE) != null) {
/*
* The IBindingSet[] is directly given. Just wrap it up as an
* iterator. It will visit a single chunk of solutions.
*/
final IBindingSet[] bindingSets = (IBindingSet[]) op
.getProperty(Annotations.BINDING_SETS_SOURCE);
src = new SingleValueIterator(bindingSets);
} else {
throw new UnsupportedOperationException(
"Source was not specified");
}
try {
state.acceptSolutions(src, stats);
} finally {
src.close();
}
}
/**
* Checkpoint and save the solution set.
*
* Note: We must checkpoint the solution set before we output anything.
* Otherwise the chunks output by this operator could appear at the
* {@link SolutionSetHashJoinOp} before this operator is done and it
* would have the mutable view of the {@link HTree} rather than the
* concurrent read-only view of the {@link HTree}.
*/
protected void checkpointSolutionSet() {
state.saveSolutionSet();
}
} // ControllerTask
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy