From: | "ON(dot)KG" <skyer(at)on(dot)kg> |
---|---|
To: | Richard Huxton <dev(at)archonet(dot)com> |
Cc: | pgsql-sql <pgsql-sql(at)postgresql(dot)org> |
Subject: | Re: What is faster? |
Date: | 2005-06-06 17:02:13 |
Message-ID: | 15836788703.20050606210213@on.kg |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-sql |
Hi All!
>> What is faster - SLECTion data from one large table (200 000 - 300 000
>> records), or SELECTion from a few small tables (example, 2 tables 150
>> 000 records each)?
RH> It depends. Are you selecting all records? One record? A few records? If
RH> one or a few, do you have a suitable index on the table(s)? Is the table
RH> clustered? Expected to be cached in RAM?
RH> Do you have a specific problem, or reason to believe you may encounter one?
It's a real problem
For example i have two large tables
Structure of tables is same - has two fields - id, ip
Now i'm using two selection from each in one transaction
Each of them selects only one record
selection clase like WHERE ip = 'xxx.xxx.xxx.xxx'
so it is searches existance of IP in each table
tables are clustered
about cached in RAM - i'm novice in Postgresql - how does it work?
now i need to make much faster as it is possible
and have an idea just merge two tables in one - will it help me?
Thank You
From | Date | Subject | |
---|---|---|---|
Next Message | KÖPFERL Robert | 2005-06-06 18:08:07 | Re: SQL equivalent to nested loop |
Previous Message | Markus Bertheau ☭ | 2005-06-06 16:52:31 | SQL equivalent to nested loop |