Yes, the optimiser assumes only one row in a table variable.

Always the next version eh? The consumerist dream!

Given our deadline and success of the POC we have decided to push on. Thanks for the input though - it's very useful...

By debug I mean watch the little boxes turn green or red in BIDS 😉

My point is that if execution of a parent package highlights a problem with a child...

Thanks Koen

We've considered that option and it's on the Plan B List.

Principle problems are:

* It is not possible to debug the project as a whole in that configuration.

* Each tier...

Whoops!

SQL Server 2005

BIDS 2005

Plus, inserts in to a heap are not necessarily fastest:

http://support.microsoft.com/kb/297861/en-us

Gail is right - the root and intermediate index levels store only key range boundary values since all they are required for are routing to the relevant next page. There...

Which is interesting...

paul.knibbs (1/7/2011)

I just did that test and I got 2...

When an index scan is done by the query processor, it is always a full read of all of the leaf pages in the index, regardless of whether all of...

This is ok though:

SELECT * FROM T1

OUTER APPLY (SELECT * FROM T2 WHERE T1.SomeVal = T2.SomeVal) a

...

Not in 2005. Since your code is 2008 I assume things changed....

Thanks Grant - that is what I was trying to do. However, AFAIK you cannot use a join hint for an OUTER APPLY and I know you can't use one...

Changing this from an OUTER APPLY to a LEFT OUTER JOIN with ROW_NUMBER curiously made the optimiser use a HASH JOIN for the anti-semi join so the hint is not...

INSERT INTO <table> WITH (TABLOCK)

will minimally log in the same way SELECT .... INTO will by default.