Hi
I just experienced a performance loss on inserts when redefining my
index on a table.
I have a database with the following table
table:
id1 int
id2 int
id3 int
id4 int
val1 float
tablespace dbspace
the data id distribution is hierarchical and even, well
On Sat, Jan 24, 2009 at 3:57 AM, Thomas Finneid tfinn...@fcon.no wrote:
Hi
I just experienced a performance loss on inserts when redefining my index on
a table.
I have a database with the following table
table:
id1 int
id2 int
id3 int
id4 int
val1 float
Also, what other kind of usage patterns are going on. I wrote a
simple test case for this and on a table with 100,000 entries already
in it, then inserting 10,000 in a transaction and 10,000 outside of a
transaction, I get insert rates of 0.1 ms and 0.5 ms respectively.
With a table with
Thomas Finneid escreveu:
But my question is, since I can do this with tablespace for tables,
indexes and so on, is there any possibilites to do a similar thing for
the transaction log from inside postgres? as in
No. Because transaction log is for the entire cluster and it is too risky to
do
On Fri, 23 Jan 2009, da...@lang.hm wrote:
take a look at this ram based drive, specificly look at the numbers here
http://techreport.com/articles.x/16255/9
they are about as much above the X25-e as the X25-e is above normal drives.
They're so close to having a killer product with that one.
On Sun, 25 Jan 2009, Greg Smith wrote:
On Fri, 23 Jan 2009, da...@lang.hm wrote:
take a look at this ram based drive, specificly look at the numbers here
http://techreport.com/articles.x/16255/9
they are about as much above the X25-e as the X25-e is above normal drives.
They're so close to
Scott Marlowe wrote:
On Sat, Jan 24, 2009 at 3:57 AM, Thomas Finneid tfinn...@fcon.no wrote:
Is this table constantly growing, or is it at a stable plateu? I'd
assume a constantly growing table, or one with bloat problems would
get slower over time. About how many rows does this table have?
