Author name: Klaus Aschenbrenner

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 documentation often describes

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,

In November, I delivered a webcast titled “PostgreSQL Introduction for the SQL Server Professional” – a compact introduction to the most important architectural and conceptual differences between SQL Server and PostgreSQL. You can find here now the recorded version of the webcast: What This Webcast Covers This session is designed for SQL Server professionals who