R Glen Cooper

Glen Cooper (r.glen.cooper@gmail.com) is a SQL Server programmer. His current interest involves graph-theoretical solutions to optimization problems. Glen holds a PhD in Mathematics specializing in model theory and symbolic logic.
  • Interests: SQL Server, .NET, Mathematics

SQLServerCentral Article

Dijkstra's Algorithm

Introduction This article celebrates a classic algorithm [1] of Dijkstra (1930 – 2002) which finds a path of minimal cost between any pair of nodes in an undirected graph. His procedure is widely recognized as a fundamental tool for examining communication and transportation networks (eg. Google Maps) and is surprisingly simple. By his own admission, […]

(5)

You rated this post out of 5. Change rating

2024-01-05

8,633 reads

SQLServerCentral Article

Horizontal Trees

Introduction The sp_HorizontalTree procedure introduced here may be used to audit tables with dependent columns. A column is dependent on another if the meaning of the first column depends on the meaning of the second. For example, in a table containing accounting information, the meaning of a Fiscal Quarter column depends on the Fiscal Year to […]

You rated this post out of 5. Change rating

2023-06-16

2,420 reads

SQLServerCentral Article

How To Avoid MERGE in SQL Server

Introduction This article shows how to script a basic merge between two tables, without using MERGE. This can be handy when you're merging a pair of tables with hundreds of columns, since the script doesn't know anything about them. This technique introduces and populates some auditing columns (IS_DELETED, IS_INSERTED, IS_UPDATED, TRANSACTION_DATE) for each record, and runs fast. […]

(6)

You rated this post out of 5. Change rating

2023-02-20 (first published: )

18,773 reads

SQLServerCentral Article

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 […]

(5)

You rated this post out of 5. Change rating

2021-04-19

8,146 reads

Blogs

ISACA AI Material/Exam Prep Discount (May 18 – June 30, 2026)

By

If you are considering any of the ISACA AI certs like the Advanced Artificial...

A Fabric solution can be very cost effective

By

Are you currently using Microsoft Fabric or considering migrating to it? If so, there...

Track SQL Server Configuration Changes Using the Error Log

By

Track SQL Server Configuration Changes Using the Error Log If you...

Read the latest Blogs

Forums

We Are Eating Our Own Seed Corn

By dbakevlar

Comments posted to this topic are about the item We Are Eating Our Own...

Before Using AI with Business Data, Read This

By rom_c99

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

By SQL Expert

Comments posted to this topic are about the item Designing SQL Server ETL Pipelines...

Visit the forum

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