Kishore Nallan 30cd057201 Split-up fuzzy lookup into separate stages. ...

1. Collect all the nodes where cost exceeds threshold.
2. Sort these nodes based on a score.
3. Perform top-k iteration to locate high scoring leaves.

This ensures that small scoring leaves don't end up trumping leaves with higher score (as it was noticed).

2016-06-10 23:20:44 +05:30

..

art.h

Split-up fuzzy lookup into separate stages.

2016-06-10 23:20:44 +05:30

forarray.h

Fix size calculation for unsorted append.

2016-06-09 17:28:50 +05:30

IdGenerator.h

Add 2 more external dependencies via git submodule.

2016-01-24 14:35:40 +05:30

intersection.h

Intersection of documents across the search tokens.

2016-02-29 19:47:05 +05:30

matchscore.h

Fix memory corruption during unsorted append.

2016-06-04 19:05:47 +05:30

topster.h

Fix sorting - should be in ascending order.

2016-05-30 20:13:44 +05:30

util.h

Add 2 more external dependencies via git submodule.

2016-01-24 14:35:40 +05:30