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,678 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,421 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,779 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,162 reads

Blogs

5 Starter Projects for Your AI and Data Engineering Portfolio

By

Reading tutorials is fine. Shipping something is better. If you are trying to break...

The Book of Redgate: Taking Breaks

By

We work hard at Redgate, though with a good work-life balance. One interesting observation...

Database AI Agents: The Read-Only Rule

By

Fourth in a series on Ai and databases. What Read-Only Advisory Actually Means A...

Read the latest Blogs

Forums

Liability for AI Errors

By Steve Jones - SSC Editor

Comments posted to this topic are about the item Liability for AI Errors

Running a Parameter-Sensitive Stored Procedure on a Secondary Replica

By abdalah.mehdoini

Hello , I would like to run a stored procedure on a secondary replica...

Pro SQL Server Internals

By Site Owners

Comments posted to this topic are about the item Pro SQL Server Internals

Visit the forum

Question of the Day

Running SQLCMD II

I run this command to start SQLCMD:

sqlcmd -S localhost -E -c "proceed"
At the prompt, I type this (the 1> and 2> are prompts):
1> select @@version
2> go
What happens?

See possible answers