Class PushdownResult

java.lang.Object
io.deephaven.engine.table.impl.PushdownResult
All Implemented Interfaces:
SafeCloseable, AutoCloseable

public final class PushdownResult extends Object implements SafeCloseable
Records the results of a push-down predicate filter operation.
  • Field Details

    • UNSUPPORTED_ACTION_COST

      public static final long UNSUPPORTED_ACTION_COST
      The estimated cost when the filter cannot or should not be pushed down.
      See Also:
    • TABLE_SINGLE_VALUE_COLUMN_COST

      public static final long TABLE_SINGLE_VALUE_COLUMN_COST
      The entire column contains a single in memory value, so a single read is sufficient to determine matches.

      Complexity/access: O(1) / In-Memory Data, resolves "yes", "no"

    • TABLE_SORTED_DATA_COST

      public static final long TABLE_SORTED_DATA_COST
      Binary searches sorted data at the Table-level.

      Complexity/access: O(log(rows)) / In-Memory or Storage Data, resolves "yes", "no"

    • TABLE_IN_MEMORY_DATA_INDEX_COST

      public static final long TABLE_IN_MEMORY_DATA_INDEX_COST
      Filters an already-materialized Table-level index.

      Complexity/access: O(rows / 4) / In-Memory Data, resolves "yes", "no"

    • REGION_SINGLE_VALUE_COST

      public static final long REGION_SINGLE_VALUE_COST
      The entire region contains a single value, so a single read is sufficient to determine matches. Requires additional overhead in applying the filter (e.g. chunk/context/dummy table creation).

      Complexity/access: O(regions) / In-Memory Data, resolves "yes", "no"

    • LOCATION_IN_MEMORY_DATA_INDEX_COST

      public static final long LOCATION_IN_MEMORY_DATA_INDEX_COST
      Filters an already-materialized location-level index. Requires filter copying and initialization per region compared to table-level.

      Complexity/access: O(rows / 4) / In-Memory Access, resolves "yes", "no"

    • REGION_METADATA_STATS_COST

      public static final long REGION_METADATA_STATS_COST
      Loads and uses region metadata (min/max/null_count, etc.).

      Complexity/access: O(regions) / Storage Data, resolves "no", "maybe"

    • REGION_BLOOM_FILTER_COST

      public static final long REGION_BLOOM_FILTER_COST
      Loads and uses Bloom filters.

      Complexity/access: O(regions) / Storage Data, resolves "no", "maybe"

    • LOCATION_DEFERRED_DATA_INDEX_COST

      public static final long LOCATION_DEFERRED_DATA_INDEX_COST
      Loads and filters a location-level index. Requires additional filter copying and initialization per region compared to table-level.

      Complexity/access: O(rows / 4) / Storage Data, resolves "yes", "no"

    • REGION_SORTED_DATA_COST

      public static final long REGION_SORTED_DATA_COST
      Binary searches sorted data.

      Complexity/access: O(log(rows)) / Storage Data, resolves "yes", "no"

    • REGION_DICTIONARY_DATA_COST

      public static final long REGION_DICTIONARY_DATA_COST
      Loads and reads a dictionary to determine matches.

      Complexity/access: O(rows) / Storage Data, resolves "yes", "no" for dictionary regions ("maybe" otherwise)

  • Method Details