Description
Currently some scorers have to do a lot of per-document work to determine if a document is a match. The simplest example is a phrase scorer, but there are others (spans, sloppy phrase, geospatial, etc).
Imagine a conjunction with two MUST clauses, one that is a term that matches all odd documents, another that is a phrase matching all even documents. Today this conjunction will be very expensive, because the zig-zag intersection is reading a ton of useless positions.
The same problem happens with filteredQuery and anything else that acts like a conjunction.
Attachments
Attachments
Issue Links
- relates to
-
LUCENE-6032 Dealing with slow iterators
-
- Resolved
-
- supercedes
-
-
- Resolved
-
-
-
- Closed
-
-
-
- Resolved
-