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,729 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,435 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,813 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,188 reads

Blogs

Monday Monitor Tips: Configuring Access to the MCP Server

By

I have been experimenting with MCP servers in a few ways, including the Redgate...

The GO Barrier: Why SSMS Multi-Server Query Waits for the Slowest Connection

By

I deployed a schema change to 30 servers using multi-server query and deploy-at-low-priority. Small...

10 Things I Hate About Fabric Deployment Pipelines— And Some Alternatives

By

Fabric deployment pipelines look like they solve CI/CD for Fabric content, especially for people...

Read the latest Blogs

Forums

A Challenge of Our Knowledge

By Steve Jones - SSC Editor

Comments posted to this topic are about the item A Challenge of Our Knowledge

The memory toll of VARCHAR(MAX) in SQL Server

By sabyda

Comments posted to this topic are about the item The memory toll of VARCHAR(MAX)...

Transaction Log Truncation

By Steve Jones - SSC Editor

Comments posted to this topic are about the item Transaction Log Truncation

Visit the forum

Question of the Day

Transaction Log Truncation

In SQL Server 2025, where can I find information about items that prevent or delay the transaction log truncation?

See possible answers