Re: Revisiting {CREATE INDEX, REINDEX} CONCURRENTLY improvements
Mikhail Nikalayeu <mihailnikalayeu@gmail.com>
From: Mihail Nikalayeu <mihailnikalayeu@gmail.com>
To: Sergey Sargsyan <sergey.sargsyan.2001@gmail.com>
Cc: Álvaro Herrera <alvherre@kurilemu.de>, Andres Freund <andres@anarazel.de>, Michael Paquier <michael@paquier.xyz>, PostgreSQL Hackers <pgsql-hackers@postgresql.org>, Andrey Borodin <amborodin86@gmail.com>, Melanie Plageman <melanieplageman@gmail.com>, Matthias van de Meent <boekewurm+postgres@gmail.com>
Date: 2025-06-16T20:00:59Z
Lists: pgsql-hackers
Commits
Same data as JSON:
GET /api/v1/messages/:b64id/commits
the thread's linked commits as JSON, with link sources.
API reference →
-
Revert changes to CONCURRENTLY that "sped up" Xmin advance
- e28bb8851969 15.0 cited
-
VACUUM: ignore indexing operations with CONCURRENTLY
- d9d076222f5b 14.0 cited
-
Avoid spurious waits in concurrent indexing
- c98763bf51bf 14.0 cited
Hello, Sergey! > I think it's to avoid duplicate errors when adding tuples from STIP to the main index, > but couldn't we just suppress that error during validation and skip the new tuple insertion if it already exists? In some cases, it is not possible: – Some index types (GiST, GIN, BRIN) do not provide an easy way to detect such duplicates. – When we are building a unique index, we cannot simply skip duplicates, because doing so would also skip the rows that should prevent the unique index from being created (unless we add extra logic for B-tree indexes to compare TIDs as well). > The main index may get huge after building, and iterating over it in a single thread and then sorting tids can be time consuming. My tests indicate that the overhead is minor compared with the time spent scanning the heap and building the index itself. > At least I guess one can skip it when STIP is empty. Yes, that’s a good idea; I’ll add it later. > p.s. I noticed that `stip.c` has a lot of functions that don't follow the Postgres coding style of return type on separate line. Hmm... I’ll fix that as well. Best regards, Mikhail.