Re: Q on "Re: select is fast, update based on same where clause is slow "

From: "Josh Berkus" <josh(at)agliodbs(dot)com>
To: Kovacs Baldvin <kb136(at)hszk(dot)bme(dot)hu>
Cc: pgsql-sql(at)postgresql(dot)org
Subject: Re: Q on "Re: select is fast, update based on same where clause is slow "
Date: 2001-09-21 23:53:11
Message-ID: web-123693@davinci.ethosmedia.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-sql

Bladvin,

> I understand why did Jeff's original solution not work. I understand
> why yours do.
>
> But could you please explain me how the 74000^2 can be calculated
> for this original query?:

Sure. In Jeff's original query, the updated instance of the table
(sessions2) and the referenced instance (s) are seperate, without any
JOIN or WHERE conditions to link them. Under these conditions, SQL
engines do a CROSS JOIN, where every single one of the rows in the first
table is matched against every single one of the rows in the second
table. This gives you a result set of the number of rows in sessions2 *
the number of rows in s. 74,000^2 Get it?

Example:

TableA:
1 A
2 B

Table B
7 H
8 G

SELECT * FROM TableA, TableB
1 A 7 H
1 A 8 G
2 B 7 H
2 B 8 G

-Josh

-Josh

______AGLIO DATABASE SOLUTIONS___________________________
Josh Berkus
Complete information technology josh(at)agliodbs(dot)com
and data management solutions (415) 565-7293
for law firms, small businesses fax 621-2533
and non-profit organizations. San Francisco

Browse pgsql-sql by date

  From Date Subject
Next Message postgresql 2001-09-22 12:11:03 more information on JOINs
Previous Message Thurstan R. McDougle 2001-09-21 16:31:15 Re: Selecting latest value II