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

7,887 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,369 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,497 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,722 reads

Blogs

T-SQL Tuesday #181: A Technology Present

By

It’s the last T-SQL Tuesday of the year, and it’s amazing to think we’ve...

Trace Flag 3625 Follow Up

By

Several months ago, I discussed my customer’s intention to enable trace flag 3625. Since...

Top 5 Advanced SQL Courses for 2025 (Must-Know)

By

Want to seriously boost your data skills? Mastering advanced SQL is the key, whether...

Read the latest Blogs

Forums

Peer review SQL Central articles

By Srinivasarao Daruna

Hi, I would like to contribute to SQLServerCentral in peer reviews. As there are...

Getting ANY of the data

By Steve Jones - SSC Editor

Comments posted to this topic are about the item Getting ANY of the data

Why Would You Do That?

By Steve Jones - SSC Editor

Comments posted to this topic are about the item Why Would You Do That?

Visit the forum

Question of the Day

Getting ANY of the data

I have this data in two tables:

-- Beer table
BeerIDBeerNamebrewer
5Becks    Interbrew
6Fat Tire   New Belgium
7Mac n Jacks  Mac & Jack's Brewery
8Alaskan AmberAlaskan Brewing 
9Kirin        Kirin Brewing

-- Beercount table
BeerName      BottleCount
Becks         5
Fat Tire      1
Mac n Jacks   2
Alaskan Amber 4
NULL          7
Corona        2
Tsing Tao     4
Kirin         12
What is returned from this query?
SELECT *
FROM dbo.BeerCount AS bc
WHERE bc.BeerName=ANY
  (SELECT b2.BeerName FROM dbo.Beer AS b2);
 

See possible answers