My feedback

  1. 11 votes
    Sign in
    Sign in with: Microsoft
    Signed in as (Sign out)

    We’ll send you updates on this idea

    2 comments  ·  SQL Server » Bugs  ·  Flag idea as inappropriate…  ·  Admin →

    Upvotes: 125

    <=-=Aug 10 2007 9:17PM=-=>

    Hi Microsoft, please confirm this optimizer problem by running the scripts, it is self evident and can be optimised significantly better.

    Eg. For a minimum, the optimal plan is to obtain the minimum for each partition using the index and then taking the minimum of all the (partition) results. The same principle can apply to maximum, and for Top N over an index …

    The plan should stand out as optimal, because the number of reads over the index is very small, and there will be one set of page reads (usually only one page) for each partition…. you can use the assumption that the number of partitions is significantly smaller than the number of rows (or even count the number of partitions), to estimate the cost (page reads) – which comes out at about N pages where N is the number of partitions.…

    Amy supported this idea  · 
    An error occurred while saving the comment
    Amy commented  · 

    Please fix.

Feedback and Knowledge Base