Package lupos.engine.operators.multiinput.join

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

641
642
643
644
645
646
647
648
649
650
651
      final Filter f2 = new Filter(filter2);
      final Generate g = new Generate(tp, a, b, c);
      final Join join = new Join();
      f1.addSucceedingOperator(new OperatorIDTuple(join, 0));
      f2.addSucceedingOperator(new OperatorIDTuple(join, 1));
      join.addSucceedingOperator(new OperatorIDTuple(g, 0));
      tp1.setSucceedingOperator(new OperatorIDTuple(f1, 0));
      tp2.setSucceedingOperator(new OperatorIDTuple(f2, 0));
      final Collection<TriplePattern> ctp1 = new LinkedList<TriplePattern>();
      ctp1.add(tp1);
      ic.addSucceedingOperator(new OperatorIDTuple(ic.newIndexScan(
View Full Code Here
667
668
669
670
671
672
673
674
675
676
677
    try {
      final Filter f1 = new Filter(filter1);
      final Generate g = new Generate(tp, a, b, c);
      final Join join = new Join();
      f1.addSucceedingOperator(new OperatorIDTuple(join, 0));
      join.addSucceedingOperator(new OperatorIDTuple(g, 0));
      tp1.setSucceedingOperator(new OperatorIDTuple(f1, 0));
      tp2.setSucceedingOperator(new OperatorIDTuple(join, 1));
      final Collection<TriplePattern> ctp1 = new LinkedList<TriplePattern>();
      ctp1.add(tp1);
      ic.addSucceedingOperator(new OperatorIDTuple(ic.newIndexScan(
View Full Code Here
560
561
562
563
564
565
566
567
568
569
570
           * succeeding list of the index scan, because when we
           * removed the connection and added the join, the list would
           * have no content)
           */
          for (OperatorIDTuple op : bisSucc) {
            smallJoin.addSucceedingOperator(op);
            op.getOperator().addPrecedingOperator(smallJoin);
          }
          /*
           * now connect the UNION with the result of the 1st subgraph
           * container. In this UNION all partitions are to be
View Full Code Here
77
78
79
80
81
82
83
84
85
86
87
        this.currentPatternMatcher.add(tp);
        tp.addSucceedingOperator(new OperatorIDTuple(join, i));
        i++;
      }
      if(opID!=null) {
        join.addSucceedingOperator(opID);
      }
      return join;
    } else if(triplePatterns.size()==1){
      final TriplePattern tp = triplePatterns.iterator().next();
      if(opID!=null) {
View Full Code Here
523
524
525
526
527
528
529
530
531
532
533
        final Join intermediateJoinOperator = new Join();
        replaceVar.addSucceedingOperator(new OperatorIDTuple(memoryDistinct,0));
        memoryDistinct.addSucceedingOperator(new OperatorIDTuple(intermediateJoinOperator,1));
        filter.addSucceedingOperator(new OperatorIDTuple(intermediateJoinOperator,0));
        filter.addSucceedingOperator(new OperatorIDTuple(replaceVar,0));
        intermediateJoinOperator.addSucceedingOperator(new OperatorIDTuple(replaceVari,0));
        replaceVari.addSucceedingOperator(new OperatorIDTuple(replaceVar,0));
        replaceVari.addSucceedingOperator(connection.getOperatorIDTuple());

        if(subjectIsALiteral && !objectIsALiteral){
          final Filter firstFilter = new Filter("(" + subject + " = " + realSubject +")");
View Full Code Here
772
773
774
775
776
777
778
779
780
781
782
        final Join intermediateJoinOperator = new Join();
        replaceVar.addSucceedingOperator(new OperatorIDTuple(memoryDistinct,0));
        memoryDistinct.addSucceedingOperator(new OperatorIDTuple(intermediateJoinOperator,1));
        filter.addSucceedingOperator(new OperatorIDTuple(intermediateJoinOperator,0));
        filter.addSucceedingOperator(new OperatorIDTuple(replaceVar,0));
        intermediateJoinOperator.addSucceedingOperator(new OperatorIDTuple(replaceVari,0));
        replaceVari.addSucceedingOperator(new OperatorIDTuple(replaceVar,0));
        replaceVari.addSucceedingOperator(new OperatorIDTuple(union,1));
        union.addSucceedingOperator(new OperatorIDTuple(projection,0));

        //Zero Operator
View Full Code Here
926
927
928
929
930
931
932
933
934
935
936
        final Join intermediateJoinOperator = new Join();
        replaceVar.addSucceedingOperator(new OperatorIDTuple(memoryDistinct,0));
        memoryDistinct.addSucceedingOperator(new OperatorIDTuple(intermediateJoinOperator,1));
        filter.addSucceedingOperator(new OperatorIDTuple(intermediateJoinOperator,0));
        filter.addSucceedingOperator(new OperatorIDTuple(replaceVar,0));
        intermediateJoinOperator.addSucceedingOperator(new OperatorIDTuple(replaceVari,0));
        replaceVari.addSucceedingOperator(new OperatorIDTuple(replaceVar,0));
        replaceVari.addSucceedingOperator(new OperatorIDTuple(projection,0));

      } catch (final ParseException e) {
        System.out.println(e);
View Full Code Here
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
    projection.addProjectionElement(subject);
    projection.addProjectionElement(object);
    if(graphConstraint!=null && graphConstraint.isVariable() && !graphConstraint.equals(getItem(subjectNode)) && !graphConstraint.equals(getItem(objectNode))) {
      projection.addProjectionElement((Variable)graphConstraint);
    }
    join.addSucceedingOperator(new OperatorIDTuple(projection,0));
    return projection;
  }


  @Override
View Full Code Here
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
      if (node.jjtGetChild(i) instanceof ASTBindings) {

        // Inserting the join operation
        final ComputeBindings computeBindings = new ComputeBindings(this.getQueryResultFromValuesClause((ASTBindings)node.jjtGetChild(i)));
        final Join join = new Join();
        join.addSucceedingOperator(this.result);

        computeBindings.addSucceedingOperator(new OperatorIDTuple(join,1));

        this.indexScanCreator.createEmptyIndexScanAndConnectWithRoot(new OperatorIDTuple(computeBindings, 0));
        lastOperator = join;
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.