Package lupos.datastructures.queryresult

Examples of lupos.datastructures.queryresult.QueryResult

79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
  @SuppressWarnings("unchecked")
  @Override
  public QueryResult process(final QueryResult bindings, final int operandID) {
    bindings.materialize();
    this.comp.setVariables(this.intersectionVariables);
    final QueryResult oldLeft = this.left;
    final QueryResult oldRight = this.right;
    if (operandID == 0) {
      if (this.left == null) {
        this.left = bindings;
      } else {
        this.left = QueryResult.createInstance(new MergeIterator<Bindings>(this.comp, this.left.iterator(), bindings.iterator()));
      }
    } else if (operandID == 1) {
      if (this.right == null) {
        this.right = bindings;
      } else {
        this.right = QueryResult.createInstance(new MergeIterator<Bindings>(this.comp, this.right.iterator(), bindings.iterator()));
      }
    } else {
      System.err.println("MergeJoin is a binary operator, but received the operand number "
              + operandID);
    }
    if (this.left != null && this.right != null) {
      this.left.materialize();
      this.right.materialize();

      final Iterator<Bindings> leftIterator = (operandID == 0 && oldLeft != null) ? new MinusIterator(
          bindings.iterator(), oldLeft.iterator())
          : this.left.iterator();
      final QueryResult rightLocal = (operandID == 1 && oldRight != null) ? QueryResult
          .createInstance(new MinusIterator(bindings.iterator(),
              oldRight.iterator()))
          : this.right;


      final ParallelIterator<Bindings> currentResult = (this.intersectionVariables
          .size() == 0) ? MergeJoin.cartesianProductIterator(
          leftIterator, rightLocal) : MergeJoin.mergeJoinIterator(
          leftIterator, rightLocal.iterator(), this.comp,
          this.intersectionVariables, this.bindingsFactory);
      if (currentResult != null && currentResult.hasNext()) {
        final QueryResult result = QueryResult
            .createInstance(new ParallelIterator<Bindings>() {

              int number = 0;

              @Override
View Full Code Here
247
248
249
250
251
252
253
254
255
256
257
258
  @Override
  public void consume(final Triple triple) {
    final Bindings b = this.process(triple, false);
    if (b != null) {
      // System.out.println(b+" result of "+tp[i]);
      final QueryResult ll = QueryResult.createInstance();
      ll.add(b);
      for (final OperatorIDTuple op : this.getSucceedingOperators()) {
        ((Operator) op.getOperator()).processAll(ll, op.getId());
      }
    }
  }
View Full Code Here
668
669
670
671
672
673
674
675
676
677
678
679
  @Override
  public void deleteTriple(final Triple triple) {
    final Bindings b = this.process(triple, false);
    if (b != null) {
      // System.out.println(b+" result of "+tp[i]);
      final QueryResult ll = QueryResult.createInstance();
      ll.add(b);
      for (final OperatorIDTuple op : this.getSucceedingOperators()) {
        ((Operator) op.getOperator()).deleteAll(ll, op.getId());
      }
    }
  }
View Full Code Here
681
682
683
684
685
686
687
688
689
690
691
692
  @Override
  public void consumeDebug(final Triple triple, final DebugStep debugstep) {
    final Bindings b = this.process(triple, false);
    if (b != null) {
      // System.out.println(b+" result of "+tp[i]);
      final QueryResult ll = QueryResult.createInstance();
      ll.add(b);
      for (final OperatorIDTuple op : this.getSucceedingOperators()) {
        debugstep.step(this, op.getOperator(), b);
        ((Operator) op.getOperator()).processAllDebug(ll, op.getId(),
            debugstep);
      }
View Full Code Here
696
697
698
699
700
701
702
703
704
705
706
707
  @Override
  public void deleteTripleDebug(final Triple triple, final DebugStep debugstep) {
    final Bindings b = this.process(triple, false);
    if (b != null) {
      // System.out.println(b+" result of "+tp[i]);
      final QueryResult ll = QueryResult.createInstance();
      ll.add(b);
      for (final OperatorIDTuple op : this.getSucceedingOperators()) {
        debugstep.stepDelete(this, op.getOperator(), b);
        ((Operator) op.getOperator()).deleteAllDebug(ll, op.getId(),
            debugstep);
      }
View Full Code Here
74
75
76
77
78
79
80
81
82
83
84
85
86
    return msg;
  }

  public void trigger(){
    if (this.firstTime) {
      final QueryResult ll = QueryResult.createInstance();
      if(this.addEmptyBindings) {
        ll.add(this.bindingsFactory.createInstance());
      }
      for (final OperatorIDTuple op : this.getSucceedingOperators()) {
        ((Operator) op.getOperator()).processAll(ll, op.getId());
      }
      this.firstTime = false;
View Full Code Here
126
127
128
129
130
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
173
174
175
176
177
178
179
180
          QueryResult.createInstance(this.left.iterator()), QueryResult
              .createInstance(this.right.iterator())) : MergeJoin
          .mergeJoinIterator(this.left.iterator(), this.right.iterator(), this.comp,
              this.intersectionVariables, this.bindingsFactory);
      if (currentResult != null && currentResult.hasNext()) {
        final QueryResult result = QueryResult
            .createInstance(new ParallelIterator<Bindings>() {

              int number = 0;

              @Override
              public void close() {
                currentResult.close();
              }

              @Override
              public boolean hasNext() {
                if (!currentResult.hasNext()) {
                  MergeJoin.this.realCardinality = this.number;
                  this.close();
                }
                return currentResult.hasNext();
              }

              @Override
              public Bindings next() {
                final Bindings b = currentResult.next();
                if (!currentResult.hasNext()) {
                  MergeJoin.this.realCardinality = this.number;
                  this.close();
                }
                if (b != null) {
                  this.number++;
                }
                return b;
              }

              @Override
              public void remove() {
                currentResult.remove();
              }

              @Override
              public void finalize() {
                this.close();
              }
            });

        if (this.succeedingOperators.size() > 1) {
          result.materialize();
        }
        for (final OperatorIDTuple opId : this.succeedingOperators) {
          opId.processAll(result);
        }
      } else {
View Full Code Here
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
    if ((ssb1it == null) || (ssb2it == null) || !ssb1it.hasNext()
        || !ssb2it.hasNext()) {
      return null;
    }

    final QueryResult result = QueryResult.createInstance();
    Bindings b1 = ssb1it.next();
    Bindings b2 = ssb2it.next();
    boolean processFurther = true;
    do {
      final int compare = comp.compare(b1, b2);
      // System.out.println("compare:"+compare+" b1:"+b1+" b2:"+b2);
      if (compare == 0) {

        final Collection<Bindings> bindings1 = new CollectionImplementation<Bindings>(MergeJoin.MEMORYLIMIT);
        final Collection<Bindings> bindings2 = new CollectionImplementation<Bindings>(MergeJoin.MEMORYLIMIT);

        final Bindings bindings = b1;
        int left = 0;
        do {
          bindings1.add(b1);
          left++;
          if (!ssb1it.hasNext()) {
            processFurther = false;
            break;
          }
          b1 = ssb1it.next();
        } while (comp.compare(b1, bindings) == 0);
        int right = 0;
        do {
          bindings2.add(b2);
          right++;
          if (!ssb2it.hasNext()) {
            processFurther = false;
            break;
          }
          b2 = ssb2it.next();
        } while (comp.compare(b2, bindings) == 0);
        for (final Bindings zb1 : bindings1) {
          for (final Bindings zb2 : bindings2) {
            final Bindings bnew = zb1.clone();
            bnew.addAll(zb2);
            bnew.addAllTriples(zb2);
            bnew.addAllPresortingNumbers(zb2);
            result.add(bnew);
          }
        }
      } else if (compare < 0) {
        if (ssb1it.hasNext()) {
          b1 = ssb1it.next();
        } else {
          processFurther = false;
        }
      } else if (compare > 0) {
        if (ssb2it.hasNext()) {
          b2 = ssb2it.next();
        } else {
          processFurther = false;
        }
      }
    } while (processFurther == true);
    if (result.size() > 0) {
      return result;
    } else {
      return null;
    }
  }
View Full Code Here
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
      return null;
    }

    // different from mergeJoin:
    final OptionalResult or = new OptionalResult();
    final QueryResult joinPartnerFromLeftOperand = QueryResult
        .createInstance();

    final QueryResult result = QueryResult.createInstance();
    final Iterator<Bindings> ssb1it = ssb1.iterator();
    final Iterator<Bindings> ssb2it = ssb2.iterator();
    Bindings b1 = ssb1it.next();
    Bindings b2 = ssb2it.next();
    boolean processFurther = true;
    do {
      final int compare = comp.compare(b1, b2);
      if (compare == 0) {

        final Collection<Bindings> bindings1 = new CollectionImplementation<Bindings>(MergeJoin.MEMORYLIMIT);
        final Collection<Bindings> bindings2 = new CollectionImplementation<Bindings>(MergeJoin.MEMORYLIMIT);

        final Bindings bindings = b1;
        int left = 0;
        while (comp.compare(b1, bindings) == 0) {
          bindings1.add(b1);

          // different from mergeJoin:
          joinPartnerFromLeftOperand.add(b1);

          left++;
          if (!ssb1it.hasNext()) {
            processFurther = false;
            break;
          }
          b1 = ssb1it.next();
        }
        int right = 0;
        while (comp.compare(b2, bindings) == 0) {
          bindings2.add(b2);
          right++;
          if (!ssb2it.hasNext()) {
            processFurther = false;
            break;
          }
          b2 = ssb2it.next();
        }
        for (final Bindings zb1 : bindings1) {
          for (final Bindings zb2 : bindings2) {
            final Bindings bnew = zb1.clone();
            bnew.addAll(zb2);
            bnew.addAllTriples(zb2);
            bnew.addAllPresortingNumbers(zb2);
            result.add(bnew);
          }
        }
      } else if (compare < 0) {
        if (ssb1it.hasNext()) {
          b1 = ssb1it.next();
View Full Code Here
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
  public static ParallelIterator<Bindings> cartesianProductIterator(
      final QueryResult left, final QueryResult right) {
    if (left == null || right == null) {
      return null;
    }
    final QueryResult smaller;
    final QueryResult larger;
    // if (left.size() < right.size()) {
    // smaller = left;
    // larger = right;
    // } else {
    // smaller = right;
View Full Code Here
TOP

Related Classes of lupos.datastructures.queryresult.QueryResult

  • lupos.datastructures.bindings.Bindings
  • lupos.distributed.operator.AsynchronSubgraphContainer
  • lupos.distributed.operator.SubgraphContainer
  • lupos.distributed.p2p.commandline.StartConsole
  • lupos.distributed.p2p.network.impl.ChordlessLocalStorage
  • lupos.distributed.p2p.network.impl.EndpointNetwork
  • lupos.distributed.p2p.network.impl.TomP2PLocalStorage
  • lupos.distributed.p2p.query.withsubgraph.P2P_SubgraphExecuter
  • lupos.distributed.p2p.storage.StorageWithDistributionStrategy
  • lupos.distributed.query.operator.withouthistogramsubmission.QueryClientIndexScan
    • 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.