Package org.openrdf.sail.nativerdf.btree

Examples of org.openrdf.sail.nativerdf.btree.BTree$InsertResult

306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
      try {
        for (String fieldSeq : addedIndexSpecs) {
          logger.debug("Initializing new index '" + fieldSeq + "'...");

          TripleIndex addedIndex = new TripleIndex(fieldSeq);
          BTree addedBTree = addedIndex.getBTree();

          RecordIterator sourceIter = sourceIndex.getBTree().iterateAll();
          try {
            byte[] value = null;
            while ((value = sourceIter.next()) != null) {
              addedBTree.insert(value);
            }
          }
          finally {
            sourceIter.close();
          }

          addedBTree.close();
        }

        logger.debug("New index(es) initialized");
      }
      finally {
View Full Code Here
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
  protected double cardinality(int subj, int pred, int obj, int context)
    throws IOException
  {
    TripleIndex index = getBestIndex(subj, pred, obj, context);
    BTree btree = index.btree;

    double rangeSize;

    if (index.getPatternScore(subj, pred, obj, context) == 0) {
      rangeSize = btree.getValueCountEstimate();
    }
    else {
      byte[] minValue = getMinValue(subj, pred, obj, context);
      byte[] maxValue = getMaxValue(subj, pred, obj, context);
      rangeSize = btree.getValueCountEstimate(minValue, maxValue);
    }

    return rangeSize;
  }
View Full Code Here
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
      count = (int)removedTriplesCache.getRecordCount();
      updatedTriplesCache.storeRecords(removedTriplesCache);

      for (TripleIndex index : indexes) {
        BTree btree = index.getBTree();

        RecordIterator recIter = removedTriplesCache.getRecords();
        try {
          while ((data = recIter.next()) != null) {
            btree.insert(data);
          }
        }
        finally {
          recIter.close();
        }
View Full Code Here
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
        data = iter.next();
      }
      iter.close();

      for (TripleIndex index : indexes) {
        BTree btree = index.getBTree();

        RecordIterator recIter = recordCache.getRecords();
        try {
          while ((data = recIter.next()) != null) {
            btree.remove(data);
          }
        }
        finally {
          recIter.close();
        }
View Full Code Here
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
    }

    boolean validCache = updatedTriplesCache.isValid();

    for (TripleIndex index : indexes) {
      BTree btree = index.getBTree();

      RecordIterator iter;
      if (validCache) {
        // Use the cached set of updated triples
        iter = updatedTriplesCache.getRecords();
      }
      else {
        // Cache is invalid; too much updates(?). Iterate over all triples
        iter = btree.iterateAll();
      }

      try {
        byte[] data = null;
        while ((data = iter.next()) != null) {
          byte flags = data[FLAG_IDX];
          boolean added = (flags & ADDED_FLAG) != 0;
          boolean removed = (flags & REMOVED_FLAG) != 0;
          boolean toggled = (flags & TOGGLE_EXPLICIT_FLAG) != 0;

          if (removed) {
            // Record has been discarded earlier, do not put it back in!
            continue;
          }

          if (added || toggled) {
            if (toggled) {
              data[FLAG_IDX] ^= EXPLICIT_FLAG;
            }
            if (added) {
              data[FLAG_IDX] ^= ADDED_FLAG;
            }

            if (validCache) {
              // We're iterating the cache
              btree.insert(data);
            }
            else {
              // We're iterating the BTree itself
              iter.set(data);
            }
View Full Code Here
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
    boolean validCache = updatedTriplesCache.isValid();

    byte txnFlagsMask = ~(ADDED_FLAG | REMOVED_FLAG | TOGGLE_EXPLICIT_FLAG);

    for (TripleIndex index : indexes) {
      BTree btree = index.getBTree();

      RecordIterator iter;
      if (validCache) {
        // Use the cached set of updated triples
        iter = updatedTriplesCache.getRecords();
      }
      else {
        // Cache is invalid; too much updates(?). Iterate over all triples
        iter = btree.iterateAll();
      }

      try {
        byte[] data = null;
        while ((data = iter.next()) != null) {
          byte flags = data[FLAG_IDX];
          boolean removed = (flags & REMOVED_FLAG) != 0;
          boolean toggled = (flags & TOGGLE_EXPLICIT_FLAG) != 0;

          if (removed || toggled) {
            data[FLAG_IDX] &= txnFlagsMask;

            if (validCache) {
              // We're iterating the cache
              btree.insert(data);
            }
            else {
              // We're iterating the BTree itself
              iter.set(data);
            }
View Full Code Here
1020
1021
1022
1023
1024
1025
1026
    public TripleIndex(String fieldSeq)
      throws IOException
    {
      tripleComparator = new TripleComparator(fieldSeq);
      btree = new BTree(dir, getFilenamePrefix(fieldSeq), 2048, RECORD_LENGTH, tripleComparator, forceSync);
    }
View Full Code Here
38
39
40
41
42
43
44
  public SortedRecordCache(File cacheDir, int recordSize, long maxRecords, RecordComparator comparator)
    throws IOException
  {
    super(maxRecords);
    btree = new BTree(cacheDir, "txncache", 4096, recordSize, comparator);
  }
View Full Code Here
38
39
40
41
42
43
44
  public SortedRecordCache(File cacheDir, int recordSize, long maxRecords, RecordComparator comparator)
    throws IOException
  {
    super(cacheDir, maxRecords);
    btree = new BTree(cacheFile, 4096, recordSize, comparator);
  }
View Full Code Here
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
      try {
        for (String fieldSeq : addedIndexSpecs) {
          logger.debug("Initializing new index '" + fieldSeq + "'...");

          TripleIndex addedIndex = new TripleIndex(fieldSeq);
          BTree addedBTree = addedIndex.getBTree();

          RecordIterator sourceIter = sourceIndex.getBTree().iterateAll();
          try {
            byte[] value = null;
            while ((value = sourceIter.next()) != null) {
              addedBTree.insert(value);
            }
          }
          finally {
            sourceIter.close();
          }

          addedBTree.close();
        }

        logger.debug("New index(es) initialized");
      }
      finally {
View Full Code Here
TOP

Related Classes of org.openrdf.sail.nativerdf.btree.BTree$InsertResult

  • org.openrdf.sail.nativerdf.datastore.HashIndex
  • org.openrdf.sail.nativerdf.SortedRecordCache
  • org.openrdf.sail.nativerdf.TripleStore
  • org.openrdf.sail.nativerdf.TripleStore$TripleIndex
  • org.w3c.dom.Element
  • java.io.IOException
  • java.util.Iterator
  • java.io.RandomAccessFile
  • java.io.File
  • java.nio.ByteBuffer
    • 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.