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,316 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,399 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,681 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

8,001 reads

Blogs

Azure Networking: Designing for Change

By

Failing to plan is planning to fail. When organizations first begin implementing Azure networking,...

Using Customer Docker Compose File Names

By

As I use containers more and more to run various things, I decided I...

SQL Server Failover Cluster Instances

By

Old Reliable Still Matters If you’ve been around SQL Server for a while, you’ve...

Read the latest Blogs

Forums

SQL Server authentication vs. Trusted connection

By Rod at work

I maintain an application written years ago, where the database is on a Windows...

Handling Engagement Rings & Wedding Band

By iBling Jewels

I’m working on a jewelry e-commerce project and need advice on designing an efficient...

The Duplicate Cursor

By Steve Jones - SSC Editor

Comments posted to this topic are about the item The Duplicate Cursor

Visit the forum

Question of the Day

The Duplicate Cursor

Can I run this code:

DECLARE ANewTable CURSOR FOR 
SELECT * FROM ANewTable

See possible answers