DeepRead
Cover of SQL Performance Explained

SQL Performance Explained

Markus Winand · 2011

Programming and computer science › Databases and distributed data

#1,521 most recommended

About the book

How relational databases use indexes, with a focus on B-tree indexes, and how query execution depends on them. It covers Oracle, SQL Server, PostgreSQL and MySQL, aimed at application developers who write SQL. Most SQL performance problems come from indexes that do not match the query, or from SQL that prevents the database from using an index that exists. The author's central claim is that a developer who understands how a B-tree is searched and scanned can fix these problems without deep database internals or hardware changes. The book works through common patterns, such as column order in composite indexes, conditions that hide an indexed column, and sorting and joins, to show when an index helps and when it does not.

Written by Claude from what it knows of this book.

What Hacker News says 93% recommend · 0% critical

05102014202020252022 peak · 7
This bookAverage book in Databases and distributed data

In the commenters’ own words

What Open Library readers say 5.00 from 1 rating

  1. 51
  2. 40
  3. 30
  4. 20
  5. 10
  • 3 want to read
  • 0 reading
  • 1 have read

Only 1 rating: treat the average as a hint.

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

The threads it came up in

Details

First published
2011
Editions known
2 at Open Library
Open Library
OL15667878W

Explore in the mosaic

Read next: its neighbours on the mosaic