How a Single Postgres Index Cut Query Time by 95 Percent

In this episode, Lucas and Luna dig into a story that sounds almost too good to be true: one carefully designed Postgres index cut a query's runtime from 12 seconds to under half a second — a 95 percent improvement. They break down what the index actually was, why it worked so well, and the trade-offs the engineer had to weigh, like storage overhead and write performance. Along the way, they discuss how to think about indexing in general, using the example of a common e-commerce query that filters on both customer ID and order date. They also touch on when a regular B-tree index is enough, and when you might need something like a covering index or a partial index. The hosts keep it practical, with concrete numbers and clear explanations, so you can walk away with ideas to apply to your own databases. Plus, they mention how listener support keeps the show ad-free and independent. #Postgres #Indexing #DatabaseOptimization #SQL #QueryPerformance #BTreeIndex #CoveringIndex #PartialIndex #Ecommerce #Engineering #TechPodcast #FexingoBusiness #BusinessPodcast #SoftwareEngineering #CodeOptimization #DataModeling #PostgreSQL #PerformanceTuning Keep every episode free: buymeacoffee.com/fexingo