Explore >> Select a destination
|
You are here 
|
newvick.com | ||
| | | | |
rcoh.me
|
|
| | | | | Many software engineers use database indexes every day, but few of us really understand how they work. In this post I'll explain: How indexing works in Postgres using B-Trees What B-Trees are Why they are a good fit for this problem Indexes in Postgres Postgres actually offers 4 different kinds of indexes for different use cases. In this post I'll be focusing on the "normal" index, the kind you get by default when you run create index. | |
| | | | |
www.crunchydata.com
|
|
| | | | | Covering indexes in PostgreSQL are an incredibly helpful feature that can help improve the performance of your application when used correctly. This article demonstrates how an application that collects time-series and geospatial data is able to use covering indexes to boost performance. | |
| | | | |
aivarsk.com
|
|
| | | | | I was listening to a talk about finding a PAN in a haystack and this slide came up with performance numbers in seconds: | |
| | | | |
tanelpoder.com
|
|
| | | Update: As this original article is from 2007, there are better options available in the modern times for example DBMS_UTILITY.EXPAND_SQL_TEXT as explained by Maria Colgans blog entry here. If you have been involved in tuning SQL code which you have never seen before, you are probably familiar with the challenges of understanding what the code is trying to do. This can be especially time consuming when the SQL references lots of views, which reference views, which reference more views etc. So there may ... | ||
