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,705 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,429 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,793 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,169 reads

Blogs

Think Twice Before Enabling Fabric’s Inbound Network Protection

By

Fabric inbound network protection involves two tenant-level controls: Private Link and Block Public Internet...

Match the Model to the Task, Not the App: An Orchestrator-Worker Pattern in Python

By

Most apps that call an LLM send every request to the same model. That...

Advice I Like: Responsibility

By

“The foundation of maturity: Just because it’s not your fault doesn’t mean it’s not...

Read the latest Blogs

Forums

ALAMAT KANTOR BCA KCP Pondok Gede Telp:083831618008

By Layanan BCA_24jam

WhatsApp:0838-3161-8008 Jl. Raya Pd. Gede No.43, RT.1/RW.7, Lubang Buaya, Kec. Cipayung, Kota Jakarta Timur,...

AI Observability Challenges in FinOps as a DBA

By dbakevlar

Comments posted to this topic are about the item AI Observability Challenges in FinOps...

Migration Challenge: Excessive FULLSCAN Statistics Update Duration Blocking SQL

By abdalah.mehdoini

Hello everyone , I am planning to migrate a database from SQL Server 2014...

Visit the forum

Question of the Day

Finding a Database Master Key

Where do I check for the existence of a Database Master Key (DMK) in SQL Server 2025?

See possible answers