Package lupos.engine.operators

Examples of lupos.engine.operators.OperatorIDTuple

89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
        .getSucceedingOperators();

    BasicOperator pre;
    for (int i = 0; i < pres.size(); i++) {
      pre = pres.get(i);
      pre.addSucceedingOperator(new OperatorIDTuple(optional, 0));
      pre.removeSucceedingOperator(genAdd);
      optional.addPrecedingOperator(pre);
    }

    optional.removePrecedingOperator(genAdd);
    optional.setSucceedingOperator(new OperatorIDTuple(genAdd, 0));

    genAdd.setPrecedingOperator(optional);
    genAdd.setSucceedingOperators(succs);

    BasicOperator succ;
View Full Code Here
47
48
49
50
51
52
53
54
55
56
57
  @Override
  protected void init() {
    final AddBinding add = new AddBinding(null, null);
    final Filter filter = new Filter();

    add.setSucceedingOperator(new OperatorIDTuple(filter, -1));
    filter.setPrecedingOperator(add);

    subGraphMap = new HashMap<BasicOperator, String>();
    subGraphMap.put(add, "add");
    subGraphMap.put(filter, "filter");
View Full Code Here
41
42
43
44
45
46
47
48
49
50
51
  @Override
  protected void init() {
    final AddBinding add = new AddBinding(null, null);
    final Generate generate = new Generate();

    add.setSucceedingOperator(new OperatorIDTuple(generate, -1));
    generate.setPrecedingOperator(add);

    subGraphMap = new HashMap<BasicOperator, String>();
    subGraphMap.put(add, "add");
    subGraphMap.put(generate, "generate");
View Full Code Here
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
          .getPrecedingOperators()) {
        boolean found = false;
        for (final BasicOperator operator2 : graph
            .getPrecedingOperators()) {

          OperatorIDTuple operatorIDTuple = null;
          for (final OperatorIDTuple zOperatorIDTuple : operator
              .getSucceedingOperators()) {
            if (zOperatorIDTuple.getOperator().equals(startNode)) {
              operatorIDTuple = zOperatorIDTuple;
              break;
            }
          }
          if (operatorIDTuple == null
              || !operatorIDTuple.getOperator().equals(startNode)) {
            System.out.println("Error in Operatorgraph:"
                + operatorIDTuple);
            return null;
          }

          OperatorIDTuple operatorIDTuple2 = null;
          for (final OperatorIDTuple zOperatorIDTuple2 : operator2
              .getSucceedingOperators()) {
            if (zOperatorIDTuple2.getOperator().equals(graph)) {
              operatorIDTuple2 = zOperatorIDTuple2;
              break;
            }
          }
          if (operatorIDTuple2 == null
              || !operatorIDTuple2.getOperator().equals(graph)) {
            System.out.println("Error in Operatorgraph");
            return null;
          }

          // to do? maybe consider more cases in ambiguous cases
          if (operatorIDTuple.getId() == -1
              || operatorIDTuple.getId() == operatorIDTuple2
                  .getId()) {
            final Map<String, BasicOperator> currentResult3 = checkSubGraph(
                operator2, subGraphMap, operator,
                currentResult2);
            if (currentResult3 != null) {
View Full Code Here
45
46
47
48
49
50
51
52
53
54
55
  @Override
  protected void init() {
    final ReplaceVar rep1 = new ReplaceVar();
    final ReplaceVar rep2 = new ReplaceVar();

    rep1.setSucceedingOperator(new OperatorIDTuple(rep2, 0));
    rep2.setPrecedingOperator(rep1);

    subGraphMap = new HashMap<BasicOperator, String>();
    subGraphMap.put(rep1, "rep1");
    subGraphMap.put(rep2, "rep2");
View Full Code Here
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
          .getPrecedingOperators()) {
        boolean found = false;
        for (final BasicOperator operator2 : graph
            .getPrecedingOperators()) {

          OperatorIDTuple operatorIDTuple = null;
          for (final OperatorIDTuple zOperatorIDTuple : operator
              .getSucceedingOperators()) {
            if (zOperatorIDTuple.getOperator().equals(startNode)) {
              operatorIDTuple = zOperatorIDTuple;
              break;
            }
          }
          if (operatorIDTuple == null
              || !operatorIDTuple.getOperator().equals(startNode)) {
            System.out.println("Error in Operatorgraph:"
                + operatorIDTuple);
            return;
          }

          OperatorIDTuple operatorIDTuple2 = null;
          for (final OperatorIDTuple zOperatorIDTuple2 : operator2
              .getSucceedingOperators()) {
            if (zOperatorIDTuple2.getOperator().equals(graph)) {
              operatorIDTuple2 = zOperatorIDTuple2;
              break;
            }
          }
          if (operatorIDTuple2 == null
              || !operatorIDTuple2.getOperator().equals(graph)) {
            System.out.println("Error in Operatorgraph");
            return;
          }

          // to do? maybe consider more cases in ambiguous cases
          if (operatorIDTuple.getId() == -1
              || operatorIDTuple.getId() == operatorIDTuple2
                  .getId()) {
            final Map<String, BasicOperator> currentResult3 = checkSubGraph(
                operator2, subGraphMap, operator,
                currentResult2);
            if (currentResult3 != null) {
View Full Code Here
110
111
112
113
114
115
116
117
118
119
120
    // Set precessors
    BasicOperator pre;
    for (int i = 0; i < pres.size(); i++) {
      pre = pres.get(i);
      pre.addSucceedingOperator(new OperatorIDTuple(rep_new, pre
          .getOperatorIDTuple(rep1).getId()));
      pre.removeSucceedingOperator(rep1);
    }

    rep_new.setPrecedingOperators(pres);
View Full Code Here
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
  public static void main(final String[] args) {
    // The whole graph:
    final Operator wa = new Join();
    final Operator wb = new Projection();
    wa.setSucceedingOperator(new OperatorIDTuple(wb, 0));
    wb.setPrecedingOperator(wa);

    // Define left side of rule
    final Operator a = new Join();
    final Operator b = new Projection();
    a.setSucceedingOperator(new OperatorIDTuple(b, -1));
    b.setPrecedingOperator(a);
    final Map<BasicOperator, String> subGraphMap = new HashMap<BasicOperator, String>();
    subGraphMap.put(a, "a");
    subGraphMap.put(b, "b");
View Full Code Here
41
42
43
44
45
46
47
48
49
50
51
  @Override
  protected void init() {
    final Union union = new Union();
    final Generate generate = new Generate();

    union.setSucceedingOperator(new OperatorIDTuple(generate, -1));
    generate.setPrecedingOperator(union);

    subGraphMap = new HashMap<BasicOperator, String>();
    subGraphMap.put(union, "union");
    subGraphMap.put(generate, "generate");
View Full Code Here
93
94
95
96
97
98
99
100
101
102
103
        generateNew.cloneFrom(generate);
        added.add(generateNew);
      }
      generateNew.setPrecedingOperator(toMove);

      toMove.setSucceedingOperator(new OperatorIDTuple(generateNew, 0));
    }
    if (deleted.size() > 0 || added.size() > 0)
      return new Tuple<Collection<BasicOperator>, Collection<BasicOperator>>(
          added, deleted);
    else
View Full Code Here
TOP

Related Classes of lupos.engine.operators.OperatorIDTuple

  • lupos.datastructures.queryresult.QueryResult
  • lupos.distributed.operator.format.SubgraphContainerFormatter
  • lupos.distributed.p2p.rules.JoinSGRule
  • lupos.distributed.p2p.rules.PartitionSubgraphRule
  • lupos.engine.evaluators.BasicIndexQueryEvaluator
  • lupos.engine.evaluators.StreamQueryEvaluator
  • lupos.engine.operators.index.adaptedRDF3X.RDF3XIndexScan
  • lupos.engine.operators.multiinput.join.parallel.ParallelJoin
  • lupos.engine.operators.multiinput.minus.Minus
  • lupos.engine.operators.multiinput.minus.SortedMinus
    • Copyright © 2018 www.massapicom. 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.