Pinal dave, Which index have you created, is it clustered or non-clustered index? Requesting to clarify on it. Got it is the nonclustered index created on a heap as per the execution plan.
@@PinalDaveSQLAuthority Wouldn't that be terrible for execution performance? This plan seems to get 40% of the total execution cos versus the previous, seemingly equal, 20%.
@@goodjuanma no. In the second execution plan, using the index would have resulted in hundreds of thousands of key lookups, essentially a table scan in a loop. Scanning the table is far, far more efficient in this case.
“If you like what you see here…” - Always love to see such informative and creative content here. Congratulations on your 200th video gem 🎉
Thank you so so much. You always motivate me. I found myself because of your mentorship.
i have done probably 3 of your course in pluralsight.very good tutorial.helped me learn a lot
Thanks
Welcome back! Tell the artist I said hi. 😆
Thank you so much. I am very much motivated. The artist is also very happy to hear from you too - super happy!
Great to see you back Pinal.
Thank you
Nice to see you after a long time
Thanks!
Van Gogh. Good video - thank-you, Pinal!
Not the legend Van, but mere mortal my daughter.
a really good feature. but guessing it will take a while before SQL Server 2022 gets adopted in a few of our systems :)
That is correct
Pinal dave, Which index have you created, is it clustered or non-clustered index? Requesting to clarify on it. Got it is the nonclustered index created on a heap as per the execution plan.
Great
Ty Dave Sir.
I want to learn sql server from you.
Do you provide any courses?
All my learnings are available for free online.
@@PinalDaveSQLAuthority
Ty sir.
Any plan on Synapse SQL?
Not yet.
Table Scan in the second query execution plan?
Yeah
@@PinalDaveSQLAuthority Wouldn't that be terrible for execution performance? This plan seems to get 40% of the total execution cos versus the previous, seemingly equal, 20%.
@@goodjuanma no.
In the second execution plan, using the index would have resulted in hundreds of thousands of key lookups, essentially a table scan in a loop. Scanning the table is far, far more efficient in this case.