Adjust down the estimate when its unknown and avoid WhiteListBlueprint being strict.

In cases where only attributes without fast-search are searched with e.g. an OR,
this change avoids sorting the WhiteListBlueprint first under the root AND, which is very costly to evaluate.

1 files changed, 2 insertions, 1 deletions

diff --git a/searchcore/src/vespa/searchcore/proton/documentmetastore/lid_allocator.cpp b/searchcore/src/vespa/searchcore/proton/documentmetastore/lid_allocator.cpp
index 0c986422be6..758d1336399 100644
--- a/searchcore/src/vespa/searchcore/proton/documentmetastore/lid_allocator.cpp
+++ b/searchcore/src/vespa/searchcore/proton/documentmetastore/lid_allocator.cpp
@@ -210,7 +210,8 @@ private:
     }
     FlowStats calculate_flow_stats(uint32_t docid_limit) const override {
         double rel_est = abs_to_rel_est(_activeLids.size(), docid_limit);
-        return {rel_est, bitvector_cost(), bitvector_strict_cost(rel_est)};
+        double do_not_make_me_strict = 1000.0;
+        return {rel_est, bitvector_cost(), do_not_make_me_strict * bitvector_strict_cost(rel_est)};
     }
     SearchIterator::UP
     createLeafSearch(const TermFieldMatchDataArray &tfmda) const override