On 7th of April 2018, Teodor Sigaev committed patch: Indexes with INCLUDE columns and their support in B-tree This patch introduces INCLUDE clause to index definition. This clause specifies a list of columns which will be included as a non-key part in the ...

Support parallel btree index builds. To make this work, tuplesort.c and logtape.c must also support parallelism, so this patch adds that infrastructure and then applies it to the particular case of parallel btree index builds. Testing to date shows that this can often ...

April 11th, 2016 by depesz | Tags: , , , , , | Comments Off on Waiting for 9.6 – Bloom index contrib module

On 1st of April, Teodor Sigaev committed patch: Bloom index contrib module Module provides new access method. It is actually a simple Bloom filter implemented as pgsql's index. It could give some benefits on search with large number of columns. Module is a single way ...

On 2nd of September, Teodor Sigaev committed patch: Allow usage of huge maintenance_work_mem for GIN build. Currently, in-memory posting list during GIN build process is limited 1GB because of using repalloc. The patch replaces call of repalloc to repalloc_huge. It increases limit of posting ...

September 7th, 2015 by depesz | Tags: , , , , , | 5 comments »

There exists an extension to PostgreSQL, which lets you use hypothetical indexes. What are there? That's simple - these are indexes that don't really exist. So what good are they? Let's see.

On 26th of March, Heikki Linnakangas committed patch: Add support for index-only scans in GiST. This adds a new GiST opclass method, 'fetch', which is used to reconstruct the original Datum from the value stored in the index. Also, the 'canreturn' index AM interface ...

On 18th of March, Alvaro Herrera committed patch: array_offset() and array_offsets() These functions return the offset position or positions of a value in an array. Author: Pavel Stěhule Reviewed by: Jim Nasby

On 19th of January, Robert Haas committed patch: Use abbreviated keys for faster sorting of text datums. This commit extends the SortSupport infrastructure to allow operator classes the option to provide abbreviated representations of Datums; in the case of text, we abbreviate by taking ...

The general knowledge is that numerics are slower than integers/float, but offer precision and ranges that are better. While I understand what is slow, I don't really know how much slower numerics are. So let's test it.

On 7th of November, Alvaro Herrera committed patch: BRIN is a new index access method intended to accelerate scans of very large tables, without the maintenance overhead of btrees or other traditional indexes. They work by maintaining "summary" data about block ranges. ...