Package lupos.engine.operators.multiinput

Examples of lupos.engine.operators.multiinput.Union.addPrecedingOperator()

103
104
105
106
107
108
109
110
111
112
113
        firstTime = false;
      } else {
        // clone join operator plus its other operands
        joinNew = new Join();
        added.add(joinNew);
        union.addPrecedingOperator(joinNew);

        for (final OperatorIDTuple oid : precedingOperatorsJoin) {
          final BasicOperator toClone = oid.getOperator();
          final BasicOperator clone = toClone.clone();
          added.add(clone);
View Full Code Here
73
74
75
76
77
78
79
80
81
82
83
    BasicOperator pre;
    for (int i = 0; i < pres.size(); i++) {
      pre = pres.get(i);
      pre.addSucceedingOperator(new OperatorIDTuple(union, index));
      pre.removeSucceedingOperator(genAdd);
      union.addPrecedingOperator(pre);
    }

    union.removePrecedingOperator(genAdd);
    union.setSucceedingOperator(new OperatorIDTuple(genAdd, 0));
View Full Code Here
73
74
75
76
77
78
79
80
81
82
83
    BasicOperator pre;
    // Connect the precessors of the ReplaceLit directly to the Union
    for (int i = 0; i < pres.size(); i++) {
      pre = pres.get(i);
      union.addPrecedingOperator(pre);
      pre.removeSucceedingOperator(replaceLit);
      pre.addSucceedingOperator(new OperatorIDTuple(union, index));
    }
    union.removePrecedingOperator(replaceLit);
View Full Code Here
568
569
570
571
572
573
574
575
576
577
578
          /*
           * now connect the UNION with the result of the 1st subgraph
           * container. In this UNION all partitions are to be
           * combined.
           */
          union_new.addPrecedingOperator(sg1);
          OperatorIDTuple unionIDOperator = new OperatorIDTuple(
              union_new, countingUnions++);
          sg1.addSucceedingOperator(unionIDOperator);

          /*
 
View Full Code Here
889
890
891
892
893
894
895
896
897
898
899
      // index -> (union -> distinct) <- triplepattern : return union
//      Distinct distinct = new Distinct();
      final Union union = new Union();
//      union.setSucceedingOperator(new OperatorIDTuple(distinct, 0));
      index.setSucceedingOperator(new OperatorIDTuple(union, 0));
      union.addPrecedingOperator(index);
//      distinct.setSucceedingOperator((OperatorIDTuple) arg);
      pattern.setSucceedingOperator(new OperatorIDTuple(union, 1));
      union.addPrecedingOperator(pattern);
      for(final KeyTriplePattern keyTP: possibleMatchingKeysOfProducers){
        this.add(this.tripleConsumer, keyTP, pattern);
View Full Code Here
892
893
894
895
896
897
898
899
900
901
902
//      union.setSucceedingOperator(new OperatorIDTuple(distinct, 0));
      index.setSucceedingOperator(new OperatorIDTuple(union, 0));
      union.addPrecedingOperator(index);
//      distinct.setSucceedingOperator((OperatorIDTuple) arg);
      pattern.setSucceedingOperator(new OperatorIDTuple(union, 1));
      union.addPrecedingOperator(pattern);
      for(final KeyTriplePattern keyTP: possibleMatchingKeysOfProducers){
        this.add(this.tripleConsumer, keyTP, pattern);
      }
//      return distinct;
      if(arg!=null){
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.