The hit with a join on indexed columns is negligible. Relational
databases live for joins - they eat them for breakfast! Seriously, as
long as it's indexed in both tables, it'll be super-speedy.
Dan
On 9/22/06, Christopher Brooks <[EMAIL PROTECTED]> wrote:
Hi, thanks for the comments,
> If I
Hi, thanks for the comments,
> If I'm understanding right - the view contains an additional
> column that is an MD5 hash of some or all of the data in the
> base table, right?
Close. It's got all of the data in the base table except for the colum
that's being hashed - we show the hashed versio
If I'm understanding right - the view contains an additional column
that is an MD5 hash of some or all of the data in the base table,
right?
Yes, I would expect that to be very very slow. When selecting, your
database engine has tro calculate 700K MD5 hashes. Slow. When
selecting a subset it h
Hi,
I've got a view of a base table that is 100% identical to that base table
except for one column, which is a projection of the base table after its MD5
hashed. The table is largish (~700,000 rows) and is growing quickly.
Queries on the base table are nice and fast, but on the hashed view are
p
