An implementation of clustering without locking would start by comparing the
index to the table from the beginning to find the first mismatch. Rows
before the mismatch are fine, and can be left alone. From here on, go
through the index and rewrite each row in order. This will put the rows at
the end of the table in cluster order. When done, vacuum the table. This
will result in a clustered table without any locking needed. Those few
records that were updated while clustering was happening will be out of
order, but that should only be a few.
So, could this work? I could really use clustering without locking.
--
View this message in context: http://www.nabble.com/clustering-without-locking-tp16996348p16996348.html
Sent from the PostgreSQL - general mailing list archive at Nabble.com.