Experiments / Project 702

Comparing CLR, UDF and Set-Based Approaches

This is real brief:

99 seconds

43 seconds

Set-Based WBGT:
21 seconds
Looked at query plans, and put indexes on as suggested, but the index update was too expensive (running time ~ 1 minute). so faster without indexes

Set-Based is the clear winner. CLR is interesting, as this was the optimised algorithm, and it didn’t come close to the un-optimised UDF.

Conclusion: it is faster to keep it in SQL


One thought on “Comparing CLR, UDF and Set-Based Approaches

  1. Pingback: Comparison of Computational speed in SQL Server – limitations of a set-based approach | :: NickBurns

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s