: I'm playing around with making the caching work at the
: field name/type level, and getting rid of cacheing by
: Reader. What this would mean is that all searchers
: would use the same sorting; under certain
: circumstances, a new sorting could be created using
: data from an old, cached sortin
Our search engine updates frequently, adding and
removing documents from the index. After an index
update, we create a new Searcher in the background,
and execute a search against it to "prime" the sorting
by fields. The new Searcher is swapped for the old.
>From my understanding, this is a fair