Heikki Linnakangas <heikki.linnakangas@enterprisedb.com> writes:
> Changing the KnownAssignedXids data structure from
> hash table into something that's quicker to scan. Preferably something
> with O(N), where N is the number of entries in the data structure, not
> the maximum number of entries it can hold as it is with the hash table
> currently.
So that's pretty good news RedBlack Trees made it in 9.0, isn't it? :)
> A quick fix would be to check if there's any entries in the hash table
> before scanning it. That would eliminate the overhead when there's no
> in-progress transactions in the master. But as soon as there's even one,
> the overhead comes back.
Does not sound like typical, does it?
--
dim