All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.apache.pinot.perf.BenchmarkOrDocIdIterator Maven / Gradle / Ivy

There is a newer version: 1.2.0
Show newest version
/**
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you under the Apache License, Version 2.0 (the
 * "License"); you may not use this file except in compliance
 * with the License.  You may obtain a copy of the License at
 *
 *   http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing,
 * software distributed under the License is distributed on an
 * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
 * KIND, either express or implied.  See the License for the
 * specific language governing permissions and limitations
 * under the License.
 */
package org.apache.pinot.perf;

import java.util.concurrent.TimeUnit;
import org.apache.pinot.core.common.BlockDocIdIterator;
import org.apache.pinot.core.operator.dociditerators.OrDocIdIterator;
import org.apache.pinot.segment.spi.Constants;
import org.openjdk.jmh.annotations.Benchmark;
import org.openjdk.jmh.annotations.BenchmarkMode;
import org.openjdk.jmh.annotations.Mode;
import org.openjdk.jmh.annotations.OutputTimeUnit;
import org.openjdk.jmh.annotations.Scope;
import org.openjdk.jmh.annotations.State;
import org.openjdk.jmh.runner.Runner;
import org.openjdk.jmh.runner.options.Options;
import org.openjdk.jmh.runner.options.OptionsBuilder;
import org.openjdk.jmh.runner.options.TimeValue;


@State(Scope.Benchmark)
public class BenchmarkOrDocIdIterator {
  private static final int NUM_DOCS = 100000;

  @Benchmark
  @BenchmarkMode(Mode.AverageTime)
  @OutputTimeUnit(TimeUnit.MICROSECONDS)
  public int arrayBased2() {
    OrDocIdIterator iterator = setUpArrayBased(2);
    int ret = 0;
    int docId;
    while ((docId = iterator.next()) != Constants.EOF) {
      ret += docId;
    }
    return ret;
  }

  @Benchmark
  @BenchmarkMode(Mode.AverageTime)
  @OutputTimeUnit(TimeUnit.MICROSECONDS)
  public int arrayBased5() {
    OrDocIdIterator iterator = setUpArrayBased(5);
    int ret = 0;
    int docId;
    while ((docId = iterator.next()) != Constants.EOF) {
      ret += docId;
    }
    return ret;
  }

  @Benchmark
  @BenchmarkMode(Mode.AverageTime)
  @OutputTimeUnit(TimeUnit.MICROSECONDS)
  public int arrayBased10() {
    OrDocIdIterator iterator = setUpArrayBased(10);
    int ret = 0;
    int docId;
    while ((docId = iterator.next()) != Constants.EOF) {
      ret += docId;
    }
    return ret;
  }

  @Benchmark
  @BenchmarkMode(Mode.AverageTime)
  @OutputTimeUnit(TimeUnit.MICROSECONDS)
  public int arrayBased20() {
    OrDocIdIterator iterator = setUpArrayBased(20);
    int ret = 0;
    int docId;
    while ((docId = iterator.next()) != Constants.EOF) {
      ret += docId;
    }
    return ret;
  }

  @Benchmark
  @BenchmarkMode(Mode.AverageTime)
  @OutputTimeUnit(TimeUnit.MICROSECONDS)
  public int arrayBased50() {
    OrDocIdIterator iterator = setUpArrayBased(50);
    int ret = 0;
    int docId;
    while ((docId = iterator.next()) != Constants.EOF) {
      ret += docId;
    }
    return ret;
  }

  private OrDocIdIterator setUpArrayBased(int numIterators) {
    BlockDocIdIterator[] iterators = new BlockDocIdIterator[numIterators];
    for (int i = 0; i < numIterators; i++) {
      iterators[i] = new FixedStepsDocIdIterator(NUM_DOCS, i + 1);
    }
    return new OrDocIdIterator(iterators);
  }

  private static class FixedStepsDocIdIterator implements BlockDocIdIterator {
    private final int _numDocs;
    private final int _steps;

    private int _nextDocId = 0;

    public FixedStepsDocIdIterator(int numDocs, int steps) {
      _numDocs = numDocs;
      _steps = steps;
    }

    @Override
    public int next() {
      if (_nextDocId < _numDocs) {
        int nextDocId = _nextDocId;
        _nextDocId += _steps;
        return nextDocId;
      }
      return Constants.EOF;
    }

    @Override
    public int advance(int targetDocId) {
      _nextDocId = (targetDocId + _steps - 1) / _steps * _steps;
      return next();
    }
  }

  public static void main(String[] args)
      throws Exception {
    Options opt =
        new OptionsBuilder().include(BenchmarkOrDocIdIterator.class.getSimpleName()).warmupTime(TimeValue.seconds(5))
            .warmupIterations(2).measurementTime(TimeValue.seconds(5)).measurementIterations(3).forks(1).build();

    new Runner(opt).run();
  }
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy