Loïc Lecrenier
|
345c99d5bd
|
Introduce the words ranking rule working with the new search structures
|
2023-03-20 09:41:55 +01:00 |
|
Loïc Lecrenier
|
89d696c1e3
|
Introduce the proximity ranking rule as a graph-based ranking rule
|
2023-03-20 09:41:55 +01:00 |
|
Loïc Lecrenier
|
c645853529
|
Introduce a generic graph-based ranking rule
|
2023-03-20 09:41:55 +01:00 |
|
Loïc Lecrenier
|
a70ab8b072
|
Introduce a function to find the K shortest paths in a graph
|
2023-03-20 09:41:55 +01:00 |
|
Loïc Lecrenier
|
48aae76b15
|
Introduce a function to find the docids of a set of paths in a graph
|
2023-03-20 09:41:55 +01:00 |
|
Loïc Lecrenier
|
23bf572dea
|
Introduce cache structures used with ranking rule graphs
|
2023-03-20 09:41:55 +01:00 |
|
Loïc Lecrenier
|
864f6410ed
|
Introduce a structure to represent a set of graph paths efficiently
|
2023-03-20 09:41:55 +01:00 |
|
Loïc Lecrenier
|
c9bf6bb2fa
|
Introduce a structure to implement ranking rules with graph algorithms
|
2023-03-20 09:41:55 +01:00 |
|
Loïc Lecrenier
|
46249ea901
|
Implement a function to find a QueryGraph's docids
|
2023-03-20 09:41:55 +01:00 |
|
Loïc Lecrenier
|
ce0d1e0e13
|
Introduce a common way to manage the coordination between ranking rules
|
2023-03-20 09:41:55 +01:00 |
|
Loïc Lecrenier
|
5065d8b0c1
|
Introduce a DatabaseCache to memorize the addresses of LMDB values
|
2023-03-20 09:41:55 +01:00 |
|
Loïc Lecrenier
|
a83007c013
|
Introduce structure to represent search queries as graphs
|
2023-03-20 09:41:55 +01:00 |
|
Loïc Lecrenier
|
79e0a6dd4e
|
Introduce a new search module, eventually meant to replace the old one
The code here does not compile, because I am merely splitting one giant
commit into smaller ones where each commit explains a single file.
|
2023-03-20 09:41:55 +01:00 |
|