From: Tomasz Myrta <jasiek@klaster.net>
To: pgsql-performance@postgresql.org
Subject: sequential scans on few columns tables
Date: Mon, 16 Jun 2003 21:49:40 +0200
Message-ID: <3EEE1F54.3030507@klaster.net> (raw)
Hi
Recently I was wondering about tables difficult to index. Example -
queries with "ilike" where clauses. Without additional contrib modules
the only way to search such tables is sequential scan (am I right?)
The point is too keep these tables as small as possible. We can do this
by denormalizing tables. Let's say we have table "users" which we split
into 1:1 relation "users_header" and "users_data". We put searchable
columns into users_header and rest of them into users_data. users_data
have some integer foreign key referencing to users_header.
What do you think about it? Does the Postgres use advantages of small
table users_header? Sequential scan on memory cached table should speed
up queries, the rest columns are in integer-indexed table which
shouldn't slow it down.
These example above is ony an idea, I don't have currently any example
for it.
Regards,
Tomasz Myrta
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Reply to all the recipients from your mail client; the link fills in
the headers below: reply via email
Some clients, webmail especially, drop In-Reply-To and References from
a link, and the reply then starts a new thread: use the mbox below.
To: pgsql-performance@postgresql.org
Cc: jasiek@klaster.net
Subject: Re: sequential scans on few columns tables
In-Reply-To: <3EEE1F54.3030507@klaster.net>
References: <3EEE1F54.3030507@klaster.net>
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
This inbox is served by DDX for PostgreSQL; see mirroring instructions
for how to clone and mirror all data and code used for this inbox