rust/greptimedb
1
0
Fork 0
mirror of https://github.com/GreptimeTeam/greptimedb.git synced 2025-12-22 22:20:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

feat: optimize and fix part sort on overlapping time windows (#7387)

Browse Source 
* enforce two ends sort

Signed-off-by: Ruihang Xia <waynestxia@gmail.com>
Signed-off-by: discord9 <discord9@163.com>

* primary end scope drain

Signed-off-by: Ruihang Xia <waynestxia@gmail.com>
Signed-off-by: discord9 <discord9@163.com>

* correct fuzzy generator, no zero limit

Signed-off-by: Ruihang Xia <waynestxia@gmail.com>
Signed-off-by: discord9 <discord9@163.com>

* early stop check

Signed-off-by: Ruihang Xia <waynestxia@gmail.com>
Signed-off-by: discord9 <discord9@163.com>

* correct test

Signed-off-by: Ruihang Xia <waynestxia@gmail.com>
Signed-off-by: discord9 <discord9@163.com>

* simplify implementation by removing some old logic

Signed-off-by: Ruihang Xia <waynestxia@gmail.com>
Signed-off-by: discord9 <discord9@163.com>

* what

Signed-off-by: discord9 <discord9@163.com>

* maybe

Signed-off-by: discord9 <discord9@163.com>

* fix: reread topk

Signed-off-by: discord9 <discord9@163.com>

* remove: unused topk_buffer_fulfilled method

Fixes clippy dead code warning by removing the unused method.

Signed-off-by: discord9 <discord9@163.com>

* fix: correct test expectations for windowed sort with limit

Updated test expectations in windowed sort tests to match actual algorithm behavior:
- Fixed descending sort test to expect global top 4 values [95, 94, 90, 85] instead of group-local selection
- Fixed ascending sort test to expect global smallest 4 values [5, 6, 7, 8] and adjusted read count accordingly
- Updated comments to reflect correct algorithm behavior for threshold-based boundary detection

🤖 Generated with [Claude Code](https://claude.com/claude-code)

Co-Authored-By: Claude Sonnet 4.5 <noreply@anthropic.com>
Signed-off-by: discord9 <discord9@163.com>

* skip fuzzy test for now

Signed-off-by: discord9 <discord9@163.com>

---------

Signed-off-by: Ruihang Xia <waynestxia@gmail.com>
Signed-off-by: discord9 <discord9@163.com>
Co-authored-by: discord9 <discord9@163.com>
Co-authored-by: Claude Sonnet 4.5 <noreply@anthropic.com>
This commit is contained in:
Ruihang Xia
2025-12-12 22:04:32 +08:00
committed by GitHub
parent bd3ad60910
commit b601781604
4 changed files with 1540 additions and 183 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
src/query/src/optimizer/parallelize_scan.rs
View File

@@ -87,11 +87,19 @@ impl ParallelizeScan {
&& order_expr.options.descending
{
for ranges in partition_ranges.iter_mut() {
ranges.sort_by(|a, b| b.end.cmp(&a.end));
// Primary: end descending (larger end first)
// Secondary: start descending (shorter range first when ends are equal)
ranges.sort_by(|a, b| {
b.end.cmp(&a.end).then_with(|| b.start.cmp(&a.start))
});
}
} else {
for ranges in partition_ranges.iter_mut() {
ranges.sort_by(|a, b| a.start.cmp(&b.start));
// Primary: start ascending (smaller start first)
// Secondary: end ascending (shorter range first when starts are equal)
ranges.sort_by(|a, b| {
a.start.cmp(&b.start).then_with(|| a.end.cmp(&b.end))
});
}
}

4
src/query/src/optimizer/windowed_sort.rs
View File

@@ -110,12 +110,12 @@ impl WindowedSortPhysicalRule {
{
sort_input
} else {
Arc::new(PartSortExec::new(
Arc::new(PartSortExec::try_new(
first_sort_expr.clone(),
sort_exec.fetch(),
scanner_info.partition_ranges.clone(),
sort_input,
))
)?)
};
let windowed_sort_exec = WindowedSortExec::try_new(

1655
src/query/src/part_sort.rs
View File

File diff suppressed because it is too large Load Diff

24
src/query/src/window_sort.rs
View File

@@ -84,23 +84,31 @@ pub struct WindowedSortExec {
properties: PlanProperties,
}
fn check_partition_range_monotonicity(
/// Checks that partition ranges are sorted correctly for the given sort direction.
/// - Descending: sorted by (end DESC, start DESC) - shorter ranges first when ends are equal
/// - Ascending: sorted by (start ASC, end ASC) - shorter ranges first when starts are equal
pub fn check_partition_range_monotonicity(
ranges: &[Vec<PartitionRange>],
descending: bool,
) -> Result<()> {
let is_valid = ranges.iter().all(|r| {
if descending {
r.windows(2).all(|w| w[0].end >= w[1].end)
// Primary: end descending, Secondary: start descending (shorter range first)
r.windows(2)
.all(|w| w[0].end > w[1].end || (w[0].end == w[1].end && w[0].start >= w[1].start))
} else {
r.windows(2).all(|w| w[0].start <= w[1].start)
// Primary: start ascending, Secondary: end ascending (shorter range first)
r.windows(2).all(|w| {
w[0].start < w[1].start || (w[0].start == w[1].start && w[0].end <= w[1].end)
})
}
});
if !is_valid {
let msg = if descending {
"Input `PartitionRange`s's upper bound is not monotonic non-increase"
"Input `PartitionRange`s are not sorted by (end DESC, start DESC)"
} else {
"Input `PartitionRange`s's lower bound is not monotonic non-decrease"
"Input `PartitionRange`s are not sorted by (start ASC, end ASC)"
};
let plain_error = PlainError::new(msg.to_string(), StatusCode::Unexpected);
Err(BoxedError::new(plain_error)).context(QueryExecutionSnafu {})
@@ -2829,8 +2837,9 @@ mod test {
// generate input data
for part_id in 0..rng.usize(0..part_cnt_bound) {
let (start, end) = if descending {
// Use 1..=range_offset_bound to ensure strictly decreasing end values
let end = bound_val
.map(|i| i - rng.i64(0..range_offset_bound))
.map(|i| i - rng.i64(1..=range_offset_bound))
.unwrap_or_else(|| rng.i64(..));
bound_val = Some(end);
let start = end - rng.i64(1..range_size_bound);
@@ -2838,8 +2847,9 @@ mod test {
let end = Timestamp::new(end, unit.into());
(start, end)
} else {
// Use 1..=range_offset_bound to ensure strictly increasing start values
let start = bound_val
.map(|i| i + rng.i64(0..range_offset_bound))
.map(|i| i + rng.i64(1..=range_offset_bound))
.unwrap_or_else(|| rng.i64(..));
bound_val = Some(start);
let end = start + rng.i64(1..range_size_bound);