On Sat, Jan 24, 2009 at 3:57 AM, Thomas Finneid <tfinneid(at)fcon(dot)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
> ....
> tablespace dbspace
>
> the data id distribution is hierarchical and even, well fitting to a btree,
> there is about 20000 rows per insert (actually a jdbc COPY)
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?