Package lupos.engine.operators.singleinput

Examples of lupos.engine.operators.singleinput.Projection.addProjectionElement()

59
60
61
62
63
64
65
66
67
68
69
      connection.connect(join);
      SeveralSucceedingOperators sso = new SeveralSucceedingOperators();
      sso.addSucceedingOperator(join, 0);
      FederatedQueryTrivialApproach federatedQuery = new FederatedQueryTrivialApproach(node);
      Projection projection = new Projection();
      projection.addProjectionElement(new Variable(((ASTVar)child0).getName()));
      Distinct distinct = new Distinct();
      projection.addSucceedingOperator(distinct);
      distinct.addSucceedingOperator(federatedQuery);
      sso.addSucceedingOperator(projection, 0);
      federatedQuery.addSucceedingOperator(join, 1);
View Full Code Here
80
81
82
83
84
85
86
87
88
89
90
    // Enhance projection variables by left tuple variables of ReplaceVar
    final LinkedList<Variable> vars = replaceVar
        .getSubstitutionsVariableLeft();
    for (int i = 0; i < vars.size(); i++) {
      if (!projection.getProjectedVariables().contains(vars.get(i))) {
        projection.addProjectionElement(vars.get(i));
      }
    }

    final LinkedList<BasicOperator> pres = (LinkedList<BasicOperator>) projection
        .getPrecedingOperators();
View Full Code Here
119
120
121
122
123
124
125
126
127
128
129
    final LinkedList<Variable> replaceVarsRight = replacePre
        .getSubstitutionsVariableRight();

    // Let the tupel from the new ReplaceVar through
    for (int i = 0; i < replaceVarsLeft.size(); i++) {
      projectionPre.addProjectionElement(replaceVarsLeft.get(i));
    }

    // Let all UNION-Variable through, but not the ones which the new
    // ReplaceVar has replaced (right side)
    final LinkedList<Variable> projVars = new LinkedList<Variable>();
View Full Code Here
134
135
136
137
138
139
140
141
142
143
144
      }
    }

    // Add the calculated variables to the new projection
    for (int i = 0; i < projVars.size(); i++) {
      projectionPre.addProjectionElement(projVars.get(i));
    }

    return projectionPre;
  }
View Full Code Here
679
680
681
682
683
684
685
686
687
688
689
      final BasicOperator leftSide = this.zeroPath(node, graphConstraint, subject, object, subjectNode, objectNode);
      leftSide.addSucceedingOperator(new OperatorIDTuple(union,0));

      final Projection projection = new Projection();
      projection.addProjectionElement(subject);
      projection.addProjectionElement(object);
      if(graphConstraint!=null && graphConstraint.isVariable() && !graphConstraint.equals(getItem(subjectNode)) && !graphConstraint.equals(getItem(objectNode))) {
        projection.addProjectionElement((Variable)graphConstraint);
      }
View Full Code Here
680
681
682
683
684
685
686
687
688
689
690
      final BasicOperator leftSide = this.zeroPath(node, graphConstraint, subject, object, subjectNode, objectNode);
      leftSide.addSucceedingOperator(new OperatorIDTuple(union,0));

      final Projection projection = new Projection();
      projection.addProjectionElement(subject);
      projection.addProjectionElement(object);
      if(graphConstraint!=null && graphConstraint.isVariable() && !graphConstraint.equals(getItem(subjectNode)) && !graphConstraint.equals(getItem(objectNode))) {
        projection.addProjectionElement((Variable)graphConstraint);
      }

      startingOperator.addSucceedingOperator(new OperatorIDTuple(union,1));
View Full Code Here
682
683
684
685
686
687
688
689
690
691
692
      final Projection projection = new Projection();
      projection.addProjectionElement(subject);
      projection.addProjectionElement(object);
      if(graphConstraint!=null && graphConstraint.isVariable() && !graphConstraint.equals(getItem(subjectNode)) && !graphConstraint.equals(getItem(objectNode))) {
        projection.addProjectionElement((Variable)graphConstraint);
      }

      startingOperator.addSucceedingOperator(new OperatorIDTuple(union,1));

      union.addSucceedingOperator(new OperatorIDTuple(projection,0));
View Full Code Here
740
741
742
743
744
745
746
747
748
749
750
      // Plus Operator
      final BasicOperator startingOperator = node.jjtGetChild(0).accept(this, connection, graphConstraint, subject, object, subjectNode, objectNode);

      final Projection projection = new Projection();
      projection.addProjectionElement(subject);
      projection.addProjectionElement(object);
      if(graphConstraint!=null && graphConstraint.isVariable() && !graphConstraint.equals(getItem(subjectNode)) && !graphConstraint.equals(getItem(objectNode))) {
        projection.addProjectionElement((Variable)graphConstraint);
      }
View Full Code Here
741
742
743
744
745
746
747
748
749
750
751
      // Plus Operator
      final BasicOperator startingOperator = node.jjtGetChild(0).accept(this, connection, graphConstraint, subject, object, subjectNode, objectNode);

      final Projection projection = new Projection();
      projection.addProjectionElement(subject);
      projection.addProjectionElement(object);
      if(graphConstraint!=null && graphConstraint.isVariable() && !graphConstraint.equals(getItem(subjectNode)) && !graphConstraint.equals(getItem(objectNode))) {
        projection.addProjectionElement((Variable)graphConstraint);
      }

      final Union union = new Union();
View Full Code Here
743
744
745
746
747
748
749
750
751
752
753
      final Projection projection = new Projection();
      projection.addProjectionElement(subject);
      projection.addProjectionElement(object);
      if(graphConstraint!=null && graphConstraint.isVariable() && !graphConstraint.equals(getItem(subjectNode)) && !graphConstraint.equals(getItem(objectNode))) {
        projection.addProjectionElement((Variable)graphConstraint);
      }

      final Union union = new Union();
      final InMemoryDistinct memoryDistinct = new InMemoryDistinct();
      try {
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
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.