External Article

Binary Trees in SQL

A number of hierarchies and networks are most conveniently modelled as binary trees. So what is the best way of representing them in SQL? Joe Celko discards the Nested Set solution in favour of surprisingly efficient solution based on the Binary Heap

External Article

Extending Hierarchical Data Modeling Demonstrated in SQL

The capability of extending the limits of combining multiple node hierarchical structures has not been fully explored. Michael M. David presents a solution to advanced structure combining that is simple to use, generic and freely extends the way hierarchical structures can be semantically combined to produce advanced new hierarchical data structure mashups that dynamically increase the value of the data.

Blogs

Setting Up a Mac for Data Engineering and AI Work

By

If you work with data pipelines, SQL, notebooks, or machine learning models, a Mac...

Want to look at cloud reporting but not sure what the costs will be?

By

Have you been thinking about migrating your reporting to Microsoft Fabric or Snowflake but...

The Joyful Craftsmen and the Revolt BI join forces

By

The Joyful Craftsmen has become the new owner of Revolt BI. The merger creates...

Read the latest Blogs

Forums

SQL Art, Part 4: Happy 4th of July — A British DBA's Guide to Celebrating a War We Don't Talk About

By Terry Jago

Comments posted to this topic are about the item SQL Art, Part 4: Happy...

SQL Server Enum Implementation: A Single-Row View Strategy for Avoiding Magic Values

By Ivica Borscak

Comments posted to this topic are about the item SQL Server Enum Implementation: A...

BIT_COUNT I

By Steve Jones - SSC Editor

Comments posted to this topic are about the item BIT_COUNT I

Visit the forum

Question of the Day

BIT_COUNT I

In SQL Server 2025, I have a table (dbo.UserPermission) that contains this data:

UserID  UserPermissions
15
23
37
What is returned when I run this code:
select bit_count(UserPermissions) as PermissionCount
from dbo.UserPermission
where UserID = 3;

See possible answers