Package lupos.engine.operators.multiinput.join

Examples of lupos.engine.operators.multiinput.join.Join.addPrecedingOperator()

108
109
110
111
112
113
114
115
116
117
    join.setIntersectionVariables(inp.getJoinPartner());
    join.setUnionVariables(inp.getVariables());
    left.setSucceedingOperator(new OperatorIDTuple(join, 0));
    right.setSucceedingOperator(new OperatorIDTuple(join, 1));
    join.addPrecedingOperator(left);
    join.addPrecedingOperator(right);
    return join;
  }
}
View Full Code Here
109
110
111
112
113
114
115
116
117
    join.setIntersectionVariables(inp.getJoinPartner());
    join.setUnionVariables(inp.getVariables());
    left.setSucceedingOperator(new OperatorIDTuple(join, 0));
    right.setSucceedingOperator(new OperatorIDTuple(join, 1));
    join.addPrecedingOperator(left);
    join.addPrecedingOperator(right);
    return join;
  }
}
View Full Code Here
370
371
372
373
374
375
376
377
378
379
380
      last.setUnionVariables(llv);
    }
    if (!(join instanceof NAryMergeJoinWithoutSorting)) {
      left.setSucceedingOperator(new OperatorIDTuple(join, 0));
      right.setSucceedingOperator(new OperatorIDTuple(join, 1));
      join.addPrecedingOperator(left);
      join.addPrecedingOperator(right);
    }
    return last;
  }
}
View Full Code Here
371
372
373
374
375
376
377
378
379
380
    }
    if (!(join instanceof NAryMergeJoinWithoutSorting)) {
      left.setSucceedingOperator(new OperatorIDTuple(join, 0));
      right.setSucceedingOperator(new OperatorIDTuple(join, 1));
      join.addPrecedingOperator(left);
      join.addPrecedingOperator(right);
    }
    return last;
  }
}
View Full Code Here
69
70
71
72
73
74
75
76
77
78
79
            .next().getUnionVariables());
        for (final TriplePattern tp : tsi.getTriplePattern()) {
          final LinkedList<OperatorIDTuple> succeedingOperatorsTP = new LinkedList<OperatorIDTuple>();
          succeedingOperatorsTP.add(new OperatorIDTuple(j, i));
          tp.addSucceedingOperators(succeedingOperatorsTP);
          j.addPrecedingOperator(tp);
          pm.add(tp);
          tp.addPrecedingOperator(pm);
          unionVariables.addAll(tp.getUnionVariables());
          intersectionVariables.retainAll(tp.getUnionVariables());
          i++;
View Full Code Here
89
90
91
92
93
94
95
96
97
98
99
    BasicOperator pre;
    for (int i = 0; i < pres.size(); i++) {
      pre = pres.get(i);
      pre.addSucceedingOperator(new OperatorIDTuple(join, index));
      pre.removeSucceedingOperator(genAdd);
      join.addPrecedingOperator(pre);
    }

    join.removePrecedingOperator(genAdd);
    join.setSucceedingOperator(new OperatorIDTuple(genAdd, 0));
View Full Code Here
439
440
441
442
443
444
445
446
447
448
449
                      } else {
                        sip_op.addSucceedingOperators(bo.getSucceedingOperators());
                        sip_op.setPrecedingOperator(bo);
                        bo.setSucceedingOperator(new OperatorIDTuple(sip_op, 0));
                        join.removePrecedingOperator(bo);
                        join.addPrecedingOperator(sip_op);
                      }
                    }
                  }
                }
              }
View Full Code Here
549
550
551
552
553
554
555
556
557
558
559
           * connect the basic index scan and the 2nd subgraph
           * container in the join-operator in the 1st subgraph
           * container
           */
          bis.addSucceedingOperator(smallJoin, 0);
          smallJoin.addPrecedingOperator(sg2);
          sg2.addSucceedingOperator(smallJoin, 1);
          smallJoin.addPrecedingOperator(bis);
          /*
           * now connect the join with the succeeding operators of the
           * old basic index scan (here we use the hack, to clone the
View Full Code Here
551
552
553
554
555
556
557
558
559
560
561
           * container
           */
          bis.addSucceedingOperator(smallJoin, 0);
          smallJoin.addPrecedingOperator(sg2);
          sg2.addSucceedingOperator(smallJoin, 1);
          smallJoin.addPrecedingOperator(bis);
          /*
           * now connect the join with the succeeding operators of the
           * old basic index scan (here we use the hack, to clone the
           * succeeding list of the index scan, because when we
           * removed the connection and added the join, the list would
View Full Code Here
131
132
133
134
135
136
137
138
139
140
141
      BasicOperator pre;
      for (int i = 0; i < pres.size(); i++) {
        pre = pres.get(i);
        pre.addSucceedingOperator(new OperatorIDTuple(join, index));
        pre.removeSucceedingOperator(replaceLit);
        join.addPrecedingOperator(pre);
      }
      join.removePrecedingOperator(replaceLit);
      deleted.add(replaceLit);
    }
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.