On Thu, 2009-05-07 at 12:39 -0500, Kevin Grittner wrote: > Simon Riggs <si...@2ndquadrant.com> wrote: > > > Each user must compare against work performed by all other users. > O(N). > > > > There are N users, so O(N^2). > > Why does that apply here and not in the update conflict detection?
I think the shoe is on the other foot. :-) Explain what you think the algorithmic complexity is, and why, if that's not correct. Can you beat O(N), with Postgres? -- Simon Riggs www.2ndQuadrant.com PostgreSQL Training, Services and Support -- Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-hackers
