Re: [PATCH] Incremental sort (was: PoC: Partial sort)
James Coleman <jtc331@gmail.com>
Attachments
- 001-consider-startup-cost-in-add-partial-path_v1.patch (application/octet-stream) patch v1
- 002-incremental-sort_v31.patch (application/octet-stream) patch v31
On Fri, Sep 13, 2019 at 10:51 AM Tomas Vondra <tomas.vondra@2ndquadrant.com> wrote: > > On Thu, Sep 12, 2019 at 12:49:29PM -0300, Alvaro Herrera wrote: > >On 2019-Jul-30, Tomas Vondra wrote: > >> I've decided to do a couple of experiments, trying to make my mind about > >> which modified places matter to diffrent queries. But instead of trying > >> to reverse engineer the queries, I've taken a different approach - I've > >> compiled a list of queries that I think are sensible and relevant, and > >> then planned them with incremental sort enabled in different places. > > > >[...] > > > >> The list of queries (synthetic, but hopefully sufficiently realistic) > >> and a couple of scripts to collect the plans is in this repository: > >> > >> https://github.com/tvondra/incremental-sort-tests-2 > >> > >> There's also a spreadsheet with a summary of results, with a visual > >> representation of which GUCs affect which queries. > > > >OK, so we have that now. I suppose this spreadsheet now tells us which > >places are useful and which aren't, at least for the queries that you've > >tested. Dowe that mean that we want to get the patch to consider adding > >paths only the places that your spreadsheet says are useful? I'm not > >sure what the next steps are for this patch. > > > > Yes. I think the spreadsheet call help us with answering two things: > > 1) places actually affecting the plan (all but three do) > > 2) redundant places (there are some cases where two GUCs produce the > same plan in the end) To expand on this further, (1) should probably help us to be able to write test cases. Additionally, one big thing we still need that's somewhat external to the patch is a good way to benchmark/a set of queries that we believe are representative enough to be good benchmarks. I'd really appreciate some input from you all on that particular question; I feel like it's in some sense the biggest barrier to getting the patch merged, but also the part where long experience in the community/exposure to other use cases will probably be quite valuable. > Of course, this does assume the query set makes sense and is somewhat > realistic, but I've tried to construct queries where that is true. We > may extend it over time, of course. > > I think we've agreed to add incremental sort paths different places in > separate patches, to make review easier. So this may be a useful way to > decide which places to address first. I'd probably do it in this order: > > - create_ordered_paths > - create_ordered_paths (parallel part) > - add_paths_to_grouping_rel > - ... not sure ... > > but that's just a proposal. It'd give us most of the benefits, I think, > and we could also focus on the rest of the patch. Certainly the first two seem like pretty obvious most necessary base cases. I think supporting group bys also seems like a pretty standard case, so at first glance I'd say this seems like a reasonable course to me. I'm going to start breaking up the patches in this thread into a series in support of that. Since I've started a new thread with the add_partial_path change, I'll include that patch here as part of this series also. Do you think it's worth moving the tuplesort changes into a standalone patch in the series also? Attached is a rebased v31 now broken into the following: - 001-consider-startup-cost-in-add-partial-path_v1.patch: From the other thread (Tomas's patch unmodified) - 002-incremental-sort_v31.patch: Updated base incremental sort patch Besides rebasing, I've changed the enable_incrementalsort GUC to prevent generating paths entirely rather than being cost-based, since incremental sort is never absolutely necessary in the way regular sort is. I'm hoping to add 003 soon with the initial parallel parts, but I'm about out of time right now and wanted to get something out, so sending this without that. Side question: for the patch tester do I have to attach each part of the series each time even if nothing's changed in several of them? And does the vN number at the end need to stay the same for all of them? My attachments to this email don't follow that... Also, since this email changes patch naming, so I need to do anything to clear out the old ones? (I suppose if not, then that would imply an answer to the first question also.) James
Commits
-
Further adjustments to Hashagg EXPLAIN ANALYZE output
- 40efbf8706cd 14.0 cited
-
Rework EXPLAIN format for incremental sort
- 6a918c3ac8a6 13.0 landed
-
Fix typos and improve incremental sort comments
- 1a40d37a9faf 13.0 landed
-
Stabilize incremental_sort tests
- cea09246e578 13.0 landed
-
Minor improvements in Incremental Sort explain
- d22782a5392f 13.0 landed
-
Consider Incremental Sort paths at additional places
- ba3e76cc571e 13.0 landed
-
Fix representation of SORT_TYPE_STILL_IN_PROGRESS.
- c7654f6a3779 13.0 landed
-
Fix failures in incremental_sort due to number of workers
- 23ba3b5ee278 13.0 landed
-
Fix show_incremental_sort_info with force_parallel_mode
- 7d6d82a52493 13.0 landed
-
Implement Incremental Sort
- d2d8a229bc58 13.0 landed
-
Fix handling of "Subplans Removed" field in EXPLAIN output.
- 7d91b604d9b5 13.0 cited
-
Fix EXPLAIN (SETTINGS) to follow policy about when to print empty fields.
- 3ec20c7091e9 13.0 cited
-
Ensure plpgsql result tuples have the right composite type marking.
- 5683b34956b4 13.0 cited
-
Propagate sort instrumentation from workers back to leader.
- bf11e7ee2e36 11.0 cited
-
Make new regression test case parallel-safe, and improve its output.
- 1177ab1dabf7 11.0 cited
-
Push limit through subqueries to underlying sort, where possible.
- 1f6d515a67ec 11.0 cited
-
Fix inappropriate printing of never-measured times in EXPLAIN.
- 4b234fd8bf21 9.6.0 cited
-
Fix some infelicities in EXPLAIN output for parallel query plans.
- 8ebb69f85445 9.6.0 cited