Package lupos.datastructures.items

Examples of lupos.datastructures.items.TripleKey

927
928
929
930
931
932
933
934
935
936
937
            }
            final Triple t = new Triple(new LazyLiteral(this.triple[GeneratorFromFinalRun.this.primaryMap]),
                new LazyLiteral(this.triple[GeneratorFromFinalRun.this.secondaryMap]),
                new LazyLiteral(this.triple[GeneratorFromFinalRun.this.tertiaryMap]));

            final TripleKey key = new TripleKey(t, GeneratorFromFinalRun.this.order);

            try {
              this.triple = this.it.next();

            } catch (final IOException e) {
View Full Code Here
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
      final Triple keyMinimum, final Triple keyMaximum) {
    if (keyMinimum == null) {
      if (keyMaximum == null) {
        switch (collationOrder) {
        case SPO:
          return sixIndices.SPO.prefixSearch(new TripleKey(key,
              CollationOrder.SPO));
        case SOP:
          return sixIndices.SOP.prefixSearch(new TripleKey(key,
              CollationOrder.SOP));
        case PSO:
          return sixIndices.PSO.prefixSearch(new TripleKey(key,
              CollationOrder.PSO));
        case POS:
          return sixIndices.POS.prefixSearch(new TripleKey(key,
              CollationOrder.POS));
        case OSP:
          return sixIndices.OSP.prefixSearch(new TripleKey(key,
              CollationOrder.OSP));
        default:
        case OPS:
          return sixIndices.OPS.prefixSearch(new TripleKey(key,
              CollationOrder.OPS));
        }
      } else {
        switch (collationOrder) {
        case SPO:
          return sixIndices.SPO.prefixSearchMax(new TripleKey(key,
              CollationOrder.SPO),
              new TripleKey(keyMaximum,
                  CollationOrder.SPO));
        case SOP:
          return sixIndices.SOP.prefixSearchMax(new TripleKey(key,
              CollationOrder.SOP),
              new TripleKey(keyMaximum,
                  CollationOrder.SOP));
        case PSO:
          return sixIndices.PSO.prefixSearchMax(new TripleKey(key,
              CollationOrder.PSO),
              new TripleKey(keyMaximum,
                  CollationOrder.PSO));
        case POS:
          return sixIndices.POS.prefixSearchMax(new TripleKey(key,
              CollationOrder.POS),
              new TripleKey(keyMaximum,
                  CollationOrder.POS));
        case OSP:
          return sixIndices.OSP.prefixSearchMax(new TripleKey(key,
              CollationOrder.OSP),
              new TripleKey(keyMaximum,
                  CollationOrder.OSP));
        default:
        case OPS:
          return sixIndices.OPS.prefixSearchMax(new TripleKey(key,
              CollationOrder.OPS),
              new TripleKey(keyMaximum,
                  CollationOrder.OPS));
        }
      }
    } else {
      if (keyMaximum == null) {
        switch (collationOrder) {
        case SPO:
          return sixIndices.SPO.prefixSearch(new TripleKey(key,
              CollationOrder.SPO),
              new TripleKey(keyMinimum,
                  CollationOrder.SPO));
        case SOP:
          return sixIndices.SOP.prefixSearch(new TripleKey(key,
              CollationOrder.SOP),
              new TripleKey(keyMinimum,
                  CollationOrder.SOP));
        case PSO:
          return sixIndices.PSO.prefixSearch(new TripleKey(key,
              CollationOrder.PSO),
              new TripleKey(keyMinimum,
                  CollationOrder.PSO));
        case POS:
          return sixIndices.POS.prefixSearch(new TripleKey(key,
              CollationOrder.POS),
              new TripleKey(keyMinimum,
                  CollationOrder.POS));
        case OSP:
          return sixIndices.OSP.prefixSearch(new TripleKey(key,
              CollationOrder.OSP),
              new TripleKey(keyMinimum,
                  CollationOrder.OSP));
        default:
        case OPS:
          return sixIndices.OPS.prefixSearch(new TripleKey(key,
              CollationOrder.OPS),
              new TripleKey(keyMinimum,
                  CollationOrder.OPS));
        }
      } else {
        switch (collationOrder) {
        case SPO:
          return sixIndices.SPO.prefixSearch(new TripleKey(key,
              CollationOrder.SPO),
              new TripleKey(keyMinimum,
                  CollationOrder.SPO),
              new TripleKey(keyMaximum,
                  CollationOrder.SPO));
        case SOP:
          return sixIndices.SOP.prefixSearch(new TripleKey(key,
              CollationOrder.SOP),
              new TripleKey(keyMinimum,
                  CollationOrder.SOP),
              new TripleKey(keyMaximum,
                  CollationOrder.SOP));
        case PSO:
          return sixIndices.PSO.prefixSearch(new TripleKey(key,
              CollationOrder.PSO),
              new TripleKey(keyMinimum,
                  CollationOrder.PSO),
              new TripleKey(keyMaximum,
                  CollationOrder.PSO));
        case POS:
          return sixIndices.POS.prefixSearch(new TripleKey(key,
              CollationOrder.POS),
              new TripleKey(keyMinimum,
                  CollationOrder.POS),
              new TripleKey(keyMaximum,
                  CollationOrder.POS));
        case OSP:
          return sixIndices.OSP.prefixSearch(new TripleKey(key,
              CollationOrder.OSP),
              new TripleKey(keyMinimum,
                  CollationOrder.OSP),
              new TripleKey(keyMaximum,
                  CollationOrder.OSP));
        default:
        case OPS:
          return sixIndices.OPS.prefixSearch(new TripleKey(key,
              CollationOrder.OPS),
              new TripleKey(keyMinimum,
                  CollationOrder.OPS),
              new TripleKey(keyMaximum,
                  CollationOrder.OPS));
        }
      }
    }
  }
