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,618 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,420 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,770 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,142 reads

Blogs

Overcoming Imposter Syndrome: A Plan

By

My most recent bout with imposter syndrome was with ISACA’s Digital Trust Ecosystem Framework...

Advice I Like: Celebrate Success

By

“On the way to a grand goal, celebrate the smallest victories as if each...

Programmatically Retrieving MLV Lineage and Refresh Times

By

Materialized lake views (MLVs) in Microsoft Fabric are an effective way to implement medallion...

Read the latest Blogs

Forums

Cara Buka Blokir BTN mobile

By snz0312

Ini Solusinya CARA Terbaru Buka Blokir BTN Mobile Banking Salah Password Atau Pin terblokir....

Cara Buka Blokir BTN mobile salah password mengatasi

By snz0312

Ini Solusinya CARA Terbaru Buka Blokir BTN Mobile Banking Salah Password Atau Pin terblokir....

Alamat kontrak resmi BCA KCU KUDUS Telp:0817629933

By ak0dua

WhatsApp:0817629933 Jl. Jend. Ahmad Yani No.91, Magersari, Panjunan, Kec. Kota Kudus, Kabupaten Kudus, Jawa...

Visit the forum

Question of the Day

May the Fourth Be With You Fun

In honor of May the fourth and Star Wars (may the force be with you), finish this quote:

"Do, or do not.  ..."

See possible answers