Hello
> This sounds like an interesting idea, I like it because it omit the needs for "global statistics" effort for
partitionedtable since it just use the first partition it knows. Of couse it has its drawback that "first"
> partition can't represent other partitions.
This method uses global statistics for all partitions.
The cache uses standard path building functions (it calculates selectivity for path), but it avoids calling all of them
forthe second and later partitions in a group.
The concept is similar to the GEQO method used for joins.
We skip creating some path variants if building all paths would take too long.
> One of the Arguments of this patch might be "What if other partitions have a pretty different statistics from the
firstpartition?". If I were you, I might check all the used statistics on this stage and try to find out a similar
algorithmsto > prove that the best path would be similar too. This can happens once when the statistics is gathered.
Howeverthis might be not easy.
Yes, maybe we can split partitions by groups not only by available index lists but also by some statistical property
ranges.
--
Best Regards
Ivan Bykov
