> A particular point worth making is that in the common case where you've
> updated the same row N times (without changing its index key), the above
> approach has O(N^2) runtime. The indexscan will find all N index tuples
> matching the key ... only one of which is the one you are looking for on
> this iteration of the outer loop.
It was my understanding, that the heap xtid is part of the key now, and thus
with a somewhat modified access, it would find the one exact row directly.
And in above case, the keys (since identical except xtid) will stick close
together, thus caching will be good.
Andreas
