We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
on a 20.000 records catalogue with postgres backend we noticed serious performance issues when combining q search with facets
some requests without facets run for 3 seconds, with facets up to 12 seconds
my expectation is that the FTS is expensive, but this expense seems multiplied for each of the facets
I wonder if there are any thoughts on this aspect
The text was updated successfully, but these errors were encountered:
No branches or pull requests
on a 20.000 records catalogue with postgres backend we noticed serious performance issues when combining q search with facets
some requests without facets run for 3 seconds, with facets up to 12 seconds
my expectation is that the FTS is expensive, but this expense seems multiplied for each of the facets
I wonder if there are any thoughts on this aspect
The text was updated successfully, but these errors were encountered: