Daniele Fedeli

How can this be done? Do we first retrieve the documents and then apply the conditions or we are also indexing non-searchable fields?

I am working on that, by now I have only created the type for the where clause.

For now I am using these data structures for indexing non-searchable fields: - Boolean: HashMap -> Key: `${PropName}_${booleanValue}` Value: Set which contains ids - Number: HashMap -> Key: `${PropName}` value:...

My PR is almost ready, I will try to do some benchmark

Cannot be implemented via sort of a score? [tf-idf](https://en.wikipedia.org/wiki/Tf%E2%80%93idf) can be a good candidate.

@micheleriva Benchmarks: Honestly, I am not happy with the range of query results. Right now I do a linear search over keys. I will try something non-linear.

Thank you @anonrig I will work on that soon :clinking_glasses:

Managed to get a better benchmark by changing the index data structure. I will solve the conflicts, adjust the document deletion and I'm done.

Hi @micheleriva, Is there something wrong with this PR? I can fix it if that is the case

Ok, please write a comment when we can merge this so I will resolve conflicts