Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | - Do not use Searcher interface below the prelude cluster searcher. | Henning Baldersheim | 2024-03-08 | 1 | -3/+3 |
| | | | | | | - It is not necessary and provides no value. - It also hides some important aspects, like the schema. - And it simplifies testing. | ||||
* | Update copyright | Jon Bratseth | 2023-10-09 | 1 | -1/+1 |
| | |||||
* | Make a few simpler interfaces instead of carrying one huge implement all ↵ | Henning Baldersheim | 2022-11-23 | 1 | -9/+18 |
| | | | | SearchCluster around. | ||||
* | Various cleanup and code deduplication. | Henning Baldersheim | 2022-10-13 | 1 | -8/+8 |
| | |||||
* | Remove all traces from computeCoverageFromTargetActiveDocs | Henning Baldersheim | 2022-09-29 | 1 | -6/+2 |
| | |||||
* | Chose correct "redundancy" for coverage estimation. Current default is to ↵ | Henning Baldersheim | 2022-09-20 | 1 | -1/+5 |
| | | | | | | use searchable-copies. But when we flip to use target-active directly from the backend we need to use redundancy. | ||||
* | Control whether to report coverage based on active or target active documents. | Henning Baldersheim | 2022-09-19 | 1 | -1/+1 |
| | |||||
* | Clarify semantics by better naming and correct code visibility | Henning Baldersheim | 2022-09-14 | 1 | -6/+6 |
| | |||||
* | Factor out timeout and coverage handling to make the ↵ | Henning Baldersheim | 2022-09-14 | 1 | -121/+23 |
| | | | | InterleavedSearchInvoker easier to understand and modify. | ||||
* | soonActive => targetActive | Henning Baldersheim | 2022-09-09 | 1 | -5/+5 |
| | | | | Wire in targetActive in MonitorReply/Pong. | ||||
* | Propagate target-active-docs in monitor reply. | Henning Baldersheim | 2022-09-09 | 1 | -2/+2 |
| | |||||
* | Revert "Do not claim that you have asked nodes that were in a known failed ↵ | Henning Baldersheim | 2022-07-08 | 1 | -0/+3 |
| | | | | st…" | ||||
* | Do not claim that you have asked nodes that were in a known failed state. | Henning Baldersheim | 2022-07-08 | 1 | -3/+0 |
| | | | | This makes coverage computation incorrect. | ||||
* | Remove feature flag 'merge-grouping-result-in-search-invoker' | Bjørn Christian Seime | 2022-03-30 | 1 | -5/+2 |
| | |||||
* | Add FlatteningSearcher | Jon Bratseth | 2022-03-07 | 1 | -31/+0 |
| | |||||
* | Merge grouping results incrementally in search invoker | Bjørn Christian Seime | 2022-03-01 | 1 | -3/+14 |
| | |||||
* | Log number of working/nodes and nodes. | Henning Baldersheim | 2021-11-05 | 1 | -1/+0 |
| | |||||
* | Update 2018 copyright notices. | gjoranv | 2021-10-07 | 1 | -1/+1 |
| | |||||
* | Enable top-k optimization only if balanced and non-sparse | Jon Bratseth | 2021-07-02 | 1 | -4/+8 |
| | |||||
* | Non-functional changes only | Jon Bratseth | 2021-04-12 | 1 | -11/+1 |
| | |||||
* | only do debug logging in very specific cases | Arne Juul | 2021-03-26 | 1 | -16/+34 |
| | |||||
* | add more debug logging about hit merging | Arne Juul | 2021-03-25 | 1 | -5/+33 |
| | |||||
* | Revert "Revert "Disable topk optimisation on dispatch when content ↵ | Henning Baldersheim | 2021-01-08 | 1 | -5/+10 |
| | | | | distribution is se…"" | ||||
* | Revert "Disable topk optimisation on dispatch when content distribution is ↵ | Henning Baldersheim | 2021-01-08 | 1 | -10/+5 |
| | | | | se…" | ||||
* | Disable topk optimisation on dispatch when content distribution is severly ↵ | Henning Baldersheim | 2021-01-07 | 1 | -5/+10 |
| | | | | | | | | skewed. When the skew is too large the assumption that docs are evenly and randomly distributed hold. The impact and is larger on smaller systems. In large systems the where this optimisation is more important, the probabilitity of large skew will be less. | ||||
* | Add support for serializing and compressing once, instead of once per ↵ | Henning Baldersheim | 2020-06-30 | 1 | -2/+4 |
| | | | | backend node. | ||||
* | Add query control of top-k-probability. | Henning Baldersheim | 2020-04-15 | 1 | -1/+9 |
| | |||||
* | Introduce top-k-probability and use it to fetch correct proper amount of ↵ | Henning Baldersheim | 2020-04-15 | 1 | -1/+1 |
| | | | | hits from each partition | ||||
* | Support max-hits-per-node in Dispatcher | Jon Bratseth | 2020-01-08 | 1 | -0/+1 |
| | |||||
* | Revert "Revert "Revert "Revert "Use a LeanHit until merging is done." MERGEOK""" | Henning Baldersheim | 2019-09-16 | 1 | -49/+25 |
| | |||||
* | Revert "Revert "Revert "Use a LeanHit until merging is done." MERGEOK"" | Henning Baldersheim | 2019-09-16 | 1 | -25/+49 |
| | |||||
* | Revert "Revert "Use a LeanHit until merging is done." MERGEOK" | Henning Baldersheim | 2019-09-16 | 1 | -49/+25 |
| | |||||
* | Revert "Use a LeanHit until merging is done." | Henning Baldersheim | 2019-09-16 | 1 | -25/+49 |
| | |||||
* | Use a LeanHit until merging is done. | Henning Baldersheim | 2019-09-16 | 1 | -49/+25 |
| | |||||
* | Since we are trimming we need to reflect that in the offsets too. | Henning Baldersheim | 2019-09-11 | 1 | -0/+1 |
| | |||||
* | Check for auxiliary hits in first chunk explicit | Henning Baldersheim | 2019-09-11 | 1 | -1/+10 |
| | |||||
* | Add minmal testing of merge and offset and auxiliary hits. | Henning Baldersheim | 2019-09-11 | 1 | -4/+14 |
| | |||||
* | Also consider auxiliary hits. | Henning Baldersheim | 2019-09-10 | 1 | -6/+24 |
| | |||||
* | HitGroup.sort and hit.compareTo must ensure same ordering... | Henning Baldersheim | 2019-09-10 | 1 | -21/+19 |
| | | | | Do not use the first result as starting point. Start off with a fresh one. | ||||
* | Revert "Revert "Append all, the sort all, then trim tail is too expensive."" | Henning Baldersheim | 2019-09-10 | 1 | -14/+33 |
| | |||||
* | Revert "Append all, the sort all, then trim tail is too expensive." | Henning Baldersheim | 2019-09-10 | 1 | -33/+14 |
| | |||||
* | Append all, the sort all, then trim tail is too expensive. | Henning Baldersheim | 2019-09-08 | 1 | -14/+33 |
| | | | | Continous merge with trim is far more efficient as input is already sorted. | ||||
* | Trim hits more eagerly | Olli Virtanen | 2019-06-11 | 1 | -1/+1 |
| | |||||
* | Use sort data with java dispatcher | Olli Virtanen | 2019-04-02 | 1 | -12/+4 |
| | |||||
* | Change trace level of network errors | Olli Virtanen | 2019-03-22 | 1 | -2/+2 |
| | |||||
* | Report partial group connection failures through trace, not error | Olli Virtanen | 2019-03-22 | 1 | -4/+27 |
| | |||||
* | Remove the packet cache. It will very soon loose its value as we are ↵ | Henning Baldersheim | 2019-03-07 | 1 | -3/+2 |
| | | | | | | | changing the protocol. And also as it does not work for grouping I think it is better to just let it go. We might want a cache sometime later, but then we should redesign it. | ||||
* | Fix search invoker resource leak | Olli Virtanen | 2019-02-12 | 1 | -1/+6 |
| | |||||
* | Minor typo fix | Olli Virtanen | 2019-01-16 | 1 | -1/+1 |
| | |||||
* | Use the correct error type for timeouts, and only create one error | Olli Virtanen | 2019-01-16 | 1 | -9/+6 |
| |