How To Find A Perfect Match
This article presents a way that finds a perfect match in any bipartite graph or shows why one cannot exist.
2021-09-06
2,947 reads
Mathematics
Navigating Trees With CTE
Introduction This article shows how common table expressions (CTE) in SQL Server are naturally suited for navigating trees, such as finding its longest path, or diameter. Recall that a tree is an undirected graph where unique paths exist between any two nodes (i.e. vertices). Any node may be selected as its top node, with its […]
2021-04-19
8,146 reads
Blogs
ISACA AI Material/Exam Prep Discount (May 18 – June 30, 2026)
By Brian Kelley
If you are considering any of the ISACA AI certs like the Advanced Artificial...
A Fabric solution can be very cost effective
By ChrisJenkins
Are you currently using Microsoft Fabric or considering migrating to it? If so, there...
Track SQL Server Configuration Changes Using the Error Log
By SQLPals
Track SQL Server Configuration Changes Using the Error Log If you...
Forums
Before Using AI with Business Data, Read This
Artificial intelligence tools are quickly becoming part of daily business operations, from document analysis...
Designing SQL Server ETL Pipelines That Don't Break at Scale
Comments posted to this topic are about the item Designing SQL Server ETL Pipelines...
Detecting Deadlocks Quickly
Comments posted to this topic are about the item Detecting Deadlocks Quickly
Question of the Day
Detecting Deadlocks Quickly
In the Database Engine, when a deadlock is detected, what does the detection interval shrink to (in time)?
See possible answers