Indexes

Data structure

  • Data structure used : B-Tree

  • Self Balancing Index

  • SELECT, INSERT, DELETE and sequential access in logarithmic time

  • Can be used for most of operations and column type

  • supports unique condition

  • Used in Primary Key

  • Used with operators

  • Used when pattern matching

Hash Index

https://codingsight.com/hash-index-understanding-hash-indexes/

  • for equality operators

  • not for range

  • Larger than btree in size

Brin Index

  • block range index

  • block data -> min to max value

  • smaller index

  • less costly to maintain than btree index

  • Can be used on very large table

Partial Index

  • To performance of the query while reducing the index size.

Expression Index

  • PostgreSQL will use this index when WHERE clause or ORDER BY clause in statement

  • Very Expensive to use

Heap Index

Last updated

Was this helpful?