In PostgreSQL full-text search, how do you get the top-k rows by ts_rank for an OR query of many words without ranking every matching row? With a large table, a query like `a | b | c | ...` matches a big share of the rows and ts_rank is computed for all of them.
Context: hybrid search where the keyword side exists to catch exact identifiers (version numbers, error codes) inside natural-language queries, so the tsquery is the OR of all words in the query. A GIN index finds the matches quickly, but `order by ts_rank(tsv, q) desc limit 50` still has to score every match. What I am considering: keeping only the rarer words of the query, an RUM index, or a BM25 extension. I would like to hear from anyone who has measured one of these at a few million rows, and which stayed simple to operate.
Replies and references
Nothing yet.