[go: up one dir, main page]
Menu ▾ ▴

Code Commit Log


Commit Date  
[r1131] by mukau

* cleaned up debugging code and comments

 2018-11-30 15:21:27 Tree
[r1130] by mukau

+ CQueryWith*Node optimizations (actually previous check-in)
+ next: begin cleanup of debug code

 2018-11-30 14:33:41 Tree
[r1129] by mukau

+ CQuerySequenceNode and coefficient-based optimization: lots of debug code still in place, but looks solid

 2018-11-30 14:29:56 Tree
[r1128] by mukau

+ CQuerySequenceNode::EvaluateWithoutHits() optimization -- looking better

 2018-11-30 09:41:56 Tree
[r1127] by mukau
2018-11-29 11:13:06 Tree
[r1126] by mukau

* binary search for CQuerySequenceNode -- not much joy (max ca. 3% faster)

 2018-11-29 08:36:23 Tree
[r1125] by mukau

* added macro DDC_GETBREAK_LB_MIN to QueryNode.cpp
- threshold for use of std::lower_bound() in break-identification step of CQueryNode::ConvertOccurrencesToHits()
- default value = 16k -> ca. 10% faster queries

 2018-11-28 11:47:15 Tree
[r1124] by mukau

v2.1.19-pre1 * added macro DDC_HIT_INTERSECTION_BINSEARCH to QueryNode.cpp
- use std::lower_bound for evaluating hit-list intersection and difference
- may be 3-5% faster for large hit-lists (function words)
* attempted profiling of CQueryNode::ConvertOccurrencesToHits() [perf, callgrind]: no insights

 2018-11-27 15:08:07 Tree
[r1123] by mukau

+ tagged ddc-2.1.18

 2018-11-02 12:19:31 Tree
[r1122] by mukau

v2.1.18 release

 2018-11-02 12:16:02 Tree
Older >