About 302,000 results
Open links in new tab
  1. PostgreSQL: Documentation: 17: 64.1. B-Tree Indexes

    Feb 20, 2025 · PostgreSQL includes an implementation of the standard btree (multi-way balanced tree) index data structure. Any data type that can be sorted into a well-defined linear order can …

  2. An Introduction to B-Tree and Hash Indexes in PostgreSQL

    This article explores the PostgreSQL implementation of the B-Tree (the B stands for Balanced) and hash index data structures. As PostgreSQL grows in popularity as an open-source …

  3. PostgreSQL: Documentation: 15: 67.4. Implementation

    Feb 20, 2025 · PostgreSQL B-Tree indexes are multi-level tree structures, where each level of the tree can be used as a doubly-linked list of pages. A single metapage is stored in a fixed …

  4. B-Tree Implementation in PostgreSQL: Deep Dive into Database …

    Oct 27, 2024 · The B-Tree index structure allows PostgreSQL to locate entries quickly by organizing them in a tree-like hierarchy, with nodes containing keys and pointers to other …

  5. postgresql - B+ tree or B-tree - Stack Overflow

    Jul 28, 2014 · Oracle, SQL Server, SQLite, DB2, and MySQL use B+ tree. It seems that also PostgreSQL uses B+ tree because: Each leaf page contains tuples that point to table rows. …

  6. Understanding B-Tree Indexes in PostgreSQL: A Comprehensive …

    Jun 1, 2024 · Learn what B-Tree indexes are, how they function, and examine them using the pageinspect tool. This article provides a thorough understanding of how PostgreSQL stores …

  7. How the B-Tree Data Structure Powers PostgreSQL 17

    Mar 11, 2025 · The B-Tree data structure remains a vital component of PostgreSQL's indexing capabilities, ensuring efficient data retrieval and robust performance. PostgreSQL 17 …

  8. B-Tree Index in PostgreSQL. B-tree indexes are the default …

    Jan 31, 2023 · A B-tree index is a balanced tree data structure that is used to store the indexed values in sorted order. The indexed values are stored in nodes at the bottom of the tree, and …

  9. PostgreSQL B-Tree Indexes - DataCamp

    Learn how PostgreSQL B-Tree Indexes enhance query performance by speeding up data retrieval and sorting, with practical examples and best practices for efficient database management.

  10. B-Tree Index In PostgreSQL - Database Tutorials

    Jul 22, 2024 · B-tree indexes process equality and range queries on data that can be sorted in a certain order. In particular, the PostgreSQL query planner will prefer to use the B-tree index …

  11. Some results have been removed
Refresh