Hello Guys ,
Is there a major difference between a DSL query (search) and a Lucene Query in term of performances (in while creating a visualize) . ? if yes can i get some explaination , if its possible with use case 
Thanks
By "Lucene Query", do you mean the query_string query? Or do you mean raw Lucene implemented via java?
Given the same conditions, a query_string query will have the same performance as the equivalent DSL query (match query, etc). They are both translated to the same atomic Lucene queries and will execute identically.
When i said lucene i meant , the lucene Query you do on the visualize search bar (some kind of filter with wilcard and stuff ) !
Do you have any idea how can i improve my search performances (so i can get information on visualize a little bit faster , before the timeout) using DSL query .
When i said lucene i meant , the lucene Query you do on the visualize search bar (some kind of filter with wilcard and stuff ) !
Assuming it's doing the same thing as an equivalent DSL query, it'll be the same performance... they are executed identically, just a different way to specify the query.
I'm afraid performance tuning is very use-case specific. It depends on the kinds of queries you are running, cluster size, how the data is structured, etc. There aren't really general recommendations that apply to everyone (otherwise we'd just implement that as an optimization).
1 Like
Many thanks
This topic was automatically closed 28 days after the last reply. New replies are no longer allowed.