mirror of
https://github.com/meilisearch/meilisearch.git
synced 2024-11-23 10:37:41 +08:00
Reintroduce searchable attributes and reordering
This commit is contained in:
parent
a4dd033ccf
commit
40c0b14d1c
@ -33,6 +33,7 @@ pub fn bucket_sort<'c, FI>(
|
|||||||
range: Range<usize>,
|
range: Range<usize>,
|
||||||
filter: Option<FI>,
|
filter: Option<FI>,
|
||||||
criteria: Criteria<'c>,
|
criteria: Criteria<'c>,
|
||||||
|
searchable_attrs: Option<ReorderedAttrs>,
|
||||||
main_store: store::Main,
|
main_store: store::Main,
|
||||||
postings_lists_store: store::PostingsLists,
|
postings_lists_store: store::PostingsLists,
|
||||||
documents_fields_counts_store: store::DocumentsFieldsCounts,
|
documents_fields_counts_store: store::DocumentsFieldsCounts,
|
||||||
@ -54,6 +55,7 @@ where
|
|||||||
distinct,
|
distinct,
|
||||||
distinct_size,
|
distinct_size,
|
||||||
criteria,
|
criteria,
|
||||||
|
searchable_attrs,
|
||||||
main_store,
|
main_store,
|
||||||
postings_lists_store,
|
postings_lists_store,
|
||||||
documents_fields_counts_store,
|
documents_fields_counts_store,
|
||||||
@ -84,7 +86,7 @@ where
|
|||||||
let mut raw_documents = Vec::new();
|
let mut raw_documents = Vec::new();
|
||||||
for bare_matches in bare_matches.linear_group_by_key_mut(|sm| sm.document_id) {
|
for bare_matches in bare_matches.linear_group_by_key_mut(|sm| sm.document_id) {
|
||||||
prefiltered_documents += 1;
|
prefiltered_documents += 1;
|
||||||
if let Some(raw_document) = RawDocument::new(bare_matches, &automatons, &mut arena) {
|
if let Some(raw_document) = RawDocument::new(bare_matches, &automatons, &mut arena, searchable_attrs.as_ref()) {
|
||||||
raw_documents.push(raw_document);
|
raw_documents.push(raw_document);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@ -140,7 +142,7 @@ where
|
|||||||
}
|
}
|
||||||
|
|
||||||
let iter = raw_documents.into_iter().skip(range.start).take(range.len());
|
let iter = raw_documents.into_iter().skip(range.start).take(range.len());
|
||||||
let iter = iter.map(|rd| Document::from_raw(rd, &automatons, &arena));
|
let iter = iter.map(|rd| Document::from_raw(rd, &automatons, &arena, searchable_attrs.as_ref()));
|
||||||
|
|
||||||
Ok(iter.collect())
|
Ok(iter.collect())
|
||||||
}
|
}
|
||||||
@ -153,6 +155,7 @@ pub fn bucket_sort_with_distinct<'c, FI, FD>(
|
|||||||
distinct: FD,
|
distinct: FD,
|
||||||
distinct_size: usize,
|
distinct_size: usize,
|
||||||
criteria: Criteria<'c>,
|
criteria: Criteria<'c>,
|
||||||
|
searchable_attrs: Option<ReorderedAttrs>,
|
||||||
main_store: store::Main,
|
main_store: store::Main,
|
||||||
postings_lists_store: store::PostingsLists,
|
postings_lists_store: store::PostingsLists,
|
||||||
documents_fields_counts_store: store::DocumentsFieldsCounts,
|
documents_fields_counts_store: store::DocumentsFieldsCounts,
|
||||||
@ -182,7 +185,7 @@ where
|
|||||||
let mut raw_documents = Vec::new();
|
let mut raw_documents = Vec::new();
|
||||||
for bare_matches in bare_matches.linear_group_by_key_mut(|sm| sm.document_id) {
|
for bare_matches in bare_matches.linear_group_by_key_mut(|sm| sm.document_id) {
|
||||||
prefiltered_documents += 1;
|
prefiltered_documents += 1;
|
||||||
if let Some(raw_document) = RawDocument::new(bare_matches, &automatons, &mut arena) {
|
if let Some(raw_document) = RawDocument::new(bare_matches, &automatons, &mut arena, searchable_attrs.as_ref()) {
|
||||||
raw_documents.push(raw_document);
|
raw_documents.push(raw_document);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@ -303,7 +306,7 @@ where
|
|||||||
};
|
};
|
||||||
|
|
||||||
if distinct_accepted && seen.len() > range.start {
|
if distinct_accepted && seen.len() > range.start {
|
||||||
documents.push(Document::from_raw(raw_document, &automatons, &arena));
|
documents.push(Document::from_raw(raw_document, &automatons, &arena, searchable_attrs.as_ref()));
|
||||||
if documents.len() == range.len() {
|
if documents.len() == range.len() {
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
|
@ -31,6 +31,7 @@ pub use meilisearch_types::{DocIndex, DocumentId, Highlight};
|
|||||||
use compact_arena::SmallArena;
|
use compact_arena::SmallArena;
|
||||||
use crate::bucket_sort::{QueryWordAutomaton, PostingsListView};
|
use crate::bucket_sort::{QueryWordAutomaton, PostingsListView};
|
||||||
use crate::levenshtein::prefix_damerau_levenshtein;
|
use crate::levenshtein::prefix_damerau_levenshtein;
|
||||||
|
use crate::reordered_attrs::ReorderedAttrs;
|
||||||
|
|
||||||
#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord)]
|
#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord)]
|
||||||
pub struct Document {
|
pub struct Document {
|
||||||
@ -41,42 +42,91 @@ pub struct Document {
|
|||||||
pub matches: Vec<crate::bucket_sort::SimpleMatch>,
|
pub matches: Vec<crate::bucket_sort::SimpleMatch>,
|
||||||
}
|
}
|
||||||
|
|
||||||
|
fn highlights_from_raw_document<'a, 'tag, 'txn>(
|
||||||
|
raw_document: &RawDocument<'a, 'tag>,
|
||||||
|
automatons: &[QueryWordAutomaton],
|
||||||
|
arena: &SmallArena<'tag, PostingsListView<'txn>>,
|
||||||
|
searchable_attrs: Option<&ReorderedAttrs>,
|
||||||
|
) -> Vec<Highlight>
|
||||||
|
{
|
||||||
|
let mut highlights = Vec::new();
|
||||||
|
|
||||||
|
for bm in raw_document.bare_matches.iter() {
|
||||||
|
let postings_list = &arena[bm.postings_list];
|
||||||
|
let input = postings_list.input();
|
||||||
|
let query = &automatons[bm.query_index as usize].query;
|
||||||
|
|
||||||
|
for di in postings_list.iter() {
|
||||||
|
let covered_area = if query.len() > input.len() {
|
||||||
|
input.len()
|
||||||
|
} else {
|
||||||
|
prefix_damerau_levenshtein(query.as_bytes(), input).1
|
||||||
|
};
|
||||||
|
|
||||||
|
let attribute = searchable_attrs
|
||||||
|
.and_then(|sa| sa.reverse(di.attribute))
|
||||||
|
.unwrap_or(di.attribute);
|
||||||
|
|
||||||
|
let highlight = Highlight {
|
||||||
|
attribute: attribute,
|
||||||
|
char_index: di.char_index,
|
||||||
|
char_length: covered_area as u16,
|
||||||
|
};
|
||||||
|
|
||||||
|
highlights.push(highlight);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
highlights
|
||||||
|
}
|
||||||
|
|
||||||
impl Document {
|
impl Document {
|
||||||
|
#[cfg(not(test))]
|
||||||
pub fn from_raw<'a, 'tag, 'txn>(
|
pub fn from_raw<'a, 'tag, 'txn>(
|
||||||
raw_document: RawDocument<'a, 'tag>,
|
raw_document: RawDocument<'a, 'tag>,
|
||||||
automatons: &[QueryWordAutomaton],
|
automatons: &[QueryWordAutomaton],
|
||||||
arena: &SmallArena<'tag, PostingsListView<'txn>>,
|
arena: &SmallArena<'tag, PostingsListView<'txn>>,
|
||||||
|
searchable_attrs: Option<&ReorderedAttrs>,
|
||||||
) -> Document
|
) -> Document
|
||||||
{
|
{
|
||||||
let highlights = raw_document.bare_matches.iter().flat_map(|sm| {
|
let highlights = highlights_from_raw_document(
|
||||||
let postings_list = &arena[sm.postings_list];
|
&raw_document,
|
||||||
let input = postings_list.input();
|
automatons,
|
||||||
let query = &automatons[sm.query_index as usize].query;
|
arena,
|
||||||
postings_list.iter().map(move |m| {
|
searchable_attrs,
|
||||||
let covered_area = if query.len() > input.len() {
|
);
|
||||||
input.len()
|
|
||||||
} else {
|
|
||||||
prefix_damerau_levenshtein(query.as_bytes(), input).1
|
|
||||||
};
|
|
||||||
|
|
||||||
Highlight {
|
Document { id: raw_document.id, highlights }
|
||||||
attribute: m.attribute,
|
}
|
||||||
char_index: m.char_index,
|
|
||||||
char_length: covered_area as u16,
|
|
||||||
}
|
|
||||||
})
|
|
||||||
}).collect();
|
|
||||||
|
|
||||||
#[cfg(not(test))]
|
#[cfg(test)]
|
||||||
{
|
pub fn from_raw<'a, 'tag, 'txn>(
|
||||||
Document { id: raw_document.id, highlights }
|
raw_document: RawDocument<'a, 'tag>,
|
||||||
|
automatons: &[QueryWordAutomaton],
|
||||||
|
arena: &SmallArena<'tag, PostingsListView<'txn>>,
|
||||||
|
searchable_attrs: Option<&ReorderedAttrs>,
|
||||||
|
) -> Document
|
||||||
|
{
|
||||||
|
use crate::bucket_sort::SimpleMatch;
|
||||||
|
|
||||||
|
let highlights = highlights_from_raw_document(
|
||||||
|
&raw_document,
|
||||||
|
automatons,
|
||||||
|
arena,
|
||||||
|
searchable_attrs,
|
||||||
|
);
|
||||||
|
|
||||||
|
let mut matches = Vec::new();
|
||||||
|
for sm in raw_document.processed_matches {
|
||||||
|
let attribute = searchable_attrs
|
||||||
|
.and_then(|sa| sa.reverse(sm.attribute))
|
||||||
|
.unwrap_or(sm.attribute);
|
||||||
|
|
||||||
|
matches.push(SimpleMatch { attribute, ..sm });
|
||||||
}
|
}
|
||||||
|
matches.sort_unstable();
|
||||||
|
|
||||||
#[cfg(test)]
|
Document { id: raw_document.id, highlights, matches }
|
||||||
{
|
|
||||||
let matches = raw_document.processed_matches;
|
|
||||||
Document { id: raw_document.id, highlights, matches }
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -73,9 +73,7 @@ impl<'c, 'f, 'd> QueryBuilder<'c, 'f, 'd> {
|
|||||||
}
|
}
|
||||||
|
|
||||||
pub fn add_searchable_attribute(&mut self, attribute: u16) {
|
pub fn add_searchable_attribute(&mut self, attribute: u16) {
|
||||||
let reorders = self
|
let reorders = self.searchable_attrs.get_or_insert_with(ReorderedAttrs::new);
|
||||||
.searchable_attrs
|
|
||||||
.get_or_insert_with(ReorderedAttrs::new);
|
|
||||||
reorders.insert_attribute(attribute);
|
reorders.insert_attribute(attribute);
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -94,6 +92,7 @@ impl<'c, 'f, 'd> QueryBuilder<'c, 'f, 'd> {
|
|||||||
distinct,
|
distinct,
|
||||||
distinct_size,
|
distinct_size,
|
||||||
self.criteria,
|
self.criteria,
|
||||||
|
self.searchable_attrs,
|
||||||
self.main_store,
|
self.main_store,
|
||||||
self.postings_lists_store,
|
self.postings_lists_store,
|
||||||
self.documents_fields_counts_store,
|
self.documents_fields_counts_store,
|
||||||
@ -105,6 +104,7 @@ impl<'c, 'f, 'd> QueryBuilder<'c, 'f, 'd> {
|
|||||||
range,
|
range,
|
||||||
self.filter,
|
self.filter,
|
||||||
self.criteria,
|
self.criteria,
|
||||||
|
self.searchable_attrs,
|
||||||
self.main_store,
|
self.main_store,
|
||||||
self.postings_lists_store,
|
self.postings_lists_store,
|
||||||
self.documents_fields_counts_store,
|
self.documents_fields_counts_store,
|
||||||
@ -181,6 +181,16 @@ mod tests {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
const fn doc_attr_index(document_id: u64, attribute: u16, word_index: u16) -> DocIndex {
|
||||||
|
DocIndex {
|
||||||
|
document_id: DocumentId(document_id),
|
||||||
|
attribute,
|
||||||
|
word_index,
|
||||||
|
char_index: 0,
|
||||||
|
char_length: 0,
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
pub struct TempDatabase {
|
pub struct TempDatabase {
|
||||||
database: Database,
|
database: Database,
|
||||||
index: Index,
|
index: Index,
|
||||||
@ -1261,4 +1271,73 @@ mod tests {
|
|||||||
});
|
});
|
||||||
assert_matches!(iter.next(), None);
|
assert_matches!(iter.next(), None);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
#[test]
|
||||||
|
fn searchable_attributes() {
|
||||||
|
let store = TempDatabase::from_iter(vec![
|
||||||
|
("search", &[doc_attr_index(0, 0, 0)][..]),
|
||||||
|
("engine", &[doc_attr_index(0, 0, 1)][..]),
|
||||||
|
|
||||||
|
("search", &[doc_attr_index(1, 1, 0)][..]),
|
||||||
|
("engine", &[doc_attr_index(1, 1, 1)][..]),
|
||||||
|
]);
|
||||||
|
|
||||||
|
let db = &store.database;
|
||||||
|
let reader = db.main_read_txn().unwrap();
|
||||||
|
|
||||||
|
let builder = store.query_builder();
|
||||||
|
let results = builder.query(&reader, "search engine", 0..20).unwrap();
|
||||||
|
let mut iter = results.into_iter();
|
||||||
|
|
||||||
|
assert_matches!(iter.next(), Some(Document { id: DocumentId(0), matches, .. }) => {
|
||||||
|
let mut iter = matches.into_iter();
|
||||||
|
assert_matches!(iter.next(), Some(SimpleMatch { query_index: 0, word_index: 0, distance: 0, .. })); // search
|
||||||
|
assert_matches!(iter.next(), Some(SimpleMatch { query_index: 1, word_index: 1, distance: 0, .. })); // engine
|
||||||
|
assert_matches!(iter.next(), None);
|
||||||
|
});
|
||||||
|
assert_matches!(iter.next(), Some(Document { id: DocumentId(1), matches, .. }) => {
|
||||||
|
let mut iter = matches.into_iter();
|
||||||
|
assert_matches!(iter.next(), Some(SimpleMatch { query_index: 0, word_index: 0, distance: 0, .. })); // search
|
||||||
|
assert_matches!(iter.next(), Some(SimpleMatch { query_index: 1, word_index: 1, distance: 0, .. })); // engine
|
||||||
|
assert_matches!(iter.next(), None);
|
||||||
|
});
|
||||||
|
assert_matches!(iter.next(), None);
|
||||||
|
|
||||||
|
// reorderer the searchable attributes
|
||||||
|
let mut builder = store.query_builder();
|
||||||
|
builder.add_searchable_attribute(1);
|
||||||
|
builder.add_searchable_attribute(0);
|
||||||
|
|
||||||
|
let results = builder.query(&reader, "search engine", 0..20).unwrap();
|
||||||
|
let mut iter = results.into_iter();
|
||||||
|
|
||||||
|
assert_matches!(iter.next(), Some(Document { id: DocumentId(1), matches, .. }) => {
|
||||||
|
let mut iter = matches.into_iter();
|
||||||
|
assert_matches!(iter.next(), Some(SimpleMatch { query_index: 0, word_index: 0, distance: 0, .. })); // search
|
||||||
|
assert_matches!(iter.next(), Some(SimpleMatch { query_index: 1, word_index: 1, distance: 0, .. })); // engine
|
||||||
|
assert_matches!(iter.next(), None);
|
||||||
|
});
|
||||||
|
assert_matches!(iter.next(), Some(Document { id: DocumentId(0), matches, .. }) => {
|
||||||
|
let mut iter = matches.into_iter();
|
||||||
|
assert_matches!(iter.next(), Some(SimpleMatch { query_index: 0, word_index: 0, distance: 0, .. })); // search
|
||||||
|
assert_matches!(iter.next(), Some(SimpleMatch { query_index: 1, word_index: 1, distance: 0, .. })); // engine
|
||||||
|
assert_matches!(iter.next(), None);
|
||||||
|
});
|
||||||
|
assert_matches!(iter.next(), None);
|
||||||
|
|
||||||
|
// remove a searchable attributes
|
||||||
|
let mut builder = store.query_builder();
|
||||||
|
builder.add_searchable_attribute(1);
|
||||||
|
|
||||||
|
let results = builder.query(&reader, "search engine", 0..20).unwrap();
|
||||||
|
let mut iter = results.into_iter();
|
||||||
|
|
||||||
|
assert_matches!(iter.next(), Some(Document { id: DocumentId(1), matches, .. }) => {
|
||||||
|
let mut iter = matches.into_iter();
|
||||||
|
assert_matches!(iter.next(), Some(SimpleMatch { query_index: 0, word_index: 0, distance: 0, .. })); // search
|
||||||
|
assert_matches!(iter.next(), Some(SimpleMatch { query_index: 1, word_index: 1, distance: 0, .. })); // engine
|
||||||
|
assert_matches!(iter.next(), None);
|
||||||
|
});
|
||||||
|
assert_matches!(iter.next(), None);
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
@ -1,7 +1,9 @@
|
|||||||
use compact_arena::SmallArena;
|
use compact_arena::SmallArena;
|
||||||
use itertools::EitherOrBoth;
|
use itertools::EitherOrBoth;
|
||||||
use sdset::SetBuf;
|
use sdset::SetBuf;
|
||||||
|
use crate::DocIndex;
|
||||||
use crate::bucket_sort::{SimpleMatch, BareMatch, QueryWordAutomaton, PostingsListView};
|
use crate::bucket_sort::{SimpleMatch, BareMatch, QueryWordAutomaton, PostingsListView};
|
||||||
|
use crate::reordered_attrs::ReorderedAttrs;
|
||||||
|
|
||||||
pub struct RawDocument<'a, 'tag> {
|
pub struct RawDocument<'a, 'tag> {
|
||||||
pub id: crate::DocumentId,
|
pub id: crate::DocumentId,
|
||||||
@ -19,8 +21,25 @@ impl<'a, 'tag> RawDocument<'a, 'tag> {
|
|||||||
bare_matches: &'a mut [BareMatch<'tag>],
|
bare_matches: &'a mut [BareMatch<'tag>],
|
||||||
automatons: &[QueryWordAutomaton],
|
automatons: &[QueryWordAutomaton],
|
||||||
postings_lists: &mut SmallArena<'tag, PostingsListView<'txn>>,
|
postings_lists: &mut SmallArena<'tag, PostingsListView<'txn>>,
|
||||||
|
searchable_attrs: Option<&ReorderedAttrs>,
|
||||||
) -> Option<RawDocument<'a, 'tag>>
|
) -> Option<RawDocument<'a, 'tag>>
|
||||||
{
|
{
|
||||||
|
if let Some(reordered_attrs) = searchable_attrs {
|
||||||
|
for bm in bare_matches.iter() {
|
||||||
|
let postings_list = &postings_lists[bm.postings_list];
|
||||||
|
|
||||||
|
let mut rewritten = Vec::new();
|
||||||
|
for di in postings_list.iter() {
|
||||||
|
if let Some(attribute) = reordered_attrs.get(di.attribute) {
|
||||||
|
rewritten.push(DocIndex { attribute, ..*di });
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
let new_postings = SetBuf::from_dirty(rewritten);
|
||||||
|
postings_lists[bm.postings_list].rewrite_with(new_postings);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
bare_matches.sort_unstable_by_key(|m| m.query_index);
|
bare_matches.sort_unstable_by_key(|m| m.query_index);
|
||||||
|
|
||||||
let mut previous_word = None;
|
let mut previous_word = None;
|
||||||
|
@ -1,27 +1,31 @@
|
|||||||
|
use std::cmp;
|
||||||
|
|
||||||
#[derive(Default, Clone)]
|
#[derive(Default, Clone)]
|
||||||
pub struct ReorderedAttrs {
|
pub struct ReorderedAttrs {
|
||||||
count: usize,
|
|
||||||
reorders: Vec<Option<u16>>,
|
reorders: Vec<Option<u16>>,
|
||||||
|
reverse: Vec<u16>,
|
||||||
}
|
}
|
||||||
|
|
||||||
impl ReorderedAttrs {
|
impl ReorderedAttrs {
|
||||||
pub fn new() -> ReorderedAttrs {
|
pub fn new() -> ReorderedAttrs {
|
||||||
ReorderedAttrs {
|
ReorderedAttrs { reorders: Vec::new(), reverse: Vec::new() }
|
||||||
count: 0,
|
|
||||||
reorders: Vec::new(),
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
pub fn insert_attribute(&mut self, attribute: u16) {
|
pub fn insert_attribute(&mut self, attribute: u16) {
|
||||||
self.reorders.resize(attribute as usize + 1, None);
|
let new_len = cmp::max(attribute as usize + 1, self.reorders.len());
|
||||||
self.reorders[attribute as usize] = Some(self.count as u16);
|
self.reorders.resize(new_len, None);
|
||||||
self.count += 1;
|
self.reorders[attribute as usize] = Some(self.reverse.len() as u16);
|
||||||
|
self.reverse.push(attribute);
|
||||||
}
|
}
|
||||||
|
|
||||||
pub fn get(&self, attribute: u16) -> Option<u16> {
|
pub fn get(&self, attribute: u16) -> Option<u16> {
|
||||||
match self.reorders.get(attribute as usize) {
|
match self.reorders.get(attribute as usize)? {
|
||||||
Some(Some(attribute)) => Some(*attribute),
|
Some(attribute) => Some(*attribute),
|
||||||
_ => None,
|
None => None,
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
pub fn reverse(&self, attribute: u16) -> Option<u16> {
|
||||||
|
self.reverse.get(attribute as usize).copied()
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
Loading…
Reference in New Issue
Block a user