Commit Graph

932 Commits

Author SHA1 Message Date
Clément Renault
9021b2dba6
Introduce the enable-chunk-fusing flag 2020-10-14 18:44:59 +02:00
Kerollmops
f980422c57
Move from oxidized-mtbl to grenad 2020-10-14 12:47:32 +02:00
Clément Renault
b342a86c15
Divide the max-memory parameter by the number of sorters in the store 2020-10-08 17:27:53 +02:00
Kerollmops
fb2c402ae1
Split the max-memory by the number of jobs 2020-10-07 14:23:22 +02:00
Kerollmops
38820bc75c
Improve and simplify the query tokenizer 2020-10-07 14:23:22 +02:00
Kerollmops
4e9bd1fef5
Bump oxidized-mtbl 2020-10-07 14:23:22 +02:00
Kerollmops
a00f5850ee
Add support for placeholder search for empty queries 2020-10-06 20:19:50 +02:00
Kerollmops
433d9bbc6e
Use CompressionType::from_str rather than a custom function 2020-10-06 13:50:34 +02:00
Kerollmops
4b819457c9
Enable the strucopt/clap warp help feature 2020-10-06 13:06:22 +02:00
Clément Renault
a2182e68a6
Rewrite the parallel merge indexing part 2020-10-05 20:54:06 +02:00
Kerollmops
e9e03259c1
Improve the mDFS performance and return the proximity 2020-10-05 18:13:56 +02:00
Kerollmops
bb15f16d8c
Merge other databases content while writing into LMDB at the same time 2020-10-05 16:35:10 +02:00
Clément Renault
9af946a306
Merging the main, word docids and words pairs proximity docids in parallel 2020-10-04 18:40:34 +02:00
Clément Renault
99705deb7d
Directly use a writer for the docid word positions 2020-10-04 18:17:53 +02:00
Clément Renault
67577a3760
It is an error to merge docid word positions 2020-10-04 17:31:12 +02:00
Clément Renault
ce8e56ee18
Rewrite the indexer to use one MTBL by database
This allows us to avoid prefixing keys and appending into LMDB databases
2020-10-04 17:04:33 +02:00
Clément Renault
770f29fd05
Bump the oxidized-mtbl dependency 2020-10-04 17:04:33 +02:00
Clément Renault
acd2a63879
Introduce a simple FST based chinese word segmenter 2020-10-04 17:04:33 +02:00
Clément Renault
6cc6addc2f
Increase the CboRoaringBitmapCodec threshold 2020-10-02 17:06:17 +02:00
Clément Renault
e41a3822a6
Add a simple test for the CboRoaringBitmapCodec 2020-10-02 16:52:36 +02:00
Clément Renault
c4b0c57059
Reduce the default indexer max-memory parameter 2020-10-02 16:47:41 +02:00
Kerollmops
007e647462
Introduce the Mdfs Iterator that explore the proximity graph using a mana DFS 2020-10-02 16:46:07 +02:00
Kerollmops
d4e80407e5
Introduce the mana depth first search algorithm 2020-10-02 16:46:07 +02:00
Kerollmops
f6a8096720
Rename the quartile as percentiles 25th, 50th and 75th 2020-10-02 16:46:07 +02:00
Kerollmops
891e0188dd
Introduce the database-stats infos subcommand 2020-10-02 16:46:07 +02:00
Kerollmops
079742b4d3
Clean up the stats and size of database infos subcommands 2020-10-02 16:46:06 +02:00
Kerollmops
d0c73564b1
Use the CboRoaringBitmapCodec for the word pair proximity docids 2020-10-02 16:46:06 +02:00
Kerollmops
5a6a698e1d
Introduce the CboRoaringBitmapCodec 2020-10-02 16:46:06 +02:00
Kerollmops
4eda149ffa
Rename the BoRoaringBitmap codec 2020-10-02 16:46:06 +02:00
Clément Renault
ac84db2506
Move the words pairs proximities average into the stats infos subcommand 2020-10-02 16:46:06 +02:00
Kerollmops
30755e31e7
Introduce the words pairs proximities stats info subcommand 2020-10-02 16:46:06 +02:00
Clément Renault
bc35c9a598
Introduce the size_of_database infos subcommand 2020-10-02 16:46:05 +02:00
Kerollmops
c6b883289c
Remove the unused fetch_keywords function 2020-09-30 15:41:23 +02:00
Kerollmops
58237bd67f
Introduce the average-number-of-document-by-word-pair-proximity infos subcommand 2020-09-29 18:32:48 +02:00
Kerollmops
991be8950e
Rename the subcommand into average-number-of-positions-by-word-by-doc 2020-09-29 18:15:44 +02:00
Kerollmops
54370e228a
Search for documents with longer proximities until we find enough 2020-09-29 17:37:14 +02:00
Kerollmops
f277ea134f
Simplify some search function by reducing the number of parameters 2020-09-29 16:08:58 +02:00
Kerollmops
68f4af7d2e
Improve the display of the number of processed documents 2020-09-29 16:08:58 +02:00
Kerollmops
59a127d022
Improve the indexing process
We now store the words pairs proximity in a cache and only compute the
shortest proximity between pairs of words in a document.
2020-09-29 15:09:18 +02:00
Kerollmops
6ddb3e722c
Depth-first search cache the docids unions 2020-09-28 16:55:21 +02:00
Kerollmops
a3821a0b33
Introduce the depth_first_search path resolution function 2020-09-28 16:34:12 +02:00
Kerollmops
51c237f9d8
Fix the benchmarks compilation 2020-09-28 13:39:17 +02:00
Clément Renault
d8354f6f02
Fix the word_docids capacity limit detection 2020-09-27 11:52:05 +02:00
Clément Renault
25b2853b70
Move the words pairs proximities compute into the write document function 2020-09-23 15:02:40 +02:00
Clément Renault
ed05999f63
Replace the arc cache by a simple linked hash map 2020-09-23 14:50:52 +02:00
Clément Renault
4d22d80281
Display only the key on heed error 2020-09-23 14:13:51 +02:00
Clément Renault
5178b3d59d
Make the search system be aware of query words typos 2020-09-23 12:01:39 +02:00
Clément Renault
b597a92487
Add a default max-memory value to the indexer 2020-09-23 12:00:36 +02:00
Clément Renault
1f6e00878d
Use the words pair proximities in the search algorithm 2020-09-22 18:47:55 +02:00
Clément Renault
31224a8425
Index the word pair proximities for both orders of the pair 2020-09-22 14:49:22 +02:00