|
Comments
|
|
great vid, always good to see how other people try to imoprove performance
|
|
|
Excellent presentation - good job!
|
|
|
Great ideas!
|
|
|
Its cool to know about query hints.
|
|
|
I never take the time to put in comments - but here I have to. Each part in this series is great. You can be the best OO developer in the world but if you don't know how to fine tune SQL you can be reduced to useless. I hope to see a part 5.
|
|
|
dose with (nolock) improve performance any?
|
|
|
does with (nolock) improve it more?
|
|
|
Thanks, Andy! That was a great series of videos on performance tuning.
|
|
|
Nice video.
|
|
|
Very good, didn't know aobut INNER LOOP and INNER MERGE, this quick takes un to next expertise level
|
|
|
Very good article ... simple and clean example demostarte the difference.
|
|
|
Good video!! Worth the watch
|
|
|
Andy, this is a great video. thank you so much for sharing.
|
|
|
Thanks for the follow-up video. And I thought the next step after the Merge Join was to index the tables to prevent the extra sort operation?
|
|
|
The MERGE and LOOP join methods are interesting, I will hve to look into those a bit more. Thanks for the tip!
|
|
|
Very nice, though I would have liked to see why the Loop hint caused more reads.
I guess I'll have to check on my own :)
|
|
|
Great series, one suggestion, try using a CTE instead of a sub query if you're not able to change database structure for any reason. Dropped the number of reads from around 447 to 39 on average.
|
|
|
This very good
|
|
Peter Kennedy on
5/10/2010
One result that was not highlighted with the INNER MERGE JOIN example was the impact on CPU & Duration - whilst reads were reduced with a merge join, there was an associated CPU / Duration cost imposed, so depending on what the ultimate goal is...
It would also be worth noting the flexibility (or not) of the code with join hints in leveraging changes to undeerlying indexes...
|
|
|
Good Vid
|
|
|
There is a high price for using index hints. Nice to know they are there and how to use them. But only in NOTHING else worked.
|
|
|
got it down to 5 reads.
Create an index on Registration on EventId and only include the column RegistrationStatus. This will cause the optimizer to use a hash match. But there is a CPU price for it. So I would go for the a normal covering index on registration with colummns (EventId, RegistrationStatus). This runs with 7 reads and 0 CPU cost.
|
|
|
Excellent
|
|
Mark Holahan on
5/27/2010
Excellent tutorial.
|
|
|
Merge and Loop join are new to me!
|
|
|
Another great presentaion on Performance Tunning!
|
|
|
Although inner loop joins and inner merge joins were described, they weren't defined to understand why they improve performance.
|
|
|
Hey ... I did not anything about LOOP and MERGE keywords for the INNER JOIN. So thanks for the video.
|