Examples with AndOperator com.linkedin.pinot.core.operator.filter.AndOperator used on opensource projects

Example 1 with AndOperator

use of com.linkedin.pinot.core.operator.filter.AndOperator in project pinot by linkedin.

the class AndOperatorTest method testIntersectionForThreeLists.

@Test
public void testIntersectionForThreeLists() {
    int[] list1 = new int[] { 2, 3, 6, 10, 15, 16, 28 };
    int[] list2 = new int[] { 3, 6, 8, 20, 28 };
    int[] list3 = new int[] { 1, 2, 3, 6, 30 };
    List<BaseFilterOperator> operators = new ArrayList<BaseFilterOperator>();
    operators.add(makeFilterOperator(list1));
    operators.add(makeFilterOperator(list2));
    operators.add(makeFilterOperator(list3));
    final AndOperator andOperator = new AndOperator(operators);
    andOperator.open();
    BaseFilterBlock block;
    while ((block = andOperator.getNextBlock()) != null) {
        final BlockDocIdSet blockDocIdSet = block.getBlockDocIdSet();
        final BlockDocIdIterator iterator = blockDocIdSet.iterator();
        int docId;
        while ((docId = iterator.next()) != Constants.EOF) {
        //        System.out.println(docId);
        }
    }
    andOperator.close();
}

Example 2 with AndOperator

use of com.linkedin.pinot.core.operator.filter.AndOperator in project pinot by linkedin.

the class AndOperatorTest method testComplexWithOr.

@Test
public void testComplexWithOr() {
    int[] list1 = new int[] { 2, 3, 6, 10, 15, 16, 28 };
    int[] list2 = new int[] { 3, 6, 8, 20, 28 };
    int[] list3 = new int[] { 1, 2, 3, 6, 30 };
    List<BaseFilterOperator> operators = new ArrayList<>();
    operators.add(makeFilterOperator(list3));
    operators.add(makeFilterOperator(list2));
    final OrOperator orOperator = new OrOperator(operators);
    List<BaseFilterOperator> operators1 = new ArrayList<>();
    operators1.add(orOperator);
    operators1.add(makeFilterOperator(list1));
    final AndOperator andOperator = new AndOperator(operators1);
    andOperator.open();
    BaseFilterBlock block;
    while ((block = andOperator.getNextBlock()) != null) {
        final BlockDocIdSet blockDocIdSet = block.getBlockDocIdSet();
        final BlockDocIdIterator iterator = blockDocIdSet.iterator();
        int docId;
        while ((docId = iterator.next()) != Constants.EOF) {
        //        System.out.println(docId);
        }
    }
    andOperator.close();
}

Example 3 with AndOperator

use of com.linkedin.pinot.core.operator.filter.AndOperator in project pinot by linkedin.

the class AndOperatorTest method testComplex.

@Test
public void testComplex() {
    int[] list1 = new int[] { 2, 3, 6, 10, 15, 16, 28 };
    int[] list2 = new int[] { 3, 6, 8, 20, 28 };
    int[] list3 = new int[] { 1, 2, 3, 6, 30 };
    List<BaseFilterOperator> operators = new ArrayList<>();
    operators.add(makeFilterOperator(list1));
    operators.add(makeFilterOperator(list2));
    final AndOperator andOperator1 = new AndOperator(operators);
    List<BaseFilterOperator> operators1 = new ArrayList<>();
    operators1.add(andOperator1);
    operators1.add(makeFilterOperator(list3));
    final AndOperator andOperator = new AndOperator(operators1);
    andOperator.open();
    BaseFilterBlock block;
    while ((block = andOperator.getNextBlock()) != null) {
        final BlockDocIdSet blockDocIdSet = block.getBlockDocIdSet();
        final BlockDocIdIterator iterator = blockDocIdSet.iterator();
        int docId;
        while ((docId = iterator.next()) != Constants.EOF) {
        //        System.out.println(docId);
        }
    }
    andOperator.close();
}

Example 4 with AndOperator

use of com.linkedin.pinot.core.operator.filter.AndOperator in project pinot by linkedin.

the class FilterPlanNode method reorder.

/**
   * Re orders operators, puts Sorted -> Inverted and then Raw scan. TODO: With Inverted, we can
   * further optimize based on cardinality
   * @param operators
   */
private static void reorder(List<BaseFilterOperator> operators) {
    final Map<Operator, Integer> operatorPriorityMap = new HashMap<Operator, Integer>();
    for (Operator operator : operators) {
        Integer priority = Integer.MAX_VALUE;
        if (operator instanceof SortedInvertedIndexBasedFilterOperator) {
            priority = 0;
        } else if (operator instanceof AndOperator) {
            priority = 1;
        } else if (operator instanceof BitmapBasedFilterOperator) {
            priority = 2;
        } else if (operator instanceof ScanBasedFilterOperator) {
            priority = 3;
        } else if (operator instanceof OrOperator) {
            priority = 4;
        }
        operatorPriorityMap.put(operator, priority);
    }
    Comparator<? super Operator> comparator = new Comparator<Operator>() {

        @Override
        public int compare(Operator o1, Operator o2) {
            return Integer.compare(operatorPriorityMap.get(o1), operatorPriorityMap.get(o2));
        }
    };
    Collections.sort(operators, comparator);
}

Example 5 with AndOperator

use of com.linkedin.pinot.core.operator.filter.AndOperator in project pinot by linkedin.

the class FilterPlanNode method buildNonLeafOperator.

/**
   * Helper method to build AND/OR operators.
   * <ul>
   *   <li> Returns {@link EmptyFilterOperator} if at least on child always evaluates to false for AND. </li>
   *   <li> Returns {@link EmptyFilterOperator} if all children always evaluates to false for OR. </li>
   *   <li> Returns {@link AndOperator} or {@link OrOperator} based on filterType, otherwise. </li>
   * </ul>
   * @param filterType AND/OR
   * @param nonFalseChildren Children that are not alwaysFalse.
   * @param numChildrenAlwaysFalse Number of children that are always false.
   * @param numChildren Total number of children.
   * @param optimizeAlwaysFalse Optimize alwaysFalse predicates
   * @return Filter Operator created
   */
private static BaseFilterOperator buildNonLeafOperator(FilterOperator filterType, List<BaseFilterOperator> nonFalseChildren, int numChildrenAlwaysFalse, int numChildren, boolean optimizeAlwaysFalse) {
    BaseFilterOperator operator;
    switch(filterType) {
        case AND:
            if (optimizeAlwaysFalse && numChildrenAlwaysFalse > 0) {
                operator = new EmptyFilterOperator();
            } else {
                reorder(nonFalseChildren);
                operator = new AndOperator(nonFalseChildren);
            }
            break;
        case OR:
            if (optimizeAlwaysFalse && numChildrenAlwaysFalse == numChildren) {
                operator = new EmptyFilterOperator();
            } else {
                reorder(nonFalseChildren);
                operator = new OrOperator(nonFalseChildren);
            }
            break;
        default:
            throw new UnsupportedOperationException("Not support filter type - " + filterType + " with children operators");
    }
    return operator;
}