Skip to content

GIN

1 page

  • O(n2) Complexity of GIN Search

    In PostgreSQL

    PostgreSQLPG-DevelopmentGIN

    O(n2) Complexity of GIN Search

    When GIN indexes are used to search with very long keyword lists, performance degrades significantly. This article explains why GIN index keyword search has O(n^2) time complexity.

    When GIN indexes are used to search with very long keyword lists, performance degrades significantly. This article explains why GIN index keyword search has O(n^2) time complexity.