use of org.apache.druid.collections.bitmap.ImmutableBitmap in project druid by druid-io.
the class ImmutableRTreeTest method testSearchNoSplit.
@Test
public void testSearchNoSplit() {
BitmapFactory bf = new ConciseBitmapFactory();
RTree tree = new RTree(2, new LinearGutmanSplitStrategy(0, 50, bf), bf);
tree.insert(new float[] { 0, 0 }, 1);
tree.insert(new float[] { 10, 10 }, 10);
tree.insert(new float[] { 1, 3 }, 2);
tree.insert(new float[] { 27, 34 }, 20);
tree.insert(new float[] { 106, 19 }, 30);
tree.insert(new float[] { 4, 2 }, 3);
tree.insert(new float[] { 5, 0 }, 4);
tree.insert(new float[] { 4, 72 }, 40);
tree.insert(new float[] { -4, -3 }, 5);
tree.insert(new float[] { 119, -78 }, 50);
Assert.assertEquals(tree.getRoot().getChildren().size(), 10);
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()));
}
}
use of org.apache.druid.collections.bitmap.ImmutableBitmap in project druid by druid-io.
the class ImmutableRTreeTest method showBenchmarksBoundWithLimits.
// TODO rewrite to JMH and move to the benchmarks project
@SuppressWarnings("unused")
public void showBenchmarksBoundWithLimits() {
// final int start = 1;
final int start = 10000000;
final int factor = 10;
final int end = 10000000;
for (int numPoints = start; numPoints <= end; numPoints *= factor) {
try {
BitmapFactory bf = new ConciseBitmapFactory();
RTree tree = new RTree(2, new LinearGutmanSplitStrategy(0, 50, bf), bf);
Stopwatch stopwatch = Stopwatch.createStarted();
Random rand = ThreadLocalRandom.current();
for (int i = 0; i < numPoints; i++) {
tree.insert(new float[] { (float) (rand.nextDouble() * 100), (float) (rand.nextDouble() * 100) }, i);
}
long stop = stopwatch.elapsed(TimeUnit.MILLISECONDS);
System.out.printf(Locale.ENGLISH, "[%,d]: insert = %,d ms%n", numPoints, stop);
stopwatch.reset().start();
ImmutableRTree searchTree = ImmutableRTree.newImmutableFromMutable(tree);
stop = stopwatch.elapsed(TimeUnit.MILLISECONDS);
System.out.printf(Locale.ENGLISH, "[%,d]: size = %,d bytes%n", numPoints, searchTree.toBytes().length);
System.out.printf(Locale.ENGLISH, "[%,d]: buildImmutable = %,d ms%n", numPoints, stop);
stopwatch.reset().start();
Iterable<ImmutableBitmap> points = searchTree.search(new RectangularBound(new float[] { 40, 40 }, new float[] { 60, 60 }, 100));
Iterables.size(points);
stop = stopwatch.elapsed(TimeUnit.MILLISECONDS);
System.out.printf(Locale.ENGLISH, "[%,d]: search = %,dms%n", numPoints, stop);
stopwatch.reset().start();
ImmutableBitmap finalSet = bf.union(points);
stop = stopwatch.elapsed(TimeUnit.MILLISECONDS);
System.out.printf(Locale.ENGLISH, "[%,d]: union of %,d points in %,d ms%n", numPoints, finalSet.size(), stop);
} catch (Exception e) {
throw new RuntimeException(e);
}
}
}
use of org.apache.druid.collections.bitmap.ImmutableBitmap in project druid by druid-io.
the class ImmutableRTreeTest method testSearchWithSplit4Roaring.
@Test
public void testSearchWithSplit4Roaring() {
BitmapFactory bf = new RoaringBitmapFactory();
RTree tree = new RTree(2, new LinearGutmanSplitStrategy(0, 50, bf), bf);
Random rand = ThreadLocalRandom.current();
int outPolygon = 0, inPolygon = 0;
for (; inPolygon < 500; ) {
double abscissa = rand.nextDouble() * 5;
double ordinate = rand.nextDouble() * 4;
if (abscissa < 1 || abscissa > 4 || ordinate < 1 || ordinate > 3 || abscissa < 2 && ordinate > 2) {
tree.insert(new float[] { (float) abscissa, (float) ordinate }, outPolygon + 500);
outPolygon++;
} else if (abscissa > 1 && abscissa < 4 && ordinate > 1 && ordinate < 2 || abscissa > 2 && abscissa < 4 && ordinate >= 2 && ordinate < 3) {
tree.insert(new float[] { (float) abscissa, (float) ordinate }, inPolygon);
inPolygon++;
}
}
ImmutableRTree searchTree = ImmutableRTree.newImmutableFromMutable(tree);
Iterable<ImmutableBitmap> points = searchTree.search(PolygonBound.from(new float[] { 1.0f, 1.0f, 2.0f, 2.0f, 4.0f, 4.0f }, new float[] { 1.0f, 2.0f, 2.0f, 3.0f, 3.0f, 1.0f }));
ImmutableBitmap finalSet = bf.union(points);
Assert.assertTrue(finalSet.size() == 500);
Set<Integer> expected = new HashSet<>();
for (int i = 0; i < 500; i++) {
expected.add(i);
}
IntIterator iter = finalSet.iterator();
while (iter.hasNext()) {
Assert.assertTrue(expected.contains(iter.next()));
}
}
use of org.apache.druid.collections.bitmap.ImmutableBitmap in project druid by druid-io.
the class FiltersTest method testEstimateSelectivityOfBitmapList.
@Test
public void testEstimateSelectivityOfBitmapList() {
final int bitmapNum = 100;
final List<ImmutableBitmap> bitmaps = Lists.newArrayListWithCapacity(bitmapNum);
final BitmapIndex bitmapIndex = makeNonOverlappedBitmapIndexes(bitmapNum, bitmaps);
final double estimated = Filters.estimateSelectivity(bitmapIndex, IntIteratorUtils.toIntList(IntIterators.fromTo(0, bitmapNum)), 10000);
final double expected = 0.1;
Assert.assertEquals(expected, estimated, 0.00001);
}
use of org.apache.druid.collections.bitmap.ImmutableBitmap in project druid by druid-io.
the class Filters method estimateSelectivity.
/**
* Return an estimated selectivity for bitmaps given by an iterator.
*
* @param bitmaps iterator of bitmaps
* @param totalNumRows number of rows in the column associated with this bitmap index
*
* @return estimated selectivity
*/
public static double estimateSelectivity(final Iterator<ImmutableBitmap> bitmaps, final long totalNumRows) {
long numMatchedRows = 0;
while (bitmaps.hasNext()) {
final ImmutableBitmap bitmap = bitmaps.next();
numMatchedRows += bitmap.size();
}
return Math.min(1., (double) numMatchedRows / totalNumRows);
}
Aggregations