MeiliSearch/milli/src/update/index_documents/extract/extract_word_docids.rs

246 lines
8.7 KiB
Rust
Raw Normal View History

use std::collections::BTreeSet;
2021-08-16 13:36:30 +02:00
use std::fs::File;
use std::io::{self, BufReader};
2021-08-16 13:36:30 +02:00
use heed::{BytesDecode, BytesEncode};
2023-09-18 09:59:38 +02:00
use obkv::KvReaderU16;
use roaring::RoaringBitmap;
2021-08-16 13:36:30 +02:00
use super::helpers::{
create_sorter, create_writer, merge_deladd_cbo_roaring_bitmaps, try_split_array_at,
writer_into_reader, GrenadParameters,
2021-08-16 13:36:30 +02:00
};
2021-09-02 15:17:52 +02:00
use crate::error::SerializationError;
use crate::heed_codec::StrBEU16Codec;
2021-09-02 15:17:52 +02:00
use crate::index::db_name::DOCID_WORD_POSITIONS;
2023-10-19 11:58:31 +02:00
use crate::update::del_add::{is_noop_del_add_obkv, DelAdd, KvReaderDelAdd, KvWriterDelAdd};
use crate::update::index_documents::helpers::sorter_into_reader;
use crate::update::settings::InnerIndexSettingsDiff;
2023-09-18 09:59:38 +02:00
use crate::update::MergeFn;
use crate::{CboRoaringBitmapCodec, DocumentId, FieldId, Result};
2021-08-16 13:36:30 +02:00
/// Extracts the word and the documents ids where this word appear.
///
/// Returns a grenad reader with the list of extracted words and
/// documents ids from the given chunk of docid word positions.
2022-03-24 15:22:57 +01:00
///
2022-04-04 20:59:20 +02:00
/// The first returned reader is the one for normal word_docids, and the second one is for
2022-03-24 15:22:57 +01:00
/// exact_word_docids
2024-01-23 09:42:48 +01:00
#[tracing::instrument(level = "trace", skip_all, target = "indexing::extract")]
2022-02-16 15:28:48 +01:00
pub fn extract_word_docids<R: io::Read + io::Seek>(
docid_word_positions: grenad::Reader<R>,
2021-08-16 13:36:30 +02:00
indexer: GrenadParameters,
settings_diff: &InnerIndexSettingsDiff,
2023-09-18 09:59:38 +02:00
) -> Result<(
grenad::Reader<BufReader<File>>,
grenad::Reader<BufReader<File>>,
grenad::Reader<BufReader<File>>,
)> {
puffin::profile_function!();
2021-08-16 13:36:30 +02:00
let max_memory = indexer.max_memory_by_thread();
2023-09-18 09:59:38 +02:00
let mut word_fid_docids_sorter = create_sorter(
grenad::SortAlgorithm::Unstable,
2023-10-19 11:58:31 +02:00
merge_deladd_cbo_roaring_bitmaps,
2023-09-18 09:59:38 +02:00
indexer.chunk_compression_type,
indexer.chunk_compression_level,
indexer.max_nb_chunks,
max_memory.map(|m| m / 3),
2023-09-18 09:59:38 +02:00
);
let mut key_buffer = Vec::new();
2023-10-19 11:58:31 +02:00
let mut del_words = BTreeSet::new();
let mut add_words = BTreeSet::new();
2022-02-16 15:28:48 +01:00
let mut cursor = docid_word_positions.into_cursor()?;
2023-09-18 09:59:38 +02:00
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) })?;
2023-09-19 18:29:21 +02:00
let (fid_bytes, _) = try_split_array_at(fid_bytes)
.ok_or(SerializationError::Decoding { db_name: Some(DOCID_WORD_POSITIONS) })?;
2021-08-16 13:36:30 +02:00
let document_id = u32::from_be_bytes(document_id_bytes);
let fid = u16::from_be_bytes(fid_bytes);
2021-08-16 13:36:30 +02:00
2023-11-06 11:19:31 +01:00
let del_add_reader = KvReaderDelAdd::new(value);
2023-10-19 11:58:31 +02:00
// extract all unique words to remove.
if let Some(deletion) = del_add_reader.get(DelAdd::Deletion) {
2023-11-06 11:19:31 +01:00
for (_pos, word) in KvReaderU16::new(deletion).iter() {
2023-10-19 11:58:31 +02:00
del_words.insert(word.to_vec());
}
}
// extract all unique additional words.
if let Some(addition) = del_add_reader.get(DelAdd::Addition) {
2023-11-06 11:19:31 +01:00
for (_pos, word) in KvReaderU16::new(addition).iter() {
2023-10-19 11:58:31 +02:00
add_words.insert(word.to_vec());
}
2022-03-24 17:00:29 +01:00
}
2021-08-16 13:36:30 +02:00
words_into_sorter(
2023-09-18 09:59:38 +02:00
document_id,
fid,
&mut key_buffer,
2023-10-19 11:58:31 +02:00
&del_words,
&add_words,
2023-09-18 09:59:38 +02:00
&mut word_fid_docids_sorter,
)?;
2023-10-19 11:58:31 +02:00
del_words.clear();
add_words.clear();
2023-09-18 09:59:38 +02:00
}
let mut word_fid_docids_writer = create_writer(
indexer.chunk_compression_type,
indexer.chunk_compression_level,
tempfile::tempfile()?,
);
let mut word_docids_sorter = create_sorter(
grenad::SortAlgorithm::Unstable,
merge_deladd_cbo_roaring_bitmaps,
indexer.chunk_compression_type,
indexer.chunk_compression_level,
indexer.max_nb_chunks,
max_memory.map(|m| m / 3),
);
let mut exact_word_docids_sorter = create_sorter(
grenad::SortAlgorithm::Unstable,
merge_deladd_cbo_roaring_bitmaps,
indexer.chunk_compression_type,
indexer.chunk_compression_level,
indexer.max_nb_chunks,
max_memory.map(|m| m / 3),
);
let mut iter = word_fid_docids_sorter.into_stream_merger_iter()?;
let mut buffer = Vec::new();
// NOTE: replacing sorters by bitmap merging is less efficient, so, use sorters.
while let Some((key, value)) = iter.next()? {
2023-10-19 11:58:31 +02:00
// only keep the value if their is a change to apply in the DB.
if !is_noop_del_add_obkv(KvReaderDelAdd::new(value)) {
word_fid_docids_writer.insert(key, value)?;
}
let (w, fid) = StrBEU16Codec::bytes_decode(key)
.map_err(|_| SerializationError::Decoding { db_name: Some(DOCID_WORD_POSITIONS) })?;
// merge all deletions
let obkv = KvReaderDelAdd::new(value);
if let Some(value) = obkv.get(DelAdd::Deletion) {
let delete_from_exact = settings_diff.old.exact_attributes.contains(&fid);
buffer.clear();
let mut obkv = KvWriterDelAdd::new(&mut buffer);
obkv.insert(DelAdd::Deletion, value)?;
if delete_from_exact {
exact_word_docids_sorter.insert(w, obkv.into_inner().unwrap())?;
} else {
word_docids_sorter.insert(w, obkv.into_inner().unwrap())?;
}
}
// merge all additions
if let Some(value) = obkv.get(DelAdd::Addition) {
let add_in_exact = settings_diff.new.exact_attributes.contains(&fid);
buffer.clear();
let mut obkv = KvWriterDelAdd::new(&mut buffer);
obkv.insert(DelAdd::Addition, value)?;
if add_in_exact {
exact_word_docids_sorter.insert(w, obkv.into_inner().unwrap())?;
} else {
word_docids_sorter.insert(w, obkv.into_inner().unwrap())?;
}
}
}
2022-03-24 15:22:57 +01:00
Ok((
sorter_into_reader(word_docids_sorter, indexer)?,
sorter_into_reader(exact_word_docids_sorter, indexer)?,
writer_into_reader(word_fid_docids_writer)?,
2022-03-24 15:22:57 +01:00
))
2021-08-16 13:36:30 +02:00
}
2023-09-18 09:59:38 +02:00
2024-01-23 09:42:48 +01:00
#[tracing::instrument(level = "trace", skip_all, target = "indexing::extract")]
fn words_into_sorter(
2023-09-18 09:59:38 +02:00
document_id: DocumentId,
fid: FieldId,
key_buffer: &mut Vec<u8>,
2023-10-19 11:58:31 +02:00
del_words: &BTreeSet<Vec<u8>>,
add_words: &BTreeSet<Vec<u8>>,
2023-09-18 09:59:38 +02:00
word_fid_docids_sorter: &mut grenad::Sorter<MergeFn>,
) -> Result<()> {
puffin::profile_function!();
2023-10-19 11:58:31 +02:00
use itertools::merge_join_by;
use itertools::EitherOrBoth::{Both, Left, Right};
let mut buffer = Vec::new();
for eob in merge_join_by(del_words.iter(), add_words.iter(), |d, a| d.cmp(a)) {
buffer.clear();
let mut value_writer = KvWriterDelAdd::new(&mut buffer);
let word_bytes = match eob {
Left(word_bytes) => {
value_writer.insert(DelAdd::Deletion, document_id.to_ne_bytes()).unwrap();
word_bytes
}
Right(word_bytes) => {
value_writer.insert(DelAdd::Addition, document_id.to_ne_bytes()).unwrap();
word_bytes
}
Both(word_bytes, _) => {
value_writer.insert(DelAdd::Deletion, document_id.to_ne_bytes()).unwrap();
value_writer.insert(DelAdd::Addition, document_id.to_ne_bytes()).unwrap();
word_bytes
}
};
2023-09-18 09:59:38 +02:00
key_buffer.clear();
2023-11-06 11:19:31 +01:00
key_buffer.extend_from_slice(word_bytes);
2023-09-18 09:59:38 +02:00
key_buffer.push(0);
key_buffer.extend_from_slice(&fid.to_be_bytes());
2023-10-19 11:58:31 +02:00
word_fid_docids_sorter.insert(&key_buffer, value_writer.into_inner().unwrap())?;
2023-09-18 09:59:38 +02:00
}
Ok(())
}
#[tracing::instrument(level = "trace", skip_all, target = "indexing::extract")]
fn docids_into_writers<W>(
word: &str,
deletions: &RoaringBitmap,
additions: &RoaringBitmap,
writer: &mut grenad::Writer<W>,
) -> Result<()>
where
W: std::io::Write,
{
if deletions == additions {
// if the same value is deleted and added, do nothing.
return Ok(());
}
// Write each value in the same KvDelAdd before inserting it in the final writer.
let mut obkv = KvWriterDelAdd::memory();
// deletions:
if !deletions.is_empty() && !deletions.is_subset(additions) {
obkv.insert(
DelAdd::Deletion,
CboRoaringBitmapCodec::bytes_encode(deletions).map_err(|_| {
SerializationError::Encoding { db_name: Some(DOCID_WORD_POSITIONS) }
})?,
2024-04-03 11:19:45 +02:00
)?;
}
// additions:
if !additions.is_empty() {
obkv.insert(
DelAdd::Addition,
CboRoaringBitmapCodec::bytes_encode(additions).map_err(|_| {
SerializationError::Encoding { db_name: Some(DOCID_WORD_POSITIONS) }
})?,
2024-04-03 11:19:45 +02:00
)?;
}
// insert everything in the same writer.
writer.insert(word.as_bytes(), obkv.into_inner().unwrap())?;
Ok(())
}