tp: add INTERVAL FLATTEN to pipelines - #7692
Draft
LalitMaganti wants to merge 1 commit into
Draft
LalitMaganti wants to merge 1 commit into
LalitMaganti wants to merge 1 commit into
Conversation
FROM spans |> INTERVAL FLATTEN PER cpu AGGREGATE COUNT(*) AS n, SUM(weight) AS w Cuts overlapping rows at every start and end into disjoint segments, one row per segment with its bounds, the PER keys and the aggregates. A row of no width becomes a segment of no width counting the rows spanning it. Bounds follow INTERVAL INTERSECTION: null ts or dur is skipped, negative is an error. Only COUNT(*) and SUM for now. The operator needs its input grouped by the keys and ordered by ts within each group. Lowering tracks what order is known and adds Sort and GroupBy only when needed, e.g. no Sort for a dataframe sorted on ts. Its output keeps that order, so a following stage needs neither.
LalitMaganti
added this pull request to stack #7680
September 29, 2026 23:53
🎨 Perfetto UI Builds & Tests
|
This branch has not been deployed
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Cuts overlapping rows at every start and end into disjoint segments, one
row per segment with its bounds, the PER keys and the aggregates. A row of
no width becomes a segment of no width counting the rows spanning it.
Bounds follow INTERVAL INTERSECTION: null ts or dur is skipped, negative
is an error. Only COUNT(*) and SUM for now.
The operator needs its input grouped by the keys and ordered by ts within
each group. Lowering tracks what order is known and adds Sort and GroupBy
only when needed, e.g. no Sort for a dataframe sorted on ts. Its output
keeps that order, so a following stage needs neither.
Against the stdlib macros it replaces, on real traces (release build,
materializing the result as a table):
intervals_overlap_count_by_group!intervals_overlap_count_by_group!intervals_overlap_count_by_group!intervals_overlap_count!interval_self_intersect!