mirror of
https://github.com/meilisearch/MeiliSearch
synced 2024-12-11 22:06:30 +01:00
Compute word_fid_docids before word_docids and exact_word_docids
This commit is contained in:
parent
f36c36e368
commit
50ba751244
@ -3,14 +3,16 @@ use std::fs::File;
|
|||||||
use std::io;
|
use std::io;
|
||||||
use std::iter::FromIterator;
|
use std::iter::FromIterator;
|
||||||
|
|
||||||
|
use heed::BytesDecode;
|
||||||
use obkv::KvReaderU16;
|
use obkv::KvReaderU16;
|
||||||
use roaring::RoaringBitmap;
|
use roaring::RoaringBitmap;
|
||||||
|
|
||||||
use super::helpers::{
|
use super::helpers::{
|
||||||
create_sorter, merge_cbo_roaring_bitmaps, merge_roaring_bitmaps, serialize_roaring_bitmap,
|
create_sorter, create_writer, merge_roaring_bitmaps, serialize_roaring_bitmap,
|
||||||
sorter_into_reader, try_split_array_at, GrenadParameters,
|
sorter_into_reader, try_split_array_at, writer_into_reader, GrenadParameters,
|
||||||
};
|
};
|
||||||
use crate::error::SerializationError;
|
use crate::error::SerializationError;
|
||||||
|
use crate::heed_codec::StrBEU16Codec;
|
||||||
use crate::index::db_name::DOCID_WORD_POSITIONS;
|
use crate::index::db_name::DOCID_WORD_POSITIONS;
|
||||||
use crate::update::MergeFn;
|
use crate::update::MergeFn;
|
||||||
use crate::{DocumentId, FieldId, Result};
|
use crate::{DocumentId, FieldId, Result};
|
||||||
@ -32,6 +34,59 @@ pub fn extract_word_docids<R: io::Read + io::Seek>(
|
|||||||
|
|
||||||
let max_memory = indexer.max_memory_by_thread();
|
let max_memory = indexer.max_memory_by_thread();
|
||||||
|
|
||||||
|
let mut word_fid_docids_sorter = create_sorter(
|
||||||
|
grenad::SortAlgorithm::Unstable,
|
||||||
|
merge_roaring_bitmaps,
|
||||||
|
indexer.chunk_compression_type,
|
||||||
|
indexer.chunk_compression_level,
|
||||||
|
indexer.max_nb_chunks,
|
||||||
|
max_memory.map(|x| x / 3),
|
||||||
|
);
|
||||||
|
|
||||||
|
let mut current_document_id = None;
|
||||||
|
let mut fid = 0;
|
||||||
|
let mut key_buffer = Vec::new();
|
||||||
|
let mut value_buffer = Vec::new();
|
||||||
|
let mut words = BTreeSet::new();
|
||||||
|
let mut cursor = docid_word_positions.into_cursor()?;
|
||||||
|
while let Some((key, value)) = cursor.move_on_next()? {
|
||||||
|
let (document_id_bytes, fid_bytes) = try_split_array_at(key)
|
||||||
|
.ok_or(SerializationError::Decoding { db_name: Some(DOCID_WORD_POSITIONS) })?;
|
||||||
|
let (fid_bytes, _) = try_split_array_at(fid_bytes)
|
||||||
|
.ok_or(SerializationError::Decoding { db_name: Some(DOCID_WORD_POSITIONS) })?;
|
||||||
|
let document_id = u32::from_be_bytes(document_id_bytes);
|
||||||
|
fid = u16::from_be_bytes(fid_bytes);
|
||||||
|
|
||||||
|
// drain the btreemaps when we change document.
|
||||||
|
if current_document_id.map_or(false, |id| id != document_id) {
|
||||||
|
words_into_sorter(
|
||||||
|
document_id,
|
||||||
|
fid,
|
||||||
|
&mut key_buffer,
|
||||||
|
&mut value_buffer,
|
||||||
|
&mut words,
|
||||||
|
&mut word_fid_docids_sorter,
|
||||||
|
)?;
|
||||||
|
}
|
||||||
|
|
||||||
|
current_document_id = Some(document_id);
|
||||||
|
for (_pos, word) in KvReaderU16::new(&value).iter() {
|
||||||
|
words.insert(word.to_vec());
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// We must make sure that don't lose the current document field id
|
||||||
|
if let Some(document_id) = current_document_id {
|
||||||
|
words_into_sorter(
|
||||||
|
document_id,
|
||||||
|
fid,
|
||||||
|
&mut key_buffer,
|
||||||
|
&mut value_buffer,
|
||||||
|
&mut words,
|
||||||
|
&mut word_fid_docids_sorter,
|
||||||
|
)?;
|
||||||
|
}
|
||||||
|
|
||||||
let mut word_docids_sorter = create_sorter(
|
let mut word_docids_sorter = create_sorter(
|
||||||
grenad::SortAlgorithm::Unstable,
|
grenad::SortAlgorithm::Unstable,
|
||||||
merge_roaring_bitmaps,
|
merge_roaring_bitmaps,
|
||||||
@ -50,104 +105,47 @@ pub fn extract_word_docids<R: io::Read + io::Seek>(
|
|||||||
max_memory.map(|x| x / 3),
|
max_memory.map(|x| x / 3),
|
||||||
);
|
);
|
||||||
|
|
||||||
let mut word_fid_docids_sorter = create_sorter(
|
let mut word_fid_docids_writer = create_writer(
|
||||||
grenad::SortAlgorithm::Unstable,
|
|
||||||
merge_roaring_bitmaps,
|
|
||||||
indexer.chunk_compression_type,
|
indexer.chunk_compression_type,
|
||||||
indexer.chunk_compression_level,
|
indexer.chunk_compression_level,
|
||||||
indexer.max_nb_chunks,
|
tempfile::tempfile()?,
|
||||||
max_memory.map(|x| x / 3),
|
|
||||||
);
|
);
|
||||||
|
|
||||||
let mut current_document_id = None;
|
let mut iter = word_fid_docids_sorter.into_stream_merger_iter()?;
|
||||||
let mut fid = 0;
|
while let Some((key, value)) = iter.next()? {
|
||||||
let mut key_buffer = Vec::new();
|
word_fid_docids_writer.insert(key, value)?;
|
||||||
let mut value_buffer = Vec::new();
|
|
||||||
let mut words = BTreeSet::new();
|
|
||||||
let mut exact_words = BTreeSet::new();
|
|
||||||
let mut cursor = docid_word_positions.into_cursor()?;
|
|
||||||
while let Some((key, value)) = cursor.move_on_next()? {
|
|
||||||
let (document_id_bytes, fid_bytes) = try_split_array_at(key)
|
|
||||||
.ok_or(SerializationError::Decoding { db_name: Some(DOCID_WORD_POSITIONS) })?;
|
|
||||||
let (fid_bytes, _) = try_split_array_at(fid_bytes)
|
|
||||||
.ok_or(SerializationError::Decoding { db_name: Some(DOCID_WORD_POSITIONS) })?;
|
|
||||||
let document_id = u32::from_be_bytes(document_id_bytes);
|
|
||||||
fid = u16::from_be_bytes(fid_bytes);
|
|
||||||
|
|
||||||
// drain the btreemaps when we change document.
|
let (word, fid) = StrBEU16Codec::bytes_decode(key)
|
||||||
if current_document_id.map_or(false, |id| id != document_id) {
|
.ok_or(SerializationError::Decoding { db_name: Some(DOCID_WORD_POSITIONS) })?;
|
||||||
words_into_sorters(
|
|
||||||
document_id,
|
|
||||||
fid,
|
|
||||||
&mut key_buffer,
|
|
||||||
&mut value_buffer,
|
|
||||||
&mut exact_words,
|
|
||||||
&mut words,
|
|
||||||
&mut exact_word_docids_sorter,
|
|
||||||
&mut word_docids_sorter,
|
|
||||||
&mut word_fid_docids_sorter,
|
|
||||||
)?;
|
|
||||||
}
|
|
||||||
|
|
||||||
current_document_id = Some(document_id);
|
|
||||||
|
|
||||||
// every words contained in an attribute set to exact must be pushed in the exact_words list.
|
// every words contained in an attribute set to exact must be pushed in the exact_words list.
|
||||||
if exact_attributes.contains(&fid) {
|
if exact_attributes.contains(&fid) {
|
||||||
for (_pos, word) in KvReaderU16::new(&value).iter() {
|
exact_word_docids_sorter.insert(word.as_bytes(), &value)?;
|
||||||
exact_words.insert(word.to_vec());
|
|
||||||
}
|
|
||||||
} else {
|
} else {
|
||||||
for (_pos, word) in KvReaderU16::new(&value).iter() {
|
word_docids_sorter.insert(word.as_bytes(), &value)?;
|
||||||
words.insert(word.to_vec());
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// We must make sure that don't lose the current document field id
|
|
||||||
if let Some(document_id) = current_document_id {
|
|
||||||
words_into_sorters(
|
|
||||||
document_id,
|
|
||||||
fid,
|
|
||||||
&mut key_buffer,
|
|
||||||
&mut value_buffer,
|
|
||||||
&mut exact_words,
|
|
||||||
&mut words,
|
|
||||||
&mut exact_word_docids_sorter,
|
|
||||||
&mut word_docids_sorter,
|
|
||||||
&mut word_fid_docids_sorter,
|
|
||||||
)?;
|
|
||||||
}
|
|
||||||
|
|
||||||
Ok((
|
Ok((
|
||||||
sorter_into_reader(word_docids_sorter, indexer)?,
|
sorter_into_reader(word_docids_sorter, indexer)?,
|
||||||
sorter_into_reader(exact_word_docids_sorter, indexer)?,
|
sorter_into_reader(exact_word_docids_sorter, indexer)?,
|
||||||
sorter_into_reader(word_fid_docids_sorter, indexer)?,
|
writer_into_reader(word_fid_docids_writer)?,
|
||||||
))
|
))
|
||||||
}
|
}
|
||||||
|
|
||||||
fn words_into_sorters(
|
fn words_into_sorter(
|
||||||
document_id: DocumentId,
|
document_id: DocumentId,
|
||||||
fid: FieldId,
|
fid: FieldId,
|
||||||
key_buffer: &mut Vec<u8>,
|
key_buffer: &mut Vec<u8>,
|
||||||
value_buffer: &mut Vec<u8>,
|
value_buffer: &mut Vec<u8>,
|
||||||
exact_words: &mut BTreeSet<Vec<u8>>,
|
|
||||||
words: &mut BTreeSet<Vec<u8>>,
|
words: &mut BTreeSet<Vec<u8>>,
|
||||||
exact_word_docids_sorter: &mut grenad::Sorter<MergeFn>,
|
|
||||||
word_docids_sorter: &mut grenad::Sorter<MergeFn>,
|
|
||||||
word_fid_docids_sorter: &mut grenad::Sorter<MergeFn>,
|
word_fid_docids_sorter: &mut grenad::Sorter<MergeFn>,
|
||||||
) -> Result<()> {
|
) -> Result<()> {
|
||||||
puffin::profile_function!();
|
puffin::profile_function!();
|
||||||
let bitmap = RoaringBitmap::from_iter(Some(document_id));
|
let bitmap = RoaringBitmap::from_iter(Some(document_id));
|
||||||
serialize_roaring_bitmap(&bitmap, value_buffer)?;
|
serialize_roaring_bitmap(&bitmap, value_buffer)?;
|
||||||
for word_bytes in exact_words.iter() {
|
|
||||||
exact_word_docids_sorter.insert(word_bytes, &mut *value_buffer)?;
|
|
||||||
}
|
|
||||||
|
|
||||||
for word_bytes in words.iter() {
|
for word_bytes in words.iter() {
|
||||||
word_docids_sorter.insert(word_bytes, &value_buffer)?;
|
|
||||||
}
|
|
||||||
|
|
||||||
for word_bytes in (&*words | &*exact_words).iter() {
|
|
||||||
key_buffer.clear();
|
key_buffer.clear();
|
||||||
key_buffer.extend_from_slice(&word_bytes);
|
key_buffer.extend_from_slice(&word_bytes);
|
||||||
key_buffer.push(0);
|
key_buffer.push(0);
|
||||||
@ -155,7 +153,6 @@ fn words_into_sorters(
|
|||||||
word_fid_docids_sorter.insert(&key_buffer, &value_buffer)?;
|
word_fid_docids_sorter.insert(&key_buffer, &value_buffer)?;
|
||||||
}
|
}
|
||||||
|
|
||||||
exact_words.clear();
|
|
||||||
words.clear();
|
words.clear();
|
||||||
|
|
||||||
Ok(())
|
Ok(())
|
||||||
|
Loading…
Reference in New Issue
Block a user