This is a classic problem known as LIS (longest increasing sequence) that was discussed in CACM decades ago. You can find it in HOW TO SOLVE IT BY COMPUTER by R.G. Dromey (1981) ISBN: 0-13-188862-...
T-SQL PuzzleCommented on: 2 years ago
(November 20, 2012)
The reason for the Hexagons in the original game grid is that this was based on the game Hex, (http://en.wikipedia.org/wiki/Hex_game). It was invented independently by John Nash and Piet Hein. It had...
Solutions to TSQL Challenge – Reoccurring VisitsCommented on: 3 years ago
(July 14, 2011)
I am late to the party, but here goes.
Let's assume we have a the usual Calendar table. Use it to build a table of date pairs. Use the date pairs flag each visitor as a today and/or yesterday...
Logic Puzzle – Dice SubstituteCommented on: 5 years ago
(July 2, 2009)
You are in a British pub, so they will have a set of 6-6 dominoes behind the bar. Pull out the blanks, discard the double. Throw the titles in a hat and draw with replacement to simulate dice....
The quest for the Golden Record to achieve a single, accurate and complete version of a customer record is worth the pursuit to attain survivorship. Record matching and consolidation are only the beginning. Melissa Data takes a new approach. Learn how to apply intelligent rules based on reference data to make smarter and better decisions for data cleansing....More
On SQL Servers where Availability Groups (or Mirroring) isn’t in play, I typically recommend keeping a combination of on-box backups along with copying said backups off-box as well. Obviously, keeping databases AND backups on the SAME server is the metaphorical equivalent of putting all of your eggs in one basket – and therefore something you should avoid like the plague....More
One of the biggest strengths of AlwaysOn Availability Groups is that they allow DBAs to address both high availability and disaster recovery concerns from a single set of tooling or interfaces. But, this doesn’t mean that you won’t still need backups....More