Kerollmops
|
014a25697d
|
Use only one ARC cache based on the words
|
2020-07-01 12:03:18 +02:00 |
|
Kerollmops
|
fc4013a43f
|
Fix the ARC cache
|
2020-07-01 10:35:07 +02:00 |
|
Kerollmops
|
2fcae719ad
|
Use another LRU impl which uses hashbrown
|
2020-06-29 22:26:06 +02:00 |
|
Kerollmops
|
f98b615bf3
|
Replace the LRU by an Arc cache
|
2020-06-29 20:48:57 +02:00 |
|
Kerollmops
|
07abebfc46
|
Introduce a (too big) LRU cache
|
2020-06-29 18:15:03 +02:00 |
|
Kerollmops
|
5f0088594b
|
Index by writing directly into LMDB
|
2020-06-29 13:54:47 +02:00 |
|
Kerollmops
|
8453828a65
|
Update the README
|
2020-06-28 12:40:08 +02:00 |
|
Kerollmops
|
63cbeca64e
|
Skip all derived words when too short
|
2020-06-28 12:13:12 +02:00 |
|
Kerollmops
|
736f0f7560
|
Use the proximity instead of the attributes when searching for <= 7 proximities
|
2020-06-28 12:13:12 +02:00 |
|
Kerollmops
|
fe3be8f18a
|
Replace the HashMap by a Vec for attributes documents ids
|
2020-06-28 12:13:12 +02:00 |
|
Kerollmops
|
6a2834f2b0
|
Add a jobs parameter to set the number of threads the indexer uses
|
2020-06-28 12:13:10 +02:00 |
|
Kerollmops
|
7e16afbdce
|
Ignore documents which are not part of the candidates when exploring with A*
|
2020-06-24 15:06:45 +02:00 |
|
Kerollmops
|
1c7a9a4132
|
Remove the found documents from the candidates list
|
2020-06-24 15:00:26 +02:00 |
|
Kerollmops
|
50169b9798
|
Compute the full list of ids we are willing to find by attribute
|
2020-06-24 14:48:04 +02:00 |
|
Kerollmops
|
374ec6773f
|
Introduce a database to store all docids for a word and attribute
|
2020-06-22 19:24:20 +02:00 |
|
Kerollmops
|
a044cb6cc8
|
Clean up the warnings for prefix postings
|
2020-06-22 18:10:31 +02:00 |
|
Kerollmops
|
ba3e805981
|
Document the Index types and the internal LMDB databases
|
2020-06-22 18:09:22 +02:00 |
|
Kerollmops
|
2f0e1afd16
|
Introduce the roaring bitmap heed codec
|
2020-06-22 17:56:07 +02:00 |
|
Kerollmops
|
8148210860
|
Use the cache when retrieving the documents at the end
|
2020-06-21 12:25:19 +02:00 |
|
Kerollmops
|
1628a31efa
|
Cache the unions of the derived words positions
|
2020-06-20 15:38:10 +02:00 |
|
Kerollmops
|
115e0142d9
|
Add a feature flags to enable the export of stats
|
2020-06-20 13:25:42 +02:00 |
|
Kerollmops
|
beb49b24f6
|
Skip looking at connections for proximity 0
|
2020-06-20 13:19:03 +02:00 |
|
Kerollmops
|
c84012d655
|
Accept queries from standard input when not given as argument
|
2020-06-20 12:01:15 +02:00 |
|
Kerollmops
|
d6705d5529
|
Introduce the criterion dependency to bench the engine
|
2020-06-19 18:32:25 +02:00 |
|
Kerollmops
|
55a8941922
|
Optimize things
|
2020-06-19 17:48:17 +02:00 |
|
Kerollmops
|
a3ca80d20d
|
Ignore every proximities bigger or equal to 8
|
2020-06-18 15:42:46 +02:00 |
|
Kerollmops
|
3577de04b8
|
Reduce the number of KV lookups to the sucessfulls only
|
2020-06-16 12:58:29 +02:00 |
|
Kerollmops
|
e974e6b3c9
|
Acquire search intersections metrics
|
2020-06-16 12:10:23 +02:00 |
|
Kerollmops
|
8db16ff306
|
Add a cache to the contains_documents success function
|
2020-06-14 13:39:39 +02:00 |
|
Kerollmops
|
a8cda248b4
|
Introduce a customized A* algorithm.
This custom algo lazily compute the intersections between words, to avoid too much set operations and database reads
|
2020-06-14 12:51:57 +02:00 |
|
Kerollmops
|
69285b22d3
|
Check that an edges combination contains results
|
2020-06-13 11:16:02 +02:00 |
|
Kerollmops
|
b9cc6c10af
|
Introduce a function to ignore useless paths
|
2020-06-13 00:17:43 +02:00 |
|
Kerollmops
|
d02c5cb023
|
Fix node skipping by computing the accumulated proximity
|
2020-06-12 14:08:46 +02:00 |
|
Kerollmops
|
37a48489da
|
Reworked the best proximity algo a little bit
|
2020-06-12 12:53:08 +02:00 |
|
Kerollmops
|
302866ad73
|
Make the algo don't work with an astar
|
2020-06-11 17:43:06 +02:00 |
|
Kerollmops
|
0a83a86e65
|
Fix multiple bugs
|
2020-06-11 11:55:03 +02:00 |
|
Kerollmops
|
4e86ecf807
|
Retrieve the words before the intersect loops
|
2020-06-10 22:05:01 +02:00 |
|
Kerollmops
|
6ca3579cc0
|
Add more time debug measurements
|
2020-06-10 21:35:01 +02:00 |
|
Kerollmops
|
66a4b26811
|
Introduce a proximity based documents retriever
|
2020-06-10 16:54:28 +02:00 |
|
Kerollmops
|
78f27c0465
|
squash-me: Remove debugs
|
2020-06-10 16:29:46 +02:00 |
|
Kerollmops
|
3ad883d7c7
|
squash-me: Make the dijkstra work even with different attributes
|
2020-06-10 16:27:02 +02:00 |
|
Kerollmops
|
fecd8ca54a
|
squash-me: It works! we must remove the debug after having added more tests
|
2020-06-10 14:20:35 +02:00 |
|
Kerollmops
|
13977d9338
|
squash-me
|
2020-06-09 23:06:59 +02:00 |
|
Kerollmops
|
5d5b827f1a
|
Squash-me
|
2020-06-09 17:32:25 +02:00 |
|
Kerollmops
|
2a6d6a7f69
|
Introduce a first draft of the best_proximity algorithm
|
2020-06-09 10:11:43 +02:00 |
|
Kerollmops
|
dfdaceb410
|
Introduce a first basic working positions-based engine
|
2020-06-05 20:13:19 +02:00 |
|
Kerollmops
|
f51a63e4ef
|
Store documents ids under attribute ids
|
2020-06-05 16:32:14 +02:00 |
|
Kerollmops
|
ce86a43779
|
Make the query tokenizer a real Iterator
|
2020-06-05 09:49:28 +02:00 |
|
Kerollmops
|
f55f4cb02a
|
Not fetch the cached prefix postings when prefix is disabled
|
2020-06-04 21:22:45 +02:00 |
|
Kerollmops
|
06bf03f075
|
Add an help message on the front page
aaa
|
2020-06-04 21:22:45 +02:00 |
|