[Chore] Merge distributed Stream replies as batches in the liaison coordinator
Los mantenedores suelen responder en 1 día
Nadie ha tomado este issue todavía.
Evaluación
- Dificultad
- 4/5
- Tiempo estimado
- 3-5 días
- Aptitud para principiantes
- 58/100
- Tipo de issue
- Refactorización
- Claridad
- Bien especificado
- Estado de actividad
- Activo
- Stack tecnológico
- go
Línea de trabajo
Read pkg/query/logical/stream/stream_plan_distributed.go, especially distributedPlan.Execute and decodeNodeElements, then inspect pkg/query/vectorized/stream for BuildStreamMergePipeline and the BatchSource and schema alignment work in #1426. Add a fake-broadcast test through distributedPlan.Execute for frame batches, traced replies, errors, and cancellation; done means the explicit oracle cases pass, frames are materialized as Elements only after merging, and reply batches are released on every exit path.
Escrito por el modelo de indexación a partir del texto del issue.
Descripción
Summary (executable leaf)
The liaison's distributed Stream coordinator should merge data-node frame replies as columnar batches, instead of decoding each frame into []*streamv1.Element and merging rows. This is the distributed-coordinator half of #14070's original scope. #14070 was narrowed to the local multi-group path (apache/skywalking-banyandb#1426), and this half has no issue. Under #13998.
Checked against BanyanDB origin/main @ 450c73a3:
pkg/query/logical/stream/stream_plan_distributed.godistributedPlan.Execute(around lines 140–199) broadcasts the query. For each reply,decodeNodeElements(around 212–234) decodes a frame withstreamframe.Decodeand immediately callsvstream.BuildElementsFromBatch, turning the whole batch into Elements. The replies are then k-way merged as rows (newSortableElements→sort.NewItemIter, around 184–187), deduplicated byElementIdwith aseenmap, and sliced bydistributedLimit(offset/limit, around 339–355).- Data nodes reply with a frame whenever the query is not traced.
banyand/query/processor.go:366streamVecEmitAsFramereturnsdistributed && wireModeRaw && !traced, and bothsvc_liaison.go:165andsvc_standalone.go:262set the raw wire mode. So in a normal distributed query every reply is a frame, and the coordinator materializes all of them as rows. - The batch operators this needs already exist:
pkg/query/vectorized/streamSortedMerge(time orOrderKey, asc/desc, stable ties) →Distinct(first-seen by element id) →Limit(offset, limit), composed byBuildStreamMergePipeline. apache/skywalking-banyandb#1426 adds a multi-sourceBatchSourceand union-schema alignment for the local path, and this work should reuse them.
Required change
- In
distributedPlan.Execute, decode each frame reply into a batch and feed every node's batches into one merge pipeline (reuseBuildStreamMergePipelineand #1426'sBatchSource/ schema alignment; no third merger). Replies with differing projected tags are aligned to one merged schema the same way #1426 aligns groups. - Apply the request's offset/limit in the pipeline's
Limit, and build Elements once, from the pipeline output, for the client response.distributedLimitthen slices nothing for this path (keep it for the traced path below, or fold it in). - Keep the per-node cap (
queryRequest.Limit = maxElementSize) and the span tags (response_count,element_id_count) as today. - Traced queries stay on the current path. When any reply is a
*streamv1.QueryResponse(a traced query), keep today's Element merge for that broadcast, includingspan.AddSubTrace. Converting protobuf replies to batches is out of scope.
Concrete oracle
Two data nodes, frame replies, ordered by key ascending:
Node 1: A(key=1), B(key=3)
Node 2: A(key=1), C(key=2)
The two copies of A are the same element (same ElementID, a replica).
- Ascending, offset 1, limit 2: C, B.
- Descending, offset 0, limit 2: B, C.
- Ordered by timestamp instead (A=1, C=2, B=3): the same results.
- The ordering tag isn't in the client projection: same order, and the tag is absent from the response (it travels in the frame's
OrderKeycolumn). - Each node's rows split across two frames or batches: same results.
- A node that returns an error: the merged result of the other nodes plus the error, as today (
multierr).
Acceptance criteria
- A test through
distributedPlan.Executewith a fake broadcast of frame replies asserts every case of the oracle. - Path-sensitive: for frame replies, no Element is built before the merge.
decodeNodeElementsno longer callsBuildElementsFromBatchon the frame path, and a test fails if per-reply Element materialization is restored, e.g. by asserting Elements are built once from the merged output. Asserting the answers alone is insufficient, because the current row merge returns the same answers. - A traced query (protobuf replies) returns the same elements as before and still attaches every node's sub-trace.
- Batches from every reply are released on completion, on a decode error, and on context cancellation; covered by tests.
- Existing tests pass:
go test ./pkg/query/logical/stream/... ./pkg/query/vectorized/stream/... ./banyand/query
go test -tags=querymetrics ./test/integration/distributed/query/...
Dependencies
Builds on apache/skywalking-banyandb#1426 (BatchSource, schema alignment). Start after it merges, or base the branch on it.
Out of scope
- Converting traced (protobuf) replies to batches; the Element path stays for them. That's a follow-up, after which
newSortableElementsandcomparableElementcan be deleted. - The Trace query merges (
pkg/query/logical/trace), which apache/skywalking-banyandb#1423 is reworking. - Wire format, per-node cap semantics, filter-first semantics, and new memory-bound claims.
Compatibility and review policy
- Preserve existing on-disk and wire formats.
- Use explicit, hand-calculated expected results; do not use the removed row engine as the test oracle.
- Lenguaje dominante
- Java
- Estrellas
- 25k
- Forks
- 6.6k
- Merge medio
- 15 h 4 min
- PR fusionados (30 d)
- 32
Preparar el entorno
- Sin Dockerfile ni archivo de Docker Compose
- Tiene una plantilla de pull request
- Leer la guía de contribución
Primeros pasos
- Lee el issue completo y luego la guía de contribución del proyecto.
- Comenta en el issue que vas a ocuparte — evita que dos personas hagan lo mismo.
- Haz un fork del repositorio y trabaja en una rama.
- Abre un pull request que haga referencia al número del issue.
Más de apache/skywalking
-
Dificultad 3/5 1-2 días Aptitud para principiantes 66/100
apache/skywalking#14175 ·
Los mantenedores suelen responder en 1 día
-
[Bug] Trace profiling segment list becomes empty after the task finishes, while still inside the query windowPosiblemente ocupada @hanahmily la tomó hace 1 día. Abiertobug database
apache/skywalking#14172 · 3 comentarios · 1 asignado ·
Los mantenedores suelen responder en 1 día
-
[Bug] BanyanDB trace block metadata format changed in 0.11 without a file format version bumpPosiblemente ocupada @hanahmily la tomó hace 2 días. Abiertobug database
apache/skywalking#14169 · 1 asignado ·
Los mantenedores suelen responder en 1 día
-
chore CLI database
Dificultad 5/5 Más de una semana Aptitud para principiantes 25/100
apache/skywalking#14168 ·
Los mantenedores suelen responder en 1 día
-
[Bug] BanyanDB stream scans run out of query memory even with a small limitPosiblemente ocupada @hanahmily la tomó hace 5 días. Abiertobug database
apache/skywalking#14165 · 3 comentarios · 2 asignados ·
Los mantenedores suelen responder en 1 día
Todos los issues de apache/skywalking
Issues similares
-
bug web-server
Dificultad 2/5 1-3 horas Aptitud para principiantes 78/100
jooby-project/jooby#4035 ·
Los mantenedores suelen responder en 1 día
-
L: javascript
Dificultad 2/5 1-3 horas Aptitud para principiantes 72/100
dependabot/dependabot-core#16744 ·
Los mantenedores suelen responder en 1 día
-
intake mcp-intake needs-human-review priority:high type:bug
Dificultad 2/5 1-3 horas Aptitud para principiantes 62/100
Ikalus1988/MisakaNet#3987 · 3 comentarios ·
Los mantenedores suelen responder en 1 día
-
Dificultad 2/5 1-3 horas Aptitud para principiantes 82/100
quarkiverse/quarkus-google-cloud-services#1187 ·
Los mantenedores suelen responder en 1 día
-
Dificultad 1/5 Menos de una hora Aptitud para principiantes 82/100
locationtech/jts#1250 ·