mmissoldtw ←
SQL Performance Tips4,944 posts
SQL Performance Tips avatar

SQL Performance Tips

@SQLPerfTips

Tips to get best SQL performance. Covering all major SQL databases. sql-performance-explained.co… is my book.

◷ Joined April 2011▧ 167 Photos and videos
Markus Winand avatar
⟳ SQL Performance Tips retweeted
Markus Winand@MarkusWinand·Oct 1

€10 for a frontier AI subscription are gone in one workday €10 for my book SQL Performance Explained has a lasting impact on you* sql-performance-explained.co… Learning timeless fundamentals always has a lasting effect * you also need to read it, which takes about 1 day ;)

SQL Performance Tips avatar
SQL Performance Tips@SQLPerfTips·Jan 10

A B-tree is not a binary tree. A B-tree does not go out of balance. A B-tree is self-balancing: it does *not* require expensive operations to keep the balance.

Markus Winand avatar
⟳ SQL Performance Tips retweeted
Markus Winand@MarkusWinand·5 Sep 2025

My favorite change is that MariaDB got an improved "WHERE year(...) = ?" rewriting. use-the-index-luke.com/blog/… In picture: the green check mark used to be yellow, with the "a" footnote: Unconditionally rewritten—even if only a matching function-based index exists

Post attachment
Shreyansh Gupta avatar
⟳ SQL Performance Tips retweeted
Shreyansh Gupta@_backslashzero·8 Dec 2024

#doyouknow? If your index is getting too big in size, you can index only a subset of the values using Partial Indexes. Read more here - use-the-index-luke.com/sql/w… #databases #sql

SQL Performance Tips avatar
SQL Performance Tips@SQLPerfTips·22 Nov 2024

As sort-based indexes (such as B-Tree) also use collations to establish their row order, the speed of the collation affects the index build time, but not so much the search time as the number of comparisons for a search is very limited.