Package lupos.engine.operators.multiinput

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

637
638
639
640
641
642
643
644
645
646
647
    // and add the new union
    List<OperatorIDTuple> succeddingsOfAll = this.join1
        .getSucceedingOperators();
    for (OperatorIDTuple _child : succeddingsOfAll) {
      _child.getOperator().removePrecedingOperator(this.join1);
      union_new.addSucceedingOperator(_child);
      _child.getOperator().addPrecedingOperator(union_new);
    }
    // delete unreachable operators...
    this.deleteOperatorWithoutParentsRecursive(this.join1, _startNodes);
    this.deleteOperatorWithoutParentsRecursive(this.union1, _startNodes);
View Full Code Here
635
636
637
638
639
640
641
642
643
644
645
    if (resultOps.size() == 1) {
      return resultOps.iterator().next();
    } else {
      final Union union = new Union();
      for (final BasicOperator op : resultOps){
        union.addSucceedingOperator(op);
        op.addPrecedingOperator(union);
      }
      return union;
    }
  }
View Full Code Here
666
667
668
669
670
671
672
673
674
675
676
      final Union union = new Union();
      zeroOperator.addSucceedingOperator(new OperatorIDTuple(union,0));
      startingOperator.addSucceedingOperator(new OperatorIDTuple(union,1));

      final InMemoryDistinct distinct = new InMemoryDistinct();
      union.addSucceedingOperator(new OperatorIDTuple(distinct,0));

      return distinct;
    } else {
      // alternative way to evaluate (...)? without using the PathLengthZero operator!
View Full Code Here
687
688
689
690
691
692
693
694
695
696
697
        projection.addProjectionElement((Variable)graphConstraint);
      }

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

      union.addSucceedingOperator(new OperatorIDTuple(projection,0));
      return projection;
    }
  }

  @Override
View Full Code Here
730
731
732
733
734
735
736
737
738
739
740
      final Union union = new Union();
      zeroOperator.addSucceedingOperator(new OperatorIDTuple(union,0));
      startingOperator.removeSucceedingOperator(closure);
      startingOperator.addSucceedingOperator(new OperatorIDTuple(union,1));
      union.addSucceedingOperator(new OperatorIDTuple(closure,0));

      return closure;
    } else {
      // alternative way to evaluate (...)* without using the Closure and PathLengthZero operators!

View Full Code Here
775
776
777
778
779
780
781
782
783
784
785
        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
        final BasicOperator startingPoint = this.zeroPath(node, graphConstraint, subject, object, subjectNode, objectNode);

        startingPoint.addSucceedingOperator(new OperatorIDTuple(union,0));
View Full Code Here
844
845
846
847
848
849
850
851
852
853
854
      }
      final ASTVar n = new ASTVar(100);
      n.setName(subject.toString().substring(1));
      final Bind bind = new Bind(subject);
      bind.addProjectionElement(object,n);
      union.addSucceedingOperator(new OperatorIDTuple(bind,0));
      bind.addSucceedingOperator(new OperatorIDTuple(projection,0));
      final InMemoryDistinct memoryDistinct = new InMemoryDistinct();
      projection.addSucceedingOperator(new OperatorIDTuple(memoryDistinct,0));
      return memoryDistinct;
    }
View Full Code Here
975
976
977
978
979
980
981
982
983
984
985
      final LinkedList<TriplePattern> temp2 = new LinkedList<TriplePattern>();
      temp2.add(tp2);
      this.indexScanCreator.createIndexScanAndConnectWithRoot(new OperatorIDTuple(union,i), temp2, graphConstraint);
    }

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

    final Projection projection = new Projection();
    projection.addProjectionElement(subject);
    projection.addProjectionElement(object);
    if(graphConstraint!=null && graphConstraint.isVariable() && !graphConstraint.equals(getItem(subjectNode)) && !graphConstraint.equals(getItem(objectNode))) {
View Full Code Here
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
    projection.addProjectionElement(subject);
    projection.addProjectionElement(object);
    if(graphConstraint!=null && graphConstraint.isVariable() && !graphConstraint.equals(getItem(subjectNode)) && !graphConstraint.equals(getItem(objectNode))) {
      projection.addProjectionElement((Variable)graphConstraint);
    }
    union.addSucceedingOperator(new OperatorIDTuple(projection,0));
    return projection;
  }

  @Override
  public BasicOperator visit(final ASTPathSequence node, final OperatorConnection connection,
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.