Re: [HACKERS] Parallel tuplesort (for parallel B-Tree index creation)
Robert Haas <robertmhaas@gmail.com>
On Wed, Jan 17, 2018 at 10:22 PM, Peter Geoghegan <pg@bowt.ie> wrote: > If you think it's worth the cycles, then I have no objection. I will > point out that this means that everything that I say about > ReindexIsProcessingIndex() no longer applies, because the relevant > state will now be propagated. It doesn't need to be mentioned at all, > and I don't even need to forbid builds on catalogs. > > Should I go ahead and restore builds on catalogs, and remove those > comments, on the assumption that your patch will be committed before > mine? Obviously parallel index builds on catalogs don't matter. OTOH, > why not? Perhaps it's like the debate around HOT that took place over > 10 years ago, where Tom insisted that HOT work with catalogs on > general principle. Yes, I think so. If you (or someone else) can review that patch, I'll go ahead and commit it, and then your patch can treat it as a solved problem. I'm not really worried about the cycles; the amount of effort required here is surely very small compared to all of the other things that have to be done when starting a parallel worker. I'm not as dogmatic about the idea that everything must support system catalogs or it's not worth doing as Tom is, but I do think it's better if it can be done that way with reasonable effort. When each new feature comes with a set of unsupported corner cases, it becomes hard for users to understand what will and will not actually work. Now, really big features like parallel query or partitioning or logical replication generally do need to exclude some things in v1 or you can never finish the project, but in this case plugging the gap seems quite feasible. -- Robert Haas EnterpriseDB: http://www.enterprisedb.com The Enterprise PostgreSQL Company
Commits
-
Support parallel btree index builds.
- 9da0cc35284b 11.0 landed
-
Report an ERROR if a parallel worker fails to start properly.
- 2badb5afb89c 11.0 cited
-
Transfer state pertaining to pending REINDEX operations to workers.
- 29d58fd3adae 11.0 landed
-
Add a barrier primitive for synchronizing backends.
- 1145acc70deb 11.0 cited
-
Allow DML commands that create tables to use parallel query.
- e9baa5e9fa14 11.0 cited
-
Refactor GetOldestXmin() to use flags
- af4b1a0869bd 10.0 cited
-
Fix regression in parallel planning against inheritance tables.
- 2609e91fcf9d 10.0 cited
-
Don't create "holes" in BufFiles, in the new logtape code.
- 7ac4a389a7db 10.0 cited
-
Simplify the code for logical tape read buffers.
- b75f467b6eec 10.0 cited
-
Fix excessive memory consumption in the new sort pre-reading code.
- b56fb691b003 10.0 cited
-
Implement binary heap replace-top operation in a smarter way.
- 24598337c8d2 10.0 cited
-
Cosmetic code cleanup in commands/extension.c.
- 25794e841e5b 10.0 cited
-
Speed up planner's scanning for parallel-query hazards.
- da1c91631e35 10.0 cited
-
Read from the same worker repeatedly until it returns no tuple.
- bc7fcab5e36b 9.6.0 cited
-
Improve tuplesort.c to support variable merge order. The original coding
- df700e6b4019 8.2.0 cited