[GENERAL] clustering without locking

[fschmidt]

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.


-- 
Sent via pgsql-general mailing list (pgsql-general@postgresql.org)
To make changes to your subscription:
http://www.postgresql.org/mailpref/pgsql-general

[GENERAL] PL/Tcl implementation

[fschmidt]

Why doesn't the PL/Tcl (and PL/Python) implementation use the SPI functions? 
For example pltcl_set_tuple_values() calls NameStr() instead of SPI_fname()
and heap_getattr() instead of SPI_getbinval().  Why?  This makes the code
impossible to follow for someone who is not familiar with the postgres
source and has only read the online documentation.

-- 
View this message in context: 
http://www.nabble.com/PL-Tcl-implementation-tp15215251p15215251.html
Sent from the PostgreSQL - general mailing list archive at Nabble.com.


---(end of broadcast)---
TIP 6: explain analyze is your friend