3 ms·
Ordering can get expensive no matter what just base on how many things you're actually sorting. Ideally, if you can find a way to limit the size of the data set
by brightball 10y ago
Ordering can get expensive no matter what just base on how many things you're actually sorting. Ideally, if you can find a way to limit the size of the data set before the ranking sort you'll see a big improvement.
- ngrilly 10y agoCurrently, the only way to make ranking tolerable is to limit the size of the data set before the ranking sort. This is what I did in my tests. But it looks like it could be possible to massively improve ranking performance by storing all necessary information directly in the GIN index, as proposed here: https://wiki.postgresql.org/images/2/25/Full-text_search_in_PostgreSQL_in_milliseconds-extended-version.pdf https://wiki.postgresql.org/images/2/25/Full-text_search_in_...