To do a test, I run the following:

declare @appid int

set @appid = 442

declare @l1 int

declare @l2 int

declare @l3 int

declare @l4 int

declare @ret int

select @l1 = l1, @l2 = l2, @l3...

This is my code to create the function:

Some friends suggest me replacing the <> null to is not null, I did it and it's no use.

CREATE FUNCTION fnGetNewOrgID (@AppID int)...

That's not the problem, because like I said in my post, I copied all the code from function and run it directly from QA, there is no any problem and...

Hi Steve,

Did you see that what I just posted is the execution plan's running result, I just manually typed it in here.

That is interesting. I thought SQL...

the sub query's execution plan is as following:(takes 4 minutes to run the query)

Physical operation: Clustered Index Seek

Logical operation: Clustered Index Seek

Estimated row count: 90,670,440

Estimated row size: 66

Estimated I/O...

Thanks for all of you guys' reply.

I am just interested in why a query like

select * from asdf where id in (select id from fasd)

shouldn't the total running time...

Thanks for your reply.

The two tables I used in my query(no, actually it was written by others, I am just doing the cleanup :crazy:) have the following number of records:

3891154

88616040

The...

I already got it:

select convert(varchar(13),auditdate,120)+':00',

count(1) from dailyscore

group by convert(varchar(13),auditdate,120)

order by convert(varchar(13),auditdate,120)

up........

Up ...

Hello,

Thanks for your reply, but I spent some time on this and I found it is not difficult or complex at all, just use some simple recursive algorithm and temp...

Thank you Jeff.

The question is the result might contain more than 2 records for the same timestamp, using top is probably not right.

Thanks.

I know using QA talking to 2k5 is possible, but I doubt if EM can talk to 2k5.