O(n2) Complexity of GIN Search2019-04-12·674 words·4 minsPostgreSQL PG Development GINWhen 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.
