Tema: Re: Reikia pagalbos su SQL
Autorius: slavik&dimon
Data: 2011-05-15 12:27:45
nu tai pats patikrink :) suinstaliuok XE, ta pacia uzklausa ten ir ten 
praleisk ir zinosi :) Cia tuo atveju, jeigu kyla dvejoniu, ar 
neteisingai uzklausa parasei, ar tiesiog jos gal nepalaiko tavo DB :)

On 2011-05-15 11:39:32 +0300, Hyperlink said:

> Gal kas galëtø pasakyti, ar oracle 8.0.5.0.0 versija palaiko toká 
> dalykà kaip dalykà kaip subquery FROM dalyje?
> 
> 
> "2x50"  wrote in message news:iqikim$bm5$1@trimpas.omnitel.net...
> 
>> na kazkokia mistika su ta duombaze
>> 
>> jeigu I selecto from dadedu ta prekiu lentele ir nei vieno lauko is ten 
>> > neselectinu ir neoperuoju su ja where dalyje is karto uzklausos 
>> atlikimo > laikas auga tragiskai
> 
> Siaip smalsu, kas vercia zmones deti lenta i from dali, jei ji neatlieka nei
> duomenu isrinkimo, nei filtravimo fukcijos? Jokios mistikos cia nera, nes
> pridedamas be join'o lenta, gausi ne ka kita kaip
> Cartesian Join
> Every possible combination of the elements of two or more sets. For example,
> a Cartesian join of (A,B) and (1,2,3) is (A,1) (A,2) (A,3) (B,1) (B,2)
> (B,3). Try it with larger set sizes and you will quickly realize why it can
> be very unpleasant. Accidental usage has been known to bring systems to a
> crawl.
> 
> That is not every combination - it's taking exactly one element from each
> set (in every way possible).
> 
>   a.. How about "every combination of pairing".
> 
> SQL example:
> 
>    SELECT a.cust_id, b.product_id, b.product_name
>      FROM order a, product b
> 
> Without a specification of how the join is to be done, the DB will blithely
> return, for every row in order, all of the rows in product. If you have
> 4,000 orders and 200 products you will get back 800,000 rows of nonesense.