Package lupos.misc

Examples of lupos.misc.BitVector

53
54
55
56
57
58
59
        }
    }
    this.vars = vars;
    bloomFilters = new LinkedList<BitVector>();
    for (int i = 0; i < vars.size(); i++)
      bloomFilters.add(new BitVector(NUMBEROFBITSFORBLOOMFILTER));
  }
View Full Code Here
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
      final int operandID) {

    for (final Bindings b : res) {
      final Iterator<BitVector> ibv = bloomFilters.iterator();
      for (final Variable v : vars) {
        final BitVector bv = ibv.next();
        // if (!bv.get((b.get(v).hashCode() %
        // NUMBEROFBITSFORBLOOMFILTER)))
        // System.out.println(b.get(v));
        bv.set(Math.abs(b.get(v).hashCode()
            % NUMBEROFBITSFORBLOOMFILTER));
      }
    }

    // System.out.println(bloomFilters.iterator().next().count());
    for (final TriplePattern tp : ctp) {
      // inform triple patterns of bloom filter!
      int i = 0;
      for (final Item item : tp) {
        if (item.isVariable()) {
          final Iterator<BitVector> ibv = bloomFilters.iterator();
          for (final Variable v : vars) {
            final BitVector bloomFilter = ibv.next();
            if (v.equals(item)) {
              BitVector[] bfa = tp.getBloomFilters();
              if (bfa == null) {
                bfa = new BitVector[3];
                bfa[i] = bloomFilter;
              } else {
                if (bfa[i] != null) {
                  if (!bfa[i].equals(bloomFilter))
                    for (int j = 0; j < bloomFilter.size(); j++)
                      if (!bloomFilter.get(j))
                        bfa[i].clear(j);
                } else
                  bfa[i] = bloomFilter;
              }
              tp.setBloomFilters(bfa);
View Full Code Here
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
      public Bindings next() {
        final Bindings b = itb.next();
        if (b != null) {
          final Iterator<BitVector> ibv = bloomFilters.iterator();
          for (final Variable v : vars) {
            final BitVector bv = ibv.next();
            Literal literal = b.get(v);
            if(literal!=null){
              bv.set((Math.abs(literal.hashCode()) % NUMBEROFBITSFORBLOOMFILTER));
            }
          }
          if (!itb.hasNext()) {
            for (final TriplePattern tp : ctp) {
              // inform triple patterns of bloom filter!
              int i = 0;
              for (final Item item : tp) {
                if (item.isVariable()) {
                  final Iterator<BitVector> ibv2 = bloomFilters
                      .iterator();
                  for (final Variable v : vars) {
                    final BitVector bloomFilter = ibv2
                        .next();
                    if (v.equals(item)) {
                      BitVector[] bfa = tp
                          .getBloomFilters();
                      if (bfa == null) {
                        bfa = new BitVector[3];
                        bfa[i] = bloomFilter;
                      } else {
                        if (bfa[i] != null) {
                          if (!bfa[i]
                              .equals(bloomFilter))
                            for (int j = 0; j < bloomFilter
                                .size(); j++)
                              if (!bloomFilter
                                  .get(j))
                                bfa[i].clear(j);
                        } else
                          bfa[i] = bloomFilter;
                      }
View Full Code Here
38
39
40
41
42
43
44
45
46
47
48
49
  public Object evaluate(Object[] args) throws TypeErrorException {
    if(args.length==3){
      String value = args[0].toString();
      BigInteger bitVector = Helper.getInteger(args[1]);
      int bitVectorSize = Helper.getInteger(args[2]).intValue();
      BitVector bv = BitVector.getBitVector(bitVector, bitVectorSize);
      if(bv.get(Math.abs(value.hashCode() % bitVectorSize))){
        return Boolean.TRUE;
      } else {
        return Boolean.FALSE;
      }
    } else {
View Full Code Here
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
          if(!this.surelyBoundVariablesInServiceCall.contains(variable)){
            result += "((bound("+variable+") && ";
          }
          result +="<http://www.ifis.uni-luebeck.de/functions/BitVectorFilter>("+variable;
          result +=",";
          BitVector bv = new BitVector(FederatedQueryBitVectorJoinNonStandardSPARQL.bitvectorSize);
          while (bindingsIterator.hasNext()) {
            Bindings b = bindingsIterator.next();
            Literal literal = variable.getLiteral(b);
            if(literal!=null){
              oneOrMoreResults=true;
              bv.set(Math.abs(literal.toString().hashCode() % FederatedQueryBitVectorJoinNonStandardSPARQL.bitvectorSize));
            }
          }
          result += bv.getBigInteger().toString()+","+FederatedQueryBitVectorJoinNonStandardSPARQL.bitvectorSize+")";
          if(!this.surelyBoundVariablesInServiceCall.contains(variable)) {
            result += " ))||";
            result += " !bound("+variable+") ";
          }
          if(it.hasNext())
View Full Code Here
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
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
181
182
183
184
185
186
187
188
189
190
191
192
193
194
      final int numberDistinctPredicates,
      final int numberDistinctObjects,
      final boolean subjectDifferentFromPreviousTriple,
      final boolean predicateDifferentFromPreviousTriple,
      final boolean objectDifferentFromPreviousTriple) throws IOException {
    final BitVector bits = new BitVector(7);
    bits.set(0);
    final Triple lastValue = (lastKey == null) ? null : lastKey.getTriple();
    final Triple v = key.getTriple();
    final boolean mustWriteLazyLiteralOriginalContent = (v.getObject() instanceof LazyLiteralOriginalContent)
        && (lastValue == null || !(lastValue.getObject().equals(v
            .getObject())));
    if (mustWriteLazyLiteralOriginalContent) {
      bits.set(1);
    } else {
      bits.clear(1);
    }
    int value = 0;
    if (lastValue == null) {
      value = 3;
    } else {
      for (int i = 0; i < 3; i++) {
        if (v.getPos(map[this.order.ordinal()][i]).equals(
            lastValue.getPos(map[this.order.ordinal()][i]))) {
          value++;
        } else {
          break;
        }
      }
    }
    if (value <= 1) {
      bits.clear(2);
    } else {
      bits.set(2);
    }
    if (value % 2 == 0) {
      bits.clear(3);
    } else {
      bits.set(3);
    }

    if (subjectDifferentFromPreviousTriple) {
      bits.set(4);
    } else {
      bits.clear(4);
    }
    if (predicateDifferentFromPreviousTriple) {
      bits.set(5);
    } else {
      bits.clear(5);
    }
    if (objectDifferentFromPreviousTriple) {
      bits.set(6);
    } else {
      bits.clear(6);
    }

    int index = 7;

    for (int i = 0; i < 3; i++) {
      if (lastValue == null
          || !v.getPos(map[this.order.ordinal()][i]).equals(
              lastValue.getPos(map[this.order.ordinal()][i]))) {
        if (lastValue != null) {
          // determine difference
          final int diff = ((LazyLiteral) v.getPos(map[this.order
              .ordinal()][i])).getCode()
              - ((LazyLiteral) lastValue.getPos(map[this.order
                  .ordinal()][i])).getCode();
          index = LazyLiteralNodeDeSerializer
              .determineNumberOfBytesForRepresentation(diff,
                  bits, index, out);
        }
        for (int j = i + ((value == 3) ? 0 : 1); j < 3; j++) {
          // deal with the "rest"
          index = LazyLiteralNodeDeSerializer
              .determineNumberOfBytesForRepresentation(
                  ((LazyLiteral) v
                      .getPos(map[this.order.ordinal()][j]))
                      .getCode(), bits, index, out);
        }
        break;
      }
    }
    if (mustWriteLazyLiteralOriginalContent) {
      index = LazyLiteralNodeDeSerializer
          .determineNumberOfBytesForRepresentation(
              ((LazyLiteralOriginalContent) v.getObject())
                  .getCodeOriginalContent(), bits, index, out);
    }
    index = LazyLiteralNodeDeSerializer
        .determineNumberOfBytesForRepresentation(fileName, bits, index,
            out);
    index = LazyLiteralNodeDeSerializer
        .determineNumberOfBytesForRepresentation(numberOfTriples, bits,
            index, out);
    index = LazyLiteralNodeDeSerializer
        .determineNumberOfBytesForRepresentation(
            numberDistinctSubjects, bits, index, out);
    index = LazyLiteralNodeDeSerializer
        .determineNumberOfBytesForRepresentation(
            numberDistinctPredicates, bits, index, out);
    index = LazyLiteralNodeDeSerializer
        .determineNumberOfBytesForRepresentation(numberDistinctObjects,
            bits, index, out);
    bits.writeWithoutSize(out);

    LazyLiteralNodeDeSerializer.writeIntWithoutLeadingZeros(fileName, out);
    LazyLiteralNodeDeSerializer.writeIntWithoutLeadingZeros(
        numberOfTriples, out);
    LazyLiteralNodeDeSerializer.writeIntWithoutLeadingZeros(
View Full Code Here
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
265
266
267
268
269
270
271
272
273
274
275
      final int numberDistinctObjects,
      final boolean subjectDifferentFromPreviousTriple,
      final boolean predicateDifferentFromPreviousTriple,
      final boolean objectDifferentFromPreviousTriple,
      final OutputStream out) throws IOException {
    final BitVector bits = new BitVector(7);
    bits.clear(0);
    if (subjectDifferentFromPreviousTriple) {
      bits.set(1);
    } else {
      bits.clear(1);
    }
    if (predicateDifferentFromPreviousTriple) {
      bits.set(2);
    } else {
      bits.clear(2);
    }
    if (objectDifferentFromPreviousTriple) {
      bits.set(3);
    } else {
      bits.clear(3);
    }
    int index = LazyLiteralNodeDeSerializer
        .determineNumberOfBytesForRepresentation(fileName, bits, 3, out);
    index = LazyLiteralNodeDeSerializer
        .determineNumberOfBytesForRepresentation(numberOfTriples, bits,
            index, out);
    index = LazyLiteralNodeDeSerializer
        .determineNumberOfBytesForRepresentation(
            numberDistinctSubjects, bits, index, out);
    index = LazyLiteralNodeDeSerializer
        .determineNumberOfBytesForRepresentation(
            numberDistinctPredicates, bits, index, out);
    index = LazyLiteralNodeDeSerializer
        .determineNumberOfBytesForRepresentation(numberDistinctObjects,
            bits, index, out);
    bits.writeWithoutSize(out);
    LazyLiteralNodeDeSerializer.writeIntWithoutLeadingZeros(fileName, out);
    LazyLiteralNodeDeSerializer.writeIntWithoutLeadingZeros(
        numberOfTriples, out);
    LazyLiteralNodeDeSerializer.writeIntWithoutLeadingZeros(
        numberDistinctSubjects, out);
View Full Code Here
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
  }

  public InnerNodeEntry getNextInnerNodeEntryStatistics(
      final TripleKey lastKey, final InputStream in) {
    try {
      BitVector bits;
      try {
        bits = new BitVector(in, 7);
      } catch (final EOFException e) {
        return null;
      }
      if (!bits.get(0)) {
        final boolean subjectDifferentFromPreviousTriple = bits.get(1);
        final boolean predicateDifferentFromPreviousTriple = bits
            .get(2);
        final boolean objectDifferentFromPreviousTriple = bits.get(3);
        int index = 3;
        final int filenameSize = LazyLiteralNodeDeSerializer
            .getIntSize(bits, index, in);
        index = (index + 2) % 8;
        final int numberOfTriplesSize = LazyLiteralNodeDeSerializer
            .getIntSize(bits, index, in);
        index = (index + 2) % 8;
        final int numberDistinctSubjectsSize = LazyLiteralNodeDeSerializer
            .getIntSize(bits, index, in);
        index = (index + 2) % 8;
        final int numberDistinctPredicatesSize = LazyLiteralNodeDeSerializer
            .getIntSize(bits, index, in);
        index = (index + 2) % 8;
        final int numberDistinctObjectsSize = LazyLiteralNodeDeSerializer
            .getIntSize(bits, index, in);
        index = (index + 2) % 8;
        final int fileName = LazyLiteralNodeDeSerializer.getInt(
            filenameSize + 1, in);
        final int numberOfTriples = LazyLiteralNodeDeSerializer.getInt(
            numberOfTriplesSize + 1, in);
        final int numberDistinctSubjects = LazyLiteralNodeDeSerializer
            .getInt(numberDistinctSubjectsSize + 1, in);
        final int numberDistinctPredicates = LazyLiteralNodeDeSerializer
            .getInt(numberDistinctPredicatesSize + 1, in);
        final int numberDistinctObjects = LazyLiteralNodeDeSerializer
            .getInt(numberDistinctObjectsSize + 1, in);
        return new InnerNodeEntry(null, fileName, numberOfTriples,
            numberDistinctSubjects, numberDistinctPredicates,
            numberDistinctObjects,
            subjectDifferentFromPreviousTriple,
            predicateDifferentFromPreviousTriple,
            objectDifferentFromPreviousTriple);
      }
      final Triple lastTriple = (lastKey == null) ? null : lastKey
          .getTriple();

      final boolean objectIsLazyLiteralOriginalContent = bits.get(1);
      int whereDifferentLiteral = 0;
      if (bits.get(2)) {
        whereDifferentLiteral = 2;
      }
      if (bits.get(3)) {
        whereDifferentLiteral += 1;
      }
      final boolean subjectDifferentFromPreviousTriple = bits.get(4);
      final boolean predicateDifferentFromPreviousTriple = bits.get(5);
      final boolean objectDifferentFromPreviousTriple = bits.get(6);

      final int numberDifferent = (whereDifferentLiteral == 3) ? 3
          : 3 - whereDifferentLiteral;
      final int[] numberBytesForInt = new int[numberDifferent];
      int index = 7;
View Full Code Here
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
  @Override
  public void writeInnerNodeEntry(final int fileName, final TripleKey key,
      final OutputStream out, final TripleKey lastKey)
      throws IOException {
    final BitVector bits = new BitVector(7);
    bits.set(0);
    final Triple lastValue = (lastKey == null) ? null : lastKey.getTriple();
    final Triple v = key.getTriple();
    final boolean mustWriteLazyLiteralOriginalContent = (v.getObject() instanceof LazyLiteralOriginalContent)
        && (lastValue == null || !(lastValue.getObject().equals(v
            .getObject())));
    if (mustWriteLazyLiteralOriginalContent) {
      bits.set(1);
    } else {
      bits.clear(1);
    }
    int value = 0;
    if (lastValue == null) {
      value = 3;
    } else {
      for (int i = 0; i < 3; i++) {
        if (lastValue != null
            && v.getPos(map[this.order.ordinal()][i]).equals(
                lastValue.getPos(map[this.order.ordinal()][i]))) {
          value++;
        } else {
          break;
        }
      }
    }
    if (value <= 1) {
      bits.clear(2);
    } else {
      bits.set(2);
    }
    if (value % 2 == 0) {
      bits.clear(3);
    } else {
      bits.set(3);
    }

    int index = 3;

    for (int i = 0; i < 3; i++) {
      if (lastValue == null
          || !v.getPos(map[this.order.ordinal()][i]).equals(
              lastValue.getPos(map[this.order.ordinal()][i]))) {
        if (lastValue != null) {
          // determine difference
          final int diff = ((LazyLiteral) v.getPos(map[this.order
              .ordinal()][i])).getCode()
              - ((LazyLiteral) lastValue.getPos(map[this.order
                  .ordinal()][i])).getCode();
          index = determineNumberOfBytesForRepresentation(diff, bits, index, out);
        }
        for (int j = i + ((value == 3) ? 0 : 1); j < 3; j++) {
          // deal with the "rest"
          index = determineNumberOfBytesForRepresentation(
              ((LazyLiteral) v.getPos(map[this.order.ordinal()][j]))
                  .getCode(), bits, index, out);
        }
        break;
      }
    }
    if (mustWriteLazyLiteralOriginalContent) {
      index = determineNumberOfBytesForRepresentation(
          ((LazyLiteralOriginalContent) v.getObject())
              .getCodeOriginalContent(), bits, index, out);
    }
    index = determineNumberOfBytesForRepresentation(fileName, bits, index,
        out);
    bits.writeWithoutSize(out);
    writeIntWithoutLeadingZeros(fileName, out);

    if (mustWriteLazyLiteralOriginalContent) {
      writeIntWithoutLeadingZeros(((LazyLiteralOriginalContent) v
          .getObject()).getCodeOriginalContent(), out);
View Full Code Here
162
163
164
165
166
167
168
169
170
171
172
    }
  }

  @Override
  public void writeInnerNodeEntry(final int fileName, final OutputStream out) throws IOException {
    final BitVector bits = new BitVector(7);
    bits.clear(0);
    determineNumberOfBytesForRepresentation(fileName, bits, 0, out);
    bits.writeWithoutSize(out);
    writeIntWithoutLeadingZeros(fileName, out);
  }
View Full Code Here
TOP

Related Classes of lupos.misc.BitVector

  • lupos.datastructures.paged_dbbptree.LazyLiteralTripleKeyDBBPTreeStatistics
  • lupos.datastructures.paged_dbbptree.node.nodedeserializer.LazyLiteralDBBPTreeStatisticsNodeDeSerializer
  • lupos.datastructures.paged_dbbptree.node.nodedeserializer.LazyLiteralNodeDeSerializer
  • lupos.engine.operators.singleinput.federated.BitVectorFilterFunction
  • lupos.engine.operators.singleinput.federated.FederatedQueryBitVectorJoinNonStandardSPARQL
  • lupos.engine.operators.singleinput.SIPFilterOperator
  • lupos.engine.operators.singleinput.SIPFilterOperatorIterator
  • java.math.BigInteger
    • 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.