| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | use thread_local for blueprint options | Håvard Pettersen | 2024-03-25 | 1 | -2/+2 |
| | | |||||
| * | tag blueprints with strictness | Håvard Pettersen | 2024-03-20 | 1 | -94/+167 |
| | | | | | | | The strict-aware sort function is responsible for propagating and tagging strictness throughout the blueprint tree. Use pre-tagged strictness in fetchPostings, createSearch and createFilterSearch. | ||||
| * | know the in-flow when sorting blueprints | Håvard Pettersen | 2024-02-23 | 1 | -1/+1 |
| | | | | | | | also added the option and tagging mechanic needed to force selected blueprints to be strict even in a non-strict context as well as calculating how much time this saves you. | ||||
| * | make default flow stats more explicit | Håvard Pettersen | 2024-02-06 | 1 | -0/+1 |
| | | | | | | | for both simple and complex leafs account for number of inner children in complex leafs account for seek nesting for complex leafs with children | ||||
| * | re-wire flow stats in blueprints | Håvard Pettersen | 2024-02-02 | 1 | -3/+1 |
| | | |||||
| * | wire in strict flow analysis and strict-aware sorting | Håvard Pettersen | 2024-01-22 | 1 | -1/+4 |
| | | | | | | | | | | | strict_cost added to all blueprints separate top-down sort step after optimize move relative estimate out of blueprint state optimize all children; to calculate flow stats leaf defaults: matching>0.9: est: 0.5, cost: 1.0, strict_cost: 1.0 matching<=0.9: est: rel_est, cost: 1.0, strict_cost: rel_est | ||||
| * | enable sorting on cost | Håvard Pettersen | 2023-12-20 | 1 | -1/+1 |
| | | |||||
| * | Revert "Revert "relative estimate"" | Henning Baldersheim | 2023-12-11 | 1 | -0/+1 |
| | | |||||
| * | Revert "relative estimate" | Henning Baldersheim | 2023-12-09 | 1 | -1/+0 |
| | | |||||
| * | relative estimate | Håvard Pettersen | 2023-12-08 | 1 | -0/+1 |
| | | |||||
| * | perform blueprint optimization in multiple passes | Håvard Pettersen | 2023-11-20 | 1 | -1/+1 |
| | | |||||
| * | Update copyright | Jon Bratseth | 2023-10-09 | 1 | -1/+1 |
| | | |||||
| * | We only need the FieldSpecBase. No need to carry and copy the name around. | Henning Baldersheim | 2023-07-19 | 1 | -1/+1 |
| | | |||||
| * | Accumulate HitEstimate and apply when complete. | Henning Baldersheim | 2023-07-06 | 1 | -3/+9 |
| | | |||||
| * | As a single field per blueprint is the common use case, make that optimal ↵ | Henning Baldersheim | 2023-05-12 | 1 | -1/+1 |
| | | | | | more optimal. | ||||
| * | GC some void inline pragmas | Henning Baldersheim | 2023-01-30 | 1 | -8/+25 |
| | | |||||
| * | Expose SameElement query terms to ranking. | Geir Storli | 2023-01-12 | 1 | -1/+2 |
| | | | | | | | A TermFieldMatchData is allocated per SameElement term, and this is used to signal matching docids in doUnpack() on the SameElement search iterator. This allows using the matches() rank feature on a field (virtual) that is searched using a SameElement term. | ||||
| * | explicit default filter | Håvard Pettersen | 2022-10-31 | 1 | -1/+9 |
| | | |||||
| * | create optimized filter search | Håvard Pettersen | 2022-10-28 | 1 | -101/+308 |
| | | | | | | test strict/constraint propagation test filters dropped due to short-circuit | ||||
| * | more filter search testing | Håvard Pettersen | 2022-10-26 | 1 | -51/+187 |
| | | | | | | less magic chaining added adapters and decorators for more advanced cases | ||||
| * | use common algorithms for filter creation | Håvard Pettersen | 2022-10-25 | 1 | -46/+153 |
| | | | | | | add more testing keep children blueprints in unique pointers | ||||
| * | filter search test initial version | Håvard Pettersen | 2022-10-24 | 1 | -0/+157 |
 |
index : vespa | |
| An engine for low-latency computation over large data sets |
| summaryrefslogtreecommitdiffstats |