On 2005-07-25 at 14:51:13 [+0200], David Fowler <[EMAIL PROTECTED]> 
wrote:
> Well the query isn't that strange, I have 3 values that need matching
> per-record returned, all in different tables (takes care of 3 tables) the
> actual data I want is stored in another related table, and 2 of the values
> that need to match are not related directly, so a 5th table is required for
> that relationship.
> Anyway, my original query does infact work, however it takes 10 minutes to
> run. I'm guessing this is because it generates 1,530,200,100 rows of data to
> do the WHERE clause on (just did a count(*) on it in mySQL) . Why MySQL can
> do this so much faster, 1/10th of a second I dont know (though I am using
> InnoDB not the default MyISAM engine. I image the BDB engine would be even
> faster).
> Just MySQL is to heavy to install with my application. Anyway, back to the
> drawing board for an efficient way to get my data. Thanks again.

I think if you try this with MySQL MyISAM you will have the same result and I 
think this is to do with the SELECT *

I remember I used to have something similar back in the days when I tried 
MySQL.

Charlie

Reply via email to