Comments on: SQL SERVER – Solution to Puzzle – Shortest Code to Perform SSN Validation http://blog.sqlauthority.com/2009/04/29/sql-server-solution-to-puzzle-shortest-code-to-perform-ssn-validation/ Personal Notes of Pinal Dave Fri, 10 Feb 2012 04:35:14 +0000 hourly 1 http://wordpress.com/ By: Tore Bostrup http://blog.sqlauthority.com/2009/04/29/sql-server-solution-to-puzzle-shortest-code-to-perform-ssn-validation/#comment-130032 Tue, 19 Apr 2011 20:01:14 +0000 http://blog.sqlauthority.com/?p=4647#comment-130032 For those who plan to use this in an actual system, it is important to research the issue in more depth. Specifically know that:
1: The “Area Number” list is only one part of the validation, the two digit Group Number is also assigned in a particular order (using a peculiar odd/even group number assignment sequence, see http://www.socialsecurity.gov/history/ssn/geocard.html). The last group number in use is published monthly (http://www.socialsecurity.gov/employer/ssnvhighgroup.htm).
2: On June 25, 2011, all this will change as SSN randomization will be introduced (or at least that is the plan at this time – http://www.socialsecurity.gov/employer/randomizationfaqs.html). The Area Number/Group Number still applies to SSNs issued prior to that time, but new SSNs will not follow that pattern.
3: For serious SSN verification, one should also consider the Social Security Administration’s Death Master File, containing over 65 million thus “expired” SSNs.

]]> By: pinaldave http://blog.sqlauthority.com/2009/04/29/sql-server-solution-to-puzzle-shortest-code-to-perform-ssn-validation/#comment-51395 Wed, 29 Apr 2009 16:21:33 +0000 http://blog.sqlauthority.com/?p=4647#comment-51395 Pacer Dawn
Good observation. I like the way you think.

]]> By: Pacer Dawn http://blog.sqlauthority.com/2009/04/29/sql-server-solution-to-puzzle-shortest-code-to-perform-ssn-validation/#comment-51394 Wed, 29 Apr 2009 15:53:32 +0000 http://blog.sqlauthority.com/?p=4647#comment-51394 AND A ’666′ AND B > ’00′ AND C > ’0000′
AND ssn NOT LIKE ‘%[^0-9-]%’

There is no need for the upper bound check as we have already verified B and C are exactly 2 and 4 digits respectively. We also need to verify there are no non-digits (other than dashes) in there.

Also, is “DISTINCT” necessary? I don’t see anywhere in the rules where it has to be a unique list, and that does add characters to the final SQL.

]]> By: Kurt Koller http://blog.sqlauthority.com/2009/04/29/sql-server-solution-to-puzzle-shortest-code-to-perform-ssn-validation/#comment-51376 Wed, 29 Apr 2009 03:13:39 +0000 http://blog.sqlauthority.com/?p=4647#comment-51376 I’m reading this from my phone but how’s that code work for:

214-2n-9999
21g-55-9999
2g3-44-9999

Etc

]]>