f613f4f2df
This was caused by a bug in the binary search algorithm causing it to sometimes return positive values when encoding a search miss. It was also necessary to get rid of the vestiges of the old LongArray and IntArray classes to make this fix doable. |
||
|---|---|---|
| .. | ||
| domain-ranking | ||
| index-forward | ||
| index-journal | ||
| index-query | ||
| index-reverse | ||
| result-ranking | ||
| readme.md | ||
Index
These are components that offer functionality for the index-service.
Indexes
There are two indexes with accompanying tools for constructing them.
-
index-reverse is code for
word->documentindexes. There are two such indexes, one containing only document-word pairs that are flagged as important, e.g. the word appears in the title or has a high TF-IDF. This allows good results to be discovered quickly without having to sift through ten thousand bad ones first. -
index-forward is the
document->wordindex containing metadata about each word, such as its position. It is used after identifying candidate search results via the reverse index to fetch metadata and rank the results.
These indices rely heavily on the libraries/btree and libraries/array components.
Algorithms
- domain-ranking contains domain ranking algorithms.
- result-ranking contains logic for ranking search results by relevance.
Libraries
- index-query contains structures for evaluating search queries.
- index-journal contains tools for writing and reading index data.