Examples with RoaringBitmapFactory org.apache.druid.collections.bitmap.RoaringBitmapFactory used on opensource projects

Example 11 with RoaringBitmapFactory

use of org.apache.druid.collections.bitmap.RoaringBitmapFactory in project druid by druid-io.

the class ImmutableRTreeTest method testSearchWithSplitRoaring.

@Test
public void testSearchWithSplitRoaring() {
    BitmapFactory bf = new RoaringBitmapFactory();
    RTree tree = new RTree(2, new LinearGutmanSplitStrategy(0, 50, bf), bf);
    tree.insert(new float[] { 0, 0 }, 1);
    tree.insert(new float[] { 1, 3 }, 2);
    tree.insert(new float[] { 4, 2 }, 3);
    tree.insert(new float[] { 5, 0 }, 4);
    tree.insert(new float[] { -4, -3 }, 5);
    Random rand = ThreadLocalRandom.current();
    for (int i = 0; i < 95; i++) {
        tree.insert(new float[] { (float) (rand.nextDouble() * 10 + 10.0), (float) (rand.nextDouble() * 10 + 10.0) }, i);
    }
    ImmutableRTree searchTree = ImmutableRTree.newImmutableFromMutable(tree);
    Iterable<ImmutableBitmap> points = searchTree.search(new RadiusBound(new float[] { 0, 0 }, 5));
    ImmutableBitmap finalSet = bf.union(points);
    Assert.assertTrue(finalSet.size() >= 5);
    Set<Integer> expected = Sets.newHashSet(1, 2, 3, 4, 5);
    IntIterator iter = finalSet.iterator();
    while (iter.hasNext()) {
        Assert.assertTrue(expected.contains(iter.next()));
    }
}

Example 12 with RoaringBitmapFactory

use of org.apache.druid.collections.bitmap.RoaringBitmapFactory in project druid by druid-io.

the class RTreeTest method setUp.

@Before
public void setUp() {
    BitmapFactory bf = new ConciseBitmapFactory();
    tree = new RTree(2, new LinearGutmanSplitStrategy(0, 50, bf), bf);
    BitmapFactory rbf = new RoaringBitmapFactory();
    roaringtree = new RTree(2, new LinearGutmanSplitStrategy(0, 50, rbf), rbf);
}

Example 13 with RoaringBitmapFactory

use of org.apache.druid.collections.bitmap.RoaringBitmapFactory in project druid by druid-io.

the class LinearGutmanSplitStrategyTest method testNumChildrenSizeRoaring.

@Test
public void testNumChildrenSizeRoaring() {
    BitmapFactory bf = new RoaringBitmapFactory();
    RTree tree = new RTree(2, new LinearGutmanSplitStrategy(0, 50, bf), bf);
    Random rand = ThreadLocalRandom.current();
    for (int i = 0; i < 100; i++) {
        tree.insert(new float[] { rand.nextFloat(), rand.nextFloat() }, i);
    }
    Assert.assertTrue(getNumPoints(tree.getRoot()) >= tree.getSize());
}

Example 14 with RoaringBitmapFactory

use of org.apache.druid.collections.bitmap.RoaringBitmapFactory in project druid by druid-io.

the class BitmapBenchmarkWithVaryingOrder method setup.

@Setup(Level.Trial)
public void setup() throws IOException {
    switch(type) {
        case "concise":
            bitmapFactory = new ConciseBitmapFactory();
            break;
        case "roaring":
            bitmapFactory = new RoaringBitmapFactory();
            break;
        default:
            throw new IAE("Unknown bitmap type[%s]", type);
    }
    bitmaps = new ArrayList<>(numBitmaps);
    // Bitmaps usually have a short circuit to early return an empty bitmap if it finds no intersection
    // during an AND operation. We want to let them iterate all bitmaps instead, so add some bits that
    // will be set for all bitmaps we create.
    final int[] knownTrue = new int[minIntersect];
    for (int i = 0; i < knownTrue.length; ++i) {
        knownTrue[i] = RANDOM.nextInt(bitmapLength);
    }
    for (int i = 0; i < numBitmaps; ++i) {
        // the later the bitmap is created, the higher its density is.
        final int bitCount = (int) (i * 0.1);
        IntSet ints = new IntOpenHashSet(bitCount);
        for (int j = 0; j < bitCount; j++) {
            int offset;
            do {
                offset = RANDOM.nextInt(bitmapLength);
            } while (ints.contains(offset));
            ints.add(offset);
        }
        final MutableBitmap mutableBitmap = bitmapFactory.makeEmptyMutableBitmap();
        ints.iterator().forEachRemaining((IntConsumer) mutableBitmap::add);
        for (int k : knownTrue) {
            mutableBitmap.add(k);
        }
        bitmaps.add(BitmapBenchmarkUtils.toOffheap(bitmapFactory.makeImmutableBitmap(mutableBitmap)));
    }
    reverseBitmaps = Lists.reverse(bitmaps);
}

Example 15 with RoaringBitmapFactory

use of org.apache.druid.collections.bitmap.RoaringBitmapFactory in project druid by druid-io.

the class UniformBitmapBenchmark method setup.

@Setup(Level.Trial)
public void setup() throws IOException {
    final int[] knownTrue = new int[minIntersect];
    for (int i = 0; i < knownTrue.length; ++i) {
        knownTrue[i] = RANDOM.nextInt(bitmapLength);
    }
    switch(type) {
        case "concise":
            bitmapFactory = new ConciseBitmapFactory();
            break;
        case "roaring":
            bitmapFactory = new RoaringBitmapFactory();
            break;
        default:
            throw new IAE("Unknown bitmap type[%s]", type);
    }
    bitmaps = new ArrayList<>(numBitmaps);
    for (int i = 0; i < numBitmaps; ++i) {
        final MutableBitmap mutableBitmap = bitmapFactory.makeEmptyMutableBitmap();
        for (int k = 0; k < bitmapLength; ++k) {
            if (RANDOM.nextDouble() < density) {
                mutableBitmap.add(k);
            }
        }
        for (int k : knownTrue) {
            mutableBitmap.add(k);
        }
        bitmaps.add(BitmapBenchmarkUtils.toOffheap(bitmapFactory.makeImmutableBitmap(mutableBitmap)));
    }
    final long totalSizeBytes = bitmaps.stream().mapToLong(bitmap -> bitmap.toBytes().length).sum();
    BitmapBenchmarkUtils.printSizeStats(type, density, bitmaps.size(), totalSizeBytes);
}