Kishore Nallan c115c2c4a4 Use multi-key binary search to convert document IDs to corresponding indices. ...

Improved performance by 7x.

2017-02-07 22:42:58 +05:30

..

array_base.h

Refactor forarray - split into individual classes.

2017-02-04 16:27:07 +05:30

array.h

Refactor forarray - split into individual classes.

2017-02-04 16:27:07 +05:30

art.h

Refactor forarray - split into individual classes.

2017-02-04 16:27:07 +05:30

collection_manager.h

Fix ordering of sequence id rocksdb keys.

2017-02-04 21:32:24 +05:30

collection.h

Fix ordering of sequence id rocksdb keys.

2017-02-04 21:32:24 +05:30

exectime.h

Util for logging exec time.

2016-10-02 19:11:59 +05:30

field.h

Skeleton for filter support.

2017-02-02 09:20:06 +05:30

intersection.h

Intersection of documents across the search tokens.

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

json.hpp

Add JSON dep.

2016-08-23 20:31:11 +05:30

match_score.h

Refactor collection's search method to be more judicious in using higher costs.

2016-11-24 21:39:20 +05:30

sorted_array.h

Use multi-key binary search to convert document IDs to corresponding indices.

2017-02-07 22:42:58 +05:30

sparsepp.h

Added an ART search token cache.

2016-11-26 17:57:05 +05:30

store.h

Skeleton for filter support.

2017-02-02 09:20:06 +05:30

string_utils.h

Remove entry from rocksdb and art when required.

2016-10-05 21:24:40 +05:30

topster.h

Stable sort does not require key comparison.

2017-01-11 21:47:28 +05:30