Public

Returns default estimates for selectivities, in the absence of stats.

guessSelectivity

Returns true if the columns represented in a bit mask are definitely known to
form a unique column s

areColumnsDefinitelyUnique

areColumnsDefinitelyUniqueWhenNullsFiltered

Computes the number of distinct rows for a set of keys returned from a join.
Also known as NDV (numb

getJoinDistinctRowCount

Takes the difference between two predicates, removing from the first any
predicates also in the seco

minusPreds

estimateFilteredRows

Returns a point on a line.The result is always a value between minY and maxY,
even if x is not betwe

linear

Returns an estimate of the number of rows returned by a Join.

getJoinRowCount

areColumnsUnique

areColumnsUniqueWhenNullsFiltered

Caps a double value at Double.MAX_VALUE if it's currently infinity

capInfinity

Computes the cardinality of a particular expression from the projection list.

cardOfProjExpr

Returns whether a relational expression is already sorted and has fewer rows
than the sum of offset 

checkInputForCollationAndLimit

Computes the selectivity of a semijoin filter if it is applied on a fact table.
The computation is b

computeSemiJoinSelectivity

Computes the population size for a set of keys returned from a join

getJoinPopulationSize

Returns an estimate of the number of rows returned by a Minus.

getMinusRowCount

Returns the selectivity value stored in a call.

getSelectivityValue

Returns an estimate of the number of rows returned by a SemiJoin.

getSemiJoinRowCount

Returns an estimate of the number of rows returned by a Union(before duplicates
are eliminated).

getUnionAllRowCount

Creates a RexNode that stores a selectivity value corresponding to the
selectivity of a semijoin. Th

makeSemiJoinSelectivityRexNode

Point

Reactive rest calls using spring rest template

Represents a command that can be executed. Often used to run code in a different
Thread.

java.lang.Runnable

 KeyStore is responsible for maintaining cryptographic keys and their owners. 
The type of the syste

java.security.KeyStore

 Stack is a Last-In/First-Out(LIFO) data structure which represents a stack of
objects. It enables u

java.util.Stack

A task that returns a result and may throw an exception. Implementors define a
single method with no

java.util.concurrent.Callable

An ExecutorService that executes each submitted task using one of possibly
several pooled threads, n

java.util.concurrent.ThreadPoolExecutor

Main entry-point into the library.

Options represents a collection of Option objects, which describ

org.apache.commons.cli.Options

getResourceAsStream

scheduleAtFixedRate

getExternalFilesDir

/**
   * Returns the number of distinct values provided numSelected are selected
   * where there are domainSize distinct values.
   *
   * <p>Note that in the case where domainSize == numSelected, it's not true
   * that the return value should be domainSize. If you pick 100 random values
   * between 1 and 100, you'll most likely end up with fewer than 100 distinct
   * values, because you'll pick some values more than once.
   *
   * @param domainSize  number of distinct values in the domain
   * @param numSelected number selected from the domain
   * @return number of distinct values for subset selected
   */

// Cap the input sizes at MAX_VALUE to ensure that the calculations

// using these values return meaningful values

// 1. Assume we pick 80 random values between 1 and 100.

// 2. The chance we skip any given value is .99 ^ 80

// 3. Thus on average we will skip .99 ^ 80 percent of the values

// 4. Generalized, we skip ( (n-1)/n ) ^ k values where n is the

//    number of possible values and k is the number we are selecting

// 5. This can be rewritten via approximation (if you want to

//    know why approximation is called for here, ask Bill Keese):

// ~= e ^ (k * (-1/n))  because ln(1+x) ~= x for small x

// 6. Flipping it from number skipped to number visited, we get:

/**
   * Returns the number of distinct values provided numSelected are selected
   * where there are domainSize distinct values.
   *
   * <p>Note that in the case where domainSize == numSelected, it's not true
   * that the return value should be domainSize. If you pick 100 random values
   * between 1 and 100, you'll most likely end up with fewer than 100 distinct
   * values, because you'll pick some values more than once.
   *
   * @param domainSize  number of distinct values in the domain
   * @param numSelected number selected from the domain
   * @return number of distinct values for subset selected
   */

How to use capInfinitymethodin org.apache.calcite.rel.metadata.RelMdUtil

Best Java code snippets using org.apache.calcite.rel.metadata.RelMdUtil.capInfinity (Showing top 2 results out of 315)

How to use
capInfinity
method
in
org.apache.calcite.rel.metadata.RelMdUtil