View Full Code Here
1073
1074
1075
1076
1077
1078
1079
1080
1081
      dbbptree = ((OptimizedDBBPTreeGeneration<TripleKey, Triple>) index).getDBBPTree();
    } else if(index instanceof DBBPTree){
      dbbptree = (DBBPTree<TripleKey, Triple>) index;
    }
    if(dbbptree!=null){
      return dbbptree.getMaximum(new TripleKey(key, this.collationOrder)).getPos(pos);
    }
    return null;
  }
View Full Code Here
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
      }
      i++;
    }
    final CollationOrder order = getCollationOrder(tp, cv);
    return indices.getDBBPTreeStatistics(order).getVarBucket(
        new TripleKey(key, order),
        keyMinimum == null ? null : new TripleKey(keyMinimum, order),
        keyMaximum == null ? null : new TripleKey(keyMaximum, order),
        pos);
  }
View Full Code Here
261
262
263
264
265
266
267
268
269
270
271
272
273
                    System.err.println(e);
                    e.printStackTrace();
                }
            }
        } else {
          this.SPO.put(new TripleKey(t, new TripleComparator(CollationOrder.SPO)), t);
          this.SOP.put(new TripleKey(t, new TripleComparator(CollationOrder.SOP)), t);
          this.PSO.put(new TripleKey(t, new TripleComparator(CollationOrder.PSO)), t);
          this.POS.put(new TripleKey(t, new TripleComparator(CollationOrder.POS)), t);
          this.OSP.put(new TripleKey(t, new TripleComparator(CollationOrder.OSP)), t);
          this.OPS.put(new TripleKey(t, new TripleComparator(CollationOrder.OPS)), t);
        }
    }
View Full Code Here
296
297
298
299
300
301
302
    }

    @Override
    public boolean contains(final Triple t) {
      this.waitForAdderThreads();
        return (this.SPO.get(new TripleKey(t, new TripleComparator(CollationOrder.SPO))) != null);
    }
View Full Code Here
318
319
320
321
322
323
324
325
326
327
328
329
        this.OPS = this.getDatastructure(CollationOrder.OPS);
    }

    @Override
    public void remove(final Triple t) {
      this.SPO.remove(new TripleKey(t, new TripleComparator(CollationOrder.SPO)));
      this.SOP.remove(new TripleKey(t, new TripleComparator(CollationOrder.SOP)));
      this.PSO.remove(new TripleKey(t, new TripleComparator(CollationOrder.PSO)));
      this.POS.remove(new TripleKey(t, new TripleComparator(CollationOrder.POS)));
      this.OSP.remove(new TripleKey(t, new TripleComparator(CollationOrder.OSP)));
      this.OPS.remove(new TripleKey(t, new TripleComparator(CollationOrder.OPS)));
    }
View Full Code Here
450
451
452
453
454
455
456
457
458
459
460
        @Override
        public void run() {
            try {
                while (this.bbt.hasNext()) {
                    final Triple t = this.bbt.get();
                    this.ps.put(new TripleKey(t, new TripleComparator(this.order)), t);
                }
            } catch (final InterruptedException e) {
                System.err.println(e);
                e.printStackTrace();
            }
View Full Code Here
644
645
646
647
648
649
650
651
652
        literals[i] = (Literal) this.items[i];
      } else {
        literals[i] = k.get((Variable) this.items[i]);
      }
    }
    final TripleKey tk = new TripleKey(new Triple(literals[0], literals[1],
        literals[2]), order);
    return tk;
  }
View Full Code Here
658
659
660
661
662
663
664
665
666
        literals[i] = (Literal) this.items[i];
      } else {
        literals[i] = t[i];
      }
    }
    final TripleKey tk = new TripleKey(new Triple(literals[0], literals[1],
        literals[2]), order);
    return tk;
  }
View Full Code Here
TOP

Related Classes of lupos.datastructures.items.TripleKey

  • lupos.datastructures.paged_dbbptree.LazyLiteralTripleKeyDBBPTreeStatistics
  • lupos.datastructures.paged_dbbptree.LazyLiteralTripleKeyDBBPTreeStatistics$PrefixSearchIteratorMaxMinDistanceJump
  • lupos.datastructures.paged_dbbptree.node.nodedeserializer.LazyLiteralDBBPTreeStatisticsNodeDeSerializer
  • lupos.datastructures.paged_dbbptree.node.nodedeserializer.LazyLiteralNodeDeSerializer
  • lupos.datastructures.queryresult.IteratorQueryResult
  • lupos.engine.indexconstruction.FastRDF3XIndexConstruction$GeneratorFromFinalRun
  • lupos.engine.operators.index.adaptedRDF3X.RDF3XIndexScan
  • lupos.engine.operators.index.adaptedRDF3X.SixIndices
  • lupos.engine.operators.index.adaptedRDF3X.SixIndices$Adder
  • lupos.engine.operators.tripleoperator.TriplePattern
    • 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.