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,700 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,425 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,790 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,166 reads

Blogs

Moving On-Prem PostgreSQL to the Cloud: Picking the Right Path for Big Tables

By

Every PostgreSQL migration eventually hits the same fork in the road. The database is...

A Spread of Vacation

By

I’m off on vacation today. Which is a little weird as I just got...

How AgentDBA Identifies Backup Failures

By

Every DBA has a box like this. Sitting untouched for months. Nobody’s proud of...

Read the latest Blogs

Forums

Have you done a Mid year check in?

By Pat Wright

Comments posted to this topic are about the item Have you done a Mid...

From SQL Server On-Premises to Claude Desktop: How I built a Full MCP Pipeline

By Cláudio Tereso

Comments posted to this topic are about the item From SQL Server On-Premises to...

Independence Day 2026

By Steve Jones - SSC Editor

Comments posted to this topic are about the item Independence Day 2026

Visit the forum

Question of the Day

Independence Day 2026

In the original Independence Day movie (1996), what type of computer did Jeff Goldblum use to connect to the alien mainframe? Take a guess, don't look it up or ask AI.

See possible answers