Re: [HACKERS] Binary search in fmgr_isbuiltin() is a bottleneck.
От | Robert Haas |
---|---|
Тема | Re: [HACKERS] Binary search in fmgr_isbuiltin() is a bottleneck. |
Дата | |
Msg-id | CA+TgmoY8JUaX18wNzRng5yt_xthQMESTm8YysaMAEUaAzrLrNg@mail.gmail.com обсуждение исходный текст |
Ответ на | Re: [HACKERS] Binary search in fmgr_isbuiltin() is a bottleneck. (Robert Haas <robertmhaas@gmail.com>) |
Ответы |
Re: [HACKERS] Binary search in fmgr_isbuiltin() is a bottleneck.
|
Список | pgsql-hackers |
On Wed, Sep 27, 2017 at 11:18 AM, Robert Haas <robertmhaas@gmail.com> wrote: > No, I think what Andres is saying is that we ought to build the hash > table before we ever reach this function, so that we don't have to > have a branch here to check whether it's been done. I don't see why > that's particularly hard -- it can be jammed into the startup sequence > someplace early, I assume. In EXEC_BACKEND builds it will have to be > redone in each child, but that's just a matter of sticking a call into > SubPostmasterMain() as well as PostMasterMain(). I suppose an even better approach would be to build a perfect hash table at compile time so that nothing needs to be built at run-time at all, but I'm not sure it's worth the trouble. -- Robert Haas EnterpriseDB: http://www.enterprisedb.com The Enterprise PostgreSQL Company -- Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-hackers
В списке pgsql-hackers по дате отправления: