Hi, On 2019/02/18 11:13, Tsunakawa, Takayuki wrote: > From: Andres Freund [mailto:and...@anarazel.de] >> - Speed up planning with partitions >> >> NR: Important feature, but based on a skim of the discussion this >> doesn't seem ready for v12. >> >> Andres: punt to v13 > >> - Speed up transaction completion faster after many relations are >> accessed in a transaction >> >> NR: This has only been submitted 2019-02-12. While not a really >> complicated patch, it's also not trivial. Therefore I'd say this falls >> under our policy of not merging nontrivial patches first submitted to >> the last CF. >> >> Andres: punt to v13 > > I hope these will be continued in PG 12, because these will make PostgreSQL > comparable to a commercial database in OLTP workloads. I'd like to hear from > Amit and David on the feasibility.
As far as the first one is concerned (speed up planning with partitions), although there's no new functionality [1], there is quite a bit of code churn affecting somewhat complex logic of inheritance planning. As I mentioned in the FOSDEM developer meeting's patch triage discussion, there's a chance of moving this forward if Tom has time to look at some portions of these patches. David's and Imai-san's review over the past few months has been very helpful to get the patches to the state they are in now. As for the 2nd one, while I can say it's really helpful for workloads with many partitions, I have to admit I can't give an expert opinion on the code changes. Thank you for working on it. Thanks, Amit [1] it does enable hash partition pruning for update/delete queries though, which is a new feature
