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 (5)

You rated this post out of 5. Change rating

2024-01-05

8,124 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,388 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. […]

4.5 (6)

You rated this post out of 5. Change rating

2023-02-20 (first published: )

18,600 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 […]

4.8 (5)

You rated this post out of 5. Change rating

2021-04-19

7,877 reads

Blogs

A New Word: Immerensis

By

immerensis – n.  the maddening inability to understand the reasons why someone loves you...

Deploy a Dockerized Python TODO App to Azure Container Apps Using Pulumi and Azure Key Vault

By

In this post, I will guide you on how to deploy a dockerized simple...

SQL Server Wait Stats

By

Everything in SQL Server is waiting for something…this is by design. And most people...

Read the latest Blogs

Forums

mysql query timeout upped but job still fails about same number of minutes in

By stan

hi, i changed my mysql based linked server's timeout to N'600' instead of N'0'...

Somebody realized to configure Cluster-Aware updating on VMWare nodes

By boskabouter 007

Creating an Windows Server Fail-over Clusters with two SQL server 2022 and a File...

is it cache or something else

By stan

hi a few days ago i narrowed down the cause of a new problem...

Visit the forum

Question of the Day

SQL Server Collations

At what levels can we set the collation in SQL Server 2022?

See possible answers