optimized code for cartesian product

[Sathya3]

What is better way of doing this which takes less processing time? My actual data is huge and since below code produces cartesian product it is taking very large amount of time for processing.Below is sampel data

data one ;

datalines;

id name $;

100 sam

200 ram

;

run;

data two ;

datalines;

id name $;

100 sam

200 ram

300 paul

;

run;

Proc sql;

create table temp as

select b.id,b.name from 

one a,

two b

where a.id NE b.id;

quit;

[PaigeMiller]

A very recent and long thread on Cartesian joins

https://communities.sas.com/t5/SAS-Programming/NOTE-The-execution-of-this-query-involves-performing-...

Basically, if it has to be a Cartesian join, you can't optimize it and you can't speed it up. So the real question is ... can this be done without a Cartesian join? Please let us know.

[LinusH]

Are both tables huge?

If not, the smaller table may fit into memory and then you could use the hash object in the datastep/proc ds2.

[PGStats]

What operation are you trying to perform (in words).