Umachandar Jayachandran

Umachandar
Jayachandran

Umachandar Jayachandran works on the SQL Performance Engineering Team at Microsoft. He specializes in online transaction processing and data warehousing, and he is a contributing author of SQL Unleashed, 2nd Edition (SAMS). You can find his contributions at http://blogs.msdn.com/sqltips and http://blogs.msdn.com/sqlperf.

Articles
July Challenge Solution: Localizing Language/Region-Based Customer Settings
Localizing Language/Region-Based Customer Settings
A DBA is designing the product catalog functionality of a Web-based order placement application. Your task is to create an appropriate database object that he can use on the client or server and that
Optimizing Queries for Fact Tables
Help a DBA devise a scheme that lets him easily optimize two queries. The indexing scheme or optimization technique that you come up with should be flexible enough to help with the queries use a table.
Check for Objects Created Without SET Options Enabled
Test your SQL Server savvy in this month's Reader Challenge. Submit your solution in an email message to challenge@sqlmag.com by May 10.
Change the Status of Table Items
Solution to February Reader Challenge: Check for an Empty Table 2

There were no winners for the February Reader Challenge, "Check for an Empty Table." Here's a recap of the problem and the solution to the February Reader Challenge.

Check for an Empty Table

The winners for the January Reader Challenge, "Converting a Hexadecimal String to a Varbinary Value" will be announced at a later date. Please watch this article page for updates. Here's a recap of the problem and the solution to the January Reader Challenge.

Converting a Hexadecimal String to a Varbinary Value

Congratulations to John T. Keller, who won first prize of $100 for the best solution to the December Reader Challenge, "Improve T-SQL to Prevent Deadlocks" and to Bill Twomey who won second prize of $50. John is a database developer for Softek Solutions, and Bill is a Microsoft SQL Server DBA for Database Solutions. Here's a recap of the problem and the solution to the December Reader Challenge.

Improve T-SQL to Prevent Deadlocks

There were no winners for the November Reader Challenge, "Parse and Insert Data from Uploaded Image Files." Here’s a recap of the problem and the solution to the November Reader Challenge.

November Reader Challenge: Parse and Insert Data from Uploaded Image Files

Congratulations to Chad Boyd, who won first prize of $100 for the best solution to the October Reader Challenge, "Enforcing Uniqueness Without the Unique Constraint." Chad graciously donated his prize to the Make-a-Wish Foundation (http://www.wish.org). Here’s a recap of the problem and the solution to the October Reader Challenge.

Enforcing Uniqueness Without the Unique Constraint 2

Congratulations to Steve Kass and Lay Chew. Steve won first prize of $100 for the best solution to the September Reader Challenge, "Fixing a Faulty Lookup Query." Lay won second prize of $50. Here’s a recap of the problem and the solution to the September Reader Challenge.

Generating 6-Digit All-Numeric File Numbers for Search - 13 Jul 2006
The July Reader Challenge, "Creating an Easy Query Mechanism for Gathering Customer Data," had no winners. Here’s a recap of the problem and the solution to the July Reader Challenge.
Creating an Easy Query Mechanism for Gathering Customer Data

Congratulations to Ahmad Bahr Mohamed, who recently won the May Reader Challenge. Ahmad Bahr Mohamed, a DBA/Database developer at Applied Industrial Technology (AIT) in Cleveland, Ohio, won an honorable mention for the best solution to the June Reader Challenge, "Writing Efficient Queries to Return Inventory Items." Here’s a recap of the problem and the solution to the June Reader Challenge.

Writing Efficient Queries to Return Inventory Items

Congratulations to Ahmad Bahr Mohamed and Len Binns. Ahmad Bahr Mohamed, a DBA/Database developer at Applied Industrial Technology (AIT) in Cleveland, Ohio, won first prize of $100 for the best solution to the May Reader Challenge, "Running SQL Server 2000 Queries in SQL Server 2005." Len Binns, a Senior Programmer/Analyst at the University at Buffalo's School of Dental Medicine, won second prize of $50. Here’s a recap of the problem and the solution to the May Reader Challenge.

Digital Magazine Archives

Browse back issues of SQL Server Pro, from January 2007 through the last issue published in April 2014. Find the back issues here.

 

From the Blogs
business people around a table and laptop
Oct 9, 2014
blog

AlwaysOn Availability Groups and SQL Server Jobs, Part 10: Dynamic Detection Gotcha #3

You can interject a SQL Server Job Step into your Jobs and have this new/injected Job Step do some checking for you. Here's a look at everything that’s involved in such an approach....More
Man holding a piece of paper with the word GOTCHA
Oct 7, 2014
blog

AlwaysOn Availability Groups and SQL Server Jobs, Part 9: Dynamic Detection Gotcha #2 3

Given that a USE statement is parsed before code is actually run, there are a few options that could be used as a around when it comes to detecting whether or not code should be run....More
iceberg
Oct 2, 2014
blog

AlwaysOn Availability Groups and SQL Server Jobs, Part 8: Dynamic Detection Gotcha #1 1

Learn about why the option of dynamically detecting whether or not to run a SQL Server Job at execution time is quite a bit more problematic than you might think....More
SQL Server Pro Forums

Get answers to questions, share tips, and engage with the SQL Server community in our Forums.

Sponsored Introduction Continue on to (or wait seconds) ×