You do it with two separate queries. One to update table "B" and then another to update table "C".

You are thinking procedurally, not set-based, whenever you say...

He's right. The round is redundundant in the second example. 😀

Not too badly, Jason. I'm enjoying every breath I take. I remember that you had moved back to Utah. How are things going...

Hasn't ordering by column number been deprecated?

Has it really been a year? Oh wow....

No guarantees on performance, but here's your overlap logic.

select ap.*,DATEDIFF(minute,start,[end]) as duration,ca.PersonId,ca.AvailFrom,ca.AvailTo,ca.MinutesOverlap

from Appointments ap

cross apply (select *,

DATEDIFF(minute, case when AvailFrom >= ap.Start then AvailFrom else ap.Start end

,case when AvailTo <=...

... and just TRY getting a parachute through security at a U.S. airport.

You can approach this a number of ways. One way is to pass in a table variable containing the years to be selected.

DECLARE @inputYears table (getyear char(4)...

Everything may be RBR, but I always thought the purpose was to keep it from being RBAR, Paul 😉

I agree with Chris.

Because I inadvertantly started (this very entertaining and informative discussion) by making a "suckish" comment, I feel compelled to admit that I have in fact used...

-- if you want to specify that your output is numeric (10,1), you will have to cast or convert the result

declare @int1 int = 4

declare @int2 int = 5

select cast(round(1.0*@int1/@int2,1)...

-- just start out by multiplying by 1.0 then round() the result

declare @int1 int = 4

declare @int2 int = 5

select round(1.0*@int1/@int2,1)

Gail and Lynn, it is also worth noting the the scan is feeding directly into a merge join, so no intermediate sorting or hashing is required for the join. ...

Recursive CTEs can also perform quite suckishly. There is nothing set-based about the recursion.

Question: You say "pass in a definition", but the way I read your post it seems you are wanting to avoid dynamic SQL. If you want...