Richard Huxton wrote:
Sezai YILMAZ wrote:
Hello!
I have a table eith name person as described below. It has an unique
index for id column (it is also primary key) and has an index for
parent column.
If I run a query with where clause on id column it uses the index
(look at the first
Hello!
I have a table eith name person as described below. It has an unique
index for id column (it is also primary key) and has an index for parent
column.
If I run a query with where clause on id column it uses the index (look
at the first explain analyze result; it says "Index Scan using.
Hello
I need high throughput while inserting into PostgreSQL. Because of that I
did some PostgreSQL insert performance tests.
-- Test schema
create table logs (
logid serial primary key,
ctime integer not null,
stime int
Sezai YILMAZ wrote:
create index agentid_ndx on logs using hash (agentid);
create index ownerid_ndx on logs using hash (ownerid);
create index hostid_ndx on logs using hash (hostid);
speed for speed for
Richard Huxton wrote:
PG uses MVCC to manage concurrency. A downside of this is that to verify the
exact number of rows in a table you have to visit them all.
There's plenty on this in the archives, and probably the FAQ too.
What are you using the count() for?
select logid, agentid, logbody
Richard Huxton wrote:
On Wednesday 14 January 2004 11:11, Sezai YILMAZ wrote:
Hi,
I use PostgreSQL 7.4 for storing huge amount of data. For example 7
million rows. But when I run the query "select count(*) from table;", it
results after about 120 seconds. Is this result normal for s
Hi,
I use PostgreSQL 7.4 for storing huge amount of data. For example 7
million rows. But when I run the query "select count(*) from table;", it
results after about 120 seconds. Is this result normal for such a huge
table? Is there any methods for speed up the querying time? The huge
table has
