Examples of LeftJoin

cascading.pipe.joiner.LeftJoin
Class LeftJoin will return an {@link Iterator} that will iterate over a given {@link Joiner} and return tuples that representa left inner, right outer join of the CoGrouper internal grouped tuple collections.
Note only the farthest right tuple stream will be used as the outer join. All preceding joins to the left will be inner joins. See {@link MixedJoin} for more flexibility.
Joins perform based on the equality of the join keys. In the case of null values, Java treats two null values as equivalent. SQL does not treat null values as equal. To produce SQL like results in a given join, a new {@link java.util.Comparator} will need to be used on the joined values to prevent null fromequaling null. As a convenience, see the {@link cascading.util.NullNotEquivalentComparator} class. @see MixedJoin
org.openrdf.query.algebra.LeftJoin
3.org/TR/rdf-sparql-query/#algLeftJoin">SPARQL Query Language for RDF. @author Arjohn Kampman

Examples of org.openrdf.query.algebra.LeftJoin

      result = new Join(requiredTEs);
    }


    for (OptionalTupleExpr optTE : optionalTEs) {
      if (optTE.hasConstraint()) {
        result = new LeftJoin(result, optTE.getTupleExpr(), optTE.getConstraint());
      }
      else {
        result = new LeftJoin(result, optTE.getTupleExpr());
      }
    }


    for (ValueExpr constraint : constraints) {
      result = new Filter(result, constraint);

View Full Code Here

Examples of org.openrdf.query.algebra.LeftJoin

    List<ValueExpr> constraints = graphPattern.removeAllConstraints();


    TupleExpr leftArg = parentGP.buildTupleExpr();
    TupleExpr rightArg = graphPattern.buildTupleExpr();


    LeftJoin leftJoin;


    if (constraints.isEmpty()) {
      leftJoin = new LeftJoin(leftArg, rightArg);
    }
    else {
      ValueExpr constraint = new And(constraints);


      leftJoin = new LeftJoin(leftArg, rightArg, constraint);
    }


    graphPattern = parentGP;


    graphPattern.clear();

View Full Code Here

Examples of org.openrdf.query.algebra.LeftJoin

      }
    }


    for (OptionalTupleExpr optTE : optionalTEs) {
      if (optTE.hasConstraint()) {
        result = new LeftJoin(result, optTE.getTupleExpr(), optTE.getConstraint());
      }
      else {
        result = new LeftJoin(result, optTE.getTupleExpr());
      }
    }


    for (ValueExpr constraint : constraints) {
      result = new Filter(result, constraint);

View Full Code Here

Examples of org.openrdf.query.algebra.LeftJoin

        result = new Join(result, requiredTEs.get(i));
      }
    }


    for (TupleExpr optTE : optionalTEs) {
      result = new LeftJoin(result, optTE);
    }


    for (ValueExpr constraint : constraints) {
      result = new Filter(result, constraint);
    }

View Full Code Here

Examples of org.openrdf.query.algebra.LeftJoin

    List<ValueExpr> constraints = graphPattern.removeAllConstraints();


    TupleExpr leftArg = parentGP.buildTupleExpr();
    TupleExpr rightArg = graphPattern.buildTupleExpr();


    LeftJoin leftJoin;


    if (constraints.isEmpty()) {
      leftJoin = new LeftJoin(leftArg, rightArg);
    }
    else {
      ValueExpr constraint = constraints.get(0);
      for (int i = 1; i < constraints.size(); i++) {
        constraint = new And(constraint, constraints.get(i));
      }


      leftJoin = new LeftJoin(leftArg, rightArg, constraint);
    }


    graphPattern = parentGP;


    graphPattern.clear();

View Full Code Here

0 1

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.