Change tuning parameters after analyzing OR performance.

1 files changed, 5 insertions, 3 deletions

diff --git a/searchlib/src/vespa/searchlib/queryeval/flow_tuning.h b/searchlib/src/vespa/searchlib/queryeval/flow_tuning.h
index ce5a24d9c2f..53f2be88c1f 100644
--- a/searchlib/src/vespa/searchlib/queryeval/flow_tuning.h
+++ b/searchlib/src/vespa/searchlib/queryeval/flow_tuning.h
@@ -22,6 +22,8 @@ inline double array_cost(double my_est, size_t num_children) {
  * The following tests were executed on a machine with an Intel Xeon 2.5 GHz CPU with 48 cores and 256 Gb of memory:
  * ./searchlib_iterator_benchmark_test_app --gtest_filter='*analyze_term_search*'
  *
+ * TODO: Add details on OR benchmarking.
+ *
  * The benchmark summary shows the 'average ms per cost' of the different benchmark cases.
  * The following constants and formulas were derived to balance 'average ms per cost' to be similar
  * across the different benchmark cases.
@@ -29,7 +31,7 @@ inline double array_cost(double my_est, size_t num_children) {
 
 // Non-strict cost of lookup based matching in an attribute (not fast-search).
 inline double lookup_cost(size_t num_indirections) {
-    return 1.0 + (num_indirections * 4.0);
+    return 1.0 + (num_indirections * 1.0);
 }
 
 // Strict cost of lookup based matching in an attribute (not fast-search).
@@ -39,7 +41,7 @@ inline double lookup_strict_cost(size_t num_indirections) {
 
 // Non-strict cost of matching in a btree posting list (e.g. fast-search attribute or memory index field).
 inline double btree_cost() {
-    return 7.0;
+    return 1.0;
 }
 
 // Strict cost of matching in a btree posting list (e.g. fast-search attribute or memory index field).
@@ -49,7 +51,7 @@ inline double btree_strict_cost(double my_est) {
 
 // Non-strict cost of matching in a disk index posting list.
 inline double disk_index_cost() {
-    return 12.0;
+    return 1.5;
 }
 
 // Strict cost of matching in a disk index posting list.