From: Sim Zacks <sim@compulab.co.il>
To: pgsql-sql@postgresql.org
Subject: Re: join on a like
Date: Tue, 02 May 2006 10:41:17 +0200
Message-ID: <e372iq$2ri2$1@news.hub.org> (raw)
In-Reply-To: <1146483911.614478.77500@u72g2000cwu.googlegroups.com>
References: <e34jl7$2c09$1@news.hub.org>
<1146483911.614478.77500@u72g2000cwu.googlegroups.com>
I guess the real question is:
what is more efficient - a join on a LIKE or a PLPGSQL function that
has 2 loops, 1 for each bottom level child and one that takes the
substring of that child one character at a time to get each parent?
It sounds like you are saying that the join will actaully use the index
and therefore it is optimal, not just possible.
mlartz@gmail.com wrote:
> If you use a btree index on the column, you should be able to use it in
> the like:
> http://www.postgresql.org/docs/8.1/interactive/indexes-types.html.
>
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 using the --to and --cc options:
reply via email
To: pgsql-sql@postgresql.org
Cc: sim@compulab.co.il
Subject: Re: join on a like
In-Reply-To: <e372iq$2ri2$1@news.hub.org>
* 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