Caused by: org.apache.lucene.util.automaton.TooComplexToDeterminizeException: Determinizing automaton would result in more than 10000 states.
at org.apache.lucene.util.automaton.Operations.determinize(Operations.java:743)
at org.apache.lucene.util.automaton.RunAutomaton.<init>(RunAutomaton.java:138)
at org.apache.lucene.util.automaton.ByteRunAutomaton.<init>(ByteRunAutomaton.java:32)
at org.apache.lucene.util.automaton.ByteRunAutomaton.<init>(ByteRunAutomaton.java:27)
at org.elasticsearch.search.aggregations.bucket.terms.support.IncludeExclude$StringFilter.<init>(IncludeExclude.java:88)
{
"query": {
...
},
"aggs": {
"sample": {
"sampler": {
"shard_size": 100
},
"aggs": {
"suggestions": {
"terms": {
"field": "links",
"exclude": [
"Triangle-free graph",
"Digraph (mathematics)",
"Clique (graph theory)",
"K-vertex-connected graph",
"Connected graph",
"Semi-symmetric graph",
"Complement (graph theory)",
"Tournament (graph theory)",
"Tree (graph theory)",
"Degree (graph theory)",
"Node (graph theory)",
"Heawood graph",
"Cycle graph",
"Cage graph",
"Star (graph theory)",
"Hoffman–Singleton graph",
"Edge (graph theory)",
"Shrikhande graph",
"Cubic graph",
"Cycle (graph theory)",
"Trees (graph theory)",
"Directed graph",
"Moore graph",
"Graph homomorphism",
"Hamiltonian graph",
"Regular graph",
"Vertex (graph theory)",
"Minor (graph theory)",
"Harries graph",
"Complement graph",
"K-edge-connected graph",
"Okapi BM25",
"Controlled vocabularies",
"Document retrieval",
"Recall (information retrieval)",
"C. J. van Rijsbergen",
"Subject indexing",
"Enterprise Search",
"Natural Language Processing",
"Information Retrieval",
"Relevance",
"SMART Information Retrieval System",
"Text mining",
"Inverse document frequency",
"Ranking functions",
"Binary classification",
"Enterprise search",
"Document classification",
"SIGIR",
"Query language",
"Gerard Salton",
"Gain (information retrieval)",
"Relevance (information retrieval)",
"Text Retrieval Conference",
"Compound term processing",
"Latent semantic indexing",
"Query expansion",
"Information retrieval#Recall",
"Vector Space Model",
"Stop words",
"Search engine",
"Index (search engine)",
"Tf-idf",
"Precision and recall",
"Query",
"Precision (information retrieval)",
"Latent semantic analysis",
"Summary statistics for contingency tables",
"Term frequency",
"Text retrieval",
"Natural language processing",
"Inverted index",
"Standard Boolean model",
"Question answering",
"Search engine indexing",
"Rocchio Classification",
"Jaccard index",
"Searching",
"Ranking function",
"Information retrieval",
"Relevance feedback",
"Special Interest Group on Information Retrieval",
"Information need",
"Gerard Salton Award",
"Vector space model",
"Automatic summarization"
]
}
}
}
}
},
"size": 1
}
I can see how consulting large sets of terms can be expensive and we might want to cap it but in the above case this risk is mitigated through the use of the "sampler" agg to consider a maxiumum of 100 top-matching docs.
The use case for this type of query is looking for new terms outside of a set that has already been gathered by the client eg aiding graph exploration by looking for connections beyond what you already have collected:
These sorts of exclude lists can grow large so a cap of around 85 terms seems low for this use case.
A
termsagg with anexcludearrray of medium size (in my case, 86 strings) was sufficient to cause this error:Example query:
I can see how consulting large sets of terms can be expensive and we might want to cap it but in the above case this risk is mitigated through the use of the "sampler" agg to consider a maxiumum of 100 top-matching docs.
The use case for this type of query is looking for new terms outside of a set that has already been gathered by the client eg aiding graph exploration by looking for connections beyond what you already have collected:
These sorts of exclude lists can grow large so a cap of around 85 terms seems low for this use case.