On Sep 9, 2005, at 11:23 PM, Marc G. Fournier wrote:
The case is where I just want to check that a value being inserted
is one of a few possible values, with that list of values rarely
(if ever) changing, so havng a 'flexible list' REFERENCED seems
relatively overkill ...
That's what
On Sep 12, 2005, at 6:02 PM, Brandon Black wrote:- using COPY instead of INSERT ?(should be easy to do from the aggregators)Possibly, although it would kill the current design of returning the database transaction status for a single client packet back to the client on
On Sep 12, 2005, at 6:02 PM, Brandon Black wrote:- splitting the xlog and the data on distinct physical drives or arraysThat would almost definitely help, I haven't tried it yet. Speaking of the xlog, anyone know anything specific about the WAL tuning parameters for heavy concurrent write
I currently have a Postgres 7.3 database running under WIN2K using cygwin
and want to move to Postgres 8.0.3 (native windows version).
I am finding most simple queries are significantly faster on the native
windows version compared to 7.3 (under cygwin).
However, for a complex query, that involve
I have started to break my query down and analyze each piece.
What I have discovered is very interesting.
First here is a small piece of my query.
EXPLAIN ANALYZE SELECT doc.doc_documentid FROM document AS doc
LEFT JOIN document as root ON doc.doc_internalRootXref =
root.doc_documentId
Gurpreet Aulakh [EMAIL PROTECTED] writes:
What is really interesting is the time it takes for the Hash to occur. For
the first hash, on the 7.3 it takes only 12ms while on the 8.0 it takes
47ms.
You haven't told us a thing about the column datatypes involved (much
less what the query actually
Hi All,
Investigating further on this problem I brought up in June, the following
query with pg 8.0.3 on Windows scans all 1743 data records for a player:
esdt= explain analyze select PlayerID,AtDate from Player a
where PlayerID='0' and AtDate = (select b.AtDate from Player b
where
