Please turn JavaScript on
header-image

SQLpassion

Receive updates from SQLpassion for free, starting right now.

We can deliver them by email, via your phone or you can read them from a personalised news page on follow.it.

This way you won't miss any new article from SQLpassion. Unsubscribe at any time.

Site title: SQLpassion – SQLpassion provides high-quality SQL Server Consulting services for clients around Europe & the US

Is this your feed? Claim it!

Publisher:  Unclaimed!
Message frequency:  0.74 / week

Message History

When SQL Server professionals start working seriously with PostgreSQL, most of the learning curve feels comfortable. Tables behave as expected, transactions are familiar, and B-tree indexes look reassuringly similar to what you have used for years in SQL Server. Then you encounter BRIN indexes.

At first glance, they seem almost reckless: no row pointers, no precise ...


Read full story

If you come from SQL Server (like in my case), PostgreSQL indexing can feel familiar at first – B-tree indexes exist, composite indexes exist, covering indexes exist. And then you run into queries like this:

WHERE payload @> '{"type":"payment","status":"failed"}'

or this:

WHERE tsv @@ plainto_tsquery('postgresql')

At that point, most SQL Server de...


Read full story

The first half of 2026 is packed with live, instructor-led online trainings designed for professionals who want to go deeper – not just collect features, but truly understand how things work and how to use them effectively in production.

Whether you are a SQL Server professional, expanding into


Read full story

When SQL Server developers begin working with PostgreSQL, indexing usually feels familiar at first. B-tree indexes behave as expected, query plans look readable, and the query planner makes reasonable choices.

But PostgreSQL also introduces new index types like GiST and SP-GiST. They do not map cleanly to anything in SQL Server, and...


Read full story

If you come from a SQL Server background (like in my case), you already have strong instincts about indexing. You know why B-trees dominate, why sorted structures matter, and why equality predicates are usually fast enough without special tricks. When you first encounter Hash Indexes in PostgreSQL, the obvious question is not how they work, but why they exist...


Read full story