`MoveTowardsLeafNodes` placement implies speculative evaluation, but the docs don't say so

Abierto Apto para principiantes
#27,487 3 comentarios 0 reacciones 0 asignados Ver en GitHub

Los mantenedores suelen responder en 1 día

@Inf1mum ya está trabajando en esto.

Desde el 17/11/2026.

  • #27519 de @Inf1mum — abierto

Evaluación

Dificultad
2/5
Tiempo estimado
1-3 horas
Aptitud para principiantes
75/100
Tipo de issue
Documentación
Claridad
Bien especificado
Estado de actividad
Activo
Stack tecnológico
rust

Línea de trabajo

Empieza por la documentación de ExpressionPlacement::MoveTowardsLeafNodes y ScalarUDFImpl::placement enlazada desde el issue. Lee cómo la extracción y el pushdown de expresiones hoja pueden evaluar expresiones en filas excluidas por ramas de CASE o filtros, y luego documenta el requisito de seguridad en ambas APIs. La tarea estará completa cuando ambas documentaciones indiquen que las expresiones con esta ubicación no deben fallar ni tener efectos secundarios en ninguna fila de entrada.

Escrito por el modelo de indexación a partir del texto del issue.

Descripción

Describe the bug

ExpressionPlacement::MoveTowardsLeafNodes is documented as a performance hint: the expression is cheap and can be pushed down towards the leaves of the plan. When the optimizer acts on that hint, it also runs the expression on rows that the original plan never evaluated it on:

  • ExtractLeafExpressions extracts MoveTowardsLeafNodes sub-expressions from anywhere inside an expression tree, including the branches of CASE. In the extraction projection, they are evaluated for every input row, not just the rows the branch selects.
  • PushDownLeafProjections then pushes the extraction projections below Filter nodes, so the expressions also run on rows the filter removes.

So an expression with this placement must be safe to evaluate on rows that a filter or a conditional would exclude: it must not fail on them or have side effects. Neither ExpressionPlacement::MoveTowardsLeafNodes nor ScalarUDFImpl::placement states this. The built-in functions with this placement (get_field, input_file_name, file_row_index) meet the requirement as far as I can tell. A user-defined function that returns MoveTowardsLeafNodes because it is cheap, but fails on some inputs, can make a query fail even though SQL CASE and WHERE semantics say that input is never evaluated.

To Reproduce

The plan below shows how get_field is moved with the default configuration (datafusion.optimizer.enable_leaf_expression_pushdown = true):

CREATE TABLE t AS SELECT * FROM (VALUES
  (1,  named_struct('a', 1, 'b', 2)),
  (-1, named_struct('a', 3, 'b', 4))
) AS v(x, s);

EXPLAIN SELECT CASE WHEN x > 0 THEN s['a'] WHEN x < -100 THEN 0 END FROM t WHERE x <> 5;
logical_plan
01)Projection: CASE WHEN t.x > Int64(0) THEN __datafusion_extracted_1 WHEN t.x < Int64(-100) THEN Int64(0) END AS ...
02)--Filter: t.x != Int64(5)
03)----Projection: get_field(t.s, Utf8("a")) AS __datafusion_extracted_1, t.x
04)------TableScan: t projection=[x, s]

get_field(t.s, 'a') came from the first THEN branch, and it is now evaluated below the filter for every row of t.

Replace s['a'] with a UDF that returns MoveTowardsLeafNodes and fails on some values, for example a checked conversion that fails when its argument is 0. The query then fails on rows where x <= 0 or x = 5, even though the result would never include the UDF's value for those rows.

Expected behavior

Either of these would resolve it:

  1. Document the requirement (preferred). State on ExpressionPlacement::MoveTowardsLeafNodes and ScalarUDFImpl::placement that an expression with this placement may be evaluated on rows that enclosing filters or conditional expressions would exclude, so it must not fail or have side effects on any input row. This matches what the optimizer already relies on.
  2. Stop speculative evaluation: don't extract leaf expressions from conditional sub-expressions (CASE branches, the right side of short-circuiting AND/OR), and don't push extraction projections below filters when the extracted expression could fail. That would give up much of the benefit of the leaf pushdown optimization, which is mainly about evaluating get_field close to the scan.
Additional context

The question came up while reviewing #26589, which precomputes MoveTowardsLeafNodes expressions over the whole batch before evaluating CASE branches (https://github.com/apache/datafusion/pull/26589#discussion_r4581490634). That PR relies on the same assumption at the physical level, so documenting the requirement would cover both.

Lenguaje dominante
Rust
Estrellas
9.6k
Forks
2.6k
Merge medio
3 d 5 h
PR fusionados (30 d)
352

Preparar el entorno

Abrir en Codespaces

Inicia el contenedor de desarrollo del proyecto en tu navegador, con tu propia cuenta de GitHub.

Primeros pasos

  1. Lee el issue completo y luego la guía de contribución del proyecto.
  2. Comenta en el issue que vas a ocuparte — evita que dos personas hagan lo mismo.
  3. Haz un fork del repositorio y trabaja en una rama.
  4. Abre un pull request que haga referencia al número del issue.

Más de apache/datafusion

Todos los issues de apache/datafusion

Issues similares

Más issues de Rust

Recibe los nuevos issues en tu correo

Un resumen breve de issues de GitHub para principiantes.