Skip to content

Create benchmark for sorted data #18976

Closed
Closed

Description

@zhuqi-lucas

Is your feature request related to a problem or challenge?

We need benchmark for sorted data, so we can test different solution for the performance:

For example, if we support reverse scan policy for sort pushdown.

Describe the solution you'd like

No response

Describe alternatives you've considered

No response

Additional context

No response

Activity

  1. 2010YOUY01 commented on Nov 28, 2025

    @2010YOUY01
    Member

    Just to provide a bit of background:

    Suppose we have a Parquet file with an existing sort order of event_time ASC.
    Now we want to benchmark workloads that read the tail of the file using a query such as:

    select *
    from t
    order by event_time desc
    limit 10

    This is used to evaluate the optimizations in the linked issue/PRs.

  2. zhuqi-lucas commented on Nov 28, 2025

    @zhuqi-lucas
    ContributorAuthor

    Thank you @2010YOUY01 for good note!

  3. self-assigned this
    on Dec 25, 2025
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

Labels

enhancementNew feature or request

Projects

No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions