You signed in with another tab or window.Reload to refresh your session.You signed out in another tab or window.Reload to refresh your session.You switched accounts on another tab or window.Reload to refresh your session.Dismiss alert
To make this work, tuplesort.c and logtape.c must also supportparallelism, so this patch adds that infrastructure and then appliesit to the particular case of parallel btree index builds. Testingto date shows that this can often be 2-3x faster than a serialindex build.The model for deciding how many workers to use is fairly primitiveat present, but it's better than not having the feature. We canrefine it as we get more experience.Peter Geoghegan with some help from Rushabh Lathia. While HeikkiLinnakangas is not an author of this patch, he wrote other patcheswithout which this feature would not have been possible, andtherefore the release notes should possibly credit him as an authorof this feature. Reviewed by Claudio Freire, Heikki Linnakangas,Thomas Munro, Tels, Amit Kapila, me.Discussion:http://postgr.es/m/CAM3SWZQKM=Pzc=CAHzRixKjp2eO5Q0Jg1SoFQqeXFQ647JiwqQ@mail.gmail.comDiscussion:http://postgr.es/m/CAH2-Wz=AxWqDoVvGU7dq856S4r6sJAj6DBn7VMtigkB33N5eyg@mail.gmail.com