O(n2) Complexity of GIN Search
In PostgreSQL
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. Read more
Was this page helpful?
Thanks—your feedback helps us improve this page.
What got in the way? (optional)