Google patents faster database indexing for PostgreSQL
Google describes a method to speed up the creation of B-tree indexes in PostgreSQL databases by splitting data into smaller chunks. These chunks are processed simultaneously by multiple worker nodes, and the results are combined by a leader node to form the final index.
In the filing’s own words
A method includes obtaining table data and determining a plurality of sorted tuple indexes based on the table data. Each respective sorted tuple index includes a plurality of key values. The method includes partitioning each respective sorted tuple index of the plurality of sorted tuple indexes into two or more partitions. Each respective partition includes at least one key value from each of the plurality of sorted tuple indexes. For each respective partition of the two or more partitions, the method includes assigning a corresponding worker node to the respective partition and generating, using the corresponding worker node, a corresponding b-tree sub-index based on the respective partition. The method includes generating, using a leader node, a b-tree index based on the corresponding b-tree sub-index generated for each respective partition of the two or more partitions.
What exactly they claim (claim 1)
1. A method comprising: obtaining, by data processing hardware, table data; based on the table data, determining, by the data processing hardware, a plurality of sorted tuple indexes, each respective sorted tuple index comprising a corresponding plurality of key values; partitioning, by the data processing hardware, each respective sorted tuple index of the plurality of sorted tuple indexes into two or more partitions, each respective partition comprising at least one key value from each of the plurality of sorted tuple indexes; for each respective partition of the two or more partitions: assigning, by the data processing hardware, a corresponding worker node of the data processing hardware to the respective partition; and generating, by the corresponding worker node, a corresponding b-tree sub-index based on the respective partition; and generating, by leader node of the data processing hardware, a b-tree index based on the corresponding b-tree sub-index generated for each respective partition of the two or more partitions.
Facts
- Company
- Google (Google LLC)
- Official title
- FASTER B-TREE INDEX CREATION IN POSTGRESQL
- Publication number
- US20260267836A1
- Application number
- 19074378
- Filed
- Mar 8, 2025
- Published
- Sep 10, 2026
- Inventors
- 2
- Claims
- 20
Classified under
G06F 16/217 Physics & computingG06F 16/2246 Physics & computingG06F 16/24554 Physics & computingMore from Google in AI & software
- Google patents video search that answers questions using AI descriptions Sep 15, 2026
- Google patents photo tool that removes people and their gear Sep 15, 2026
- Google patents AI that writes live meeting notes and summaries Sep 15, 2026
- Google patents AI tool that turns messy emergency notes into clear messages Sep 3, 2026
- Google patents AI that clicks through apps to finish tasks for you Sep 24, 2026
Summaries are simplified from the filing’s own abstract and first claim. A patent filing is not a product announcement.
Patent data and drawings: U.S. Patent and Trademark Office (USPTO). Nebula is not affiliated with or endorsed by the USPTO.