Paul Masurel
Paul Masurel
The feature is usually called "reverse search" as noted by @justinmchase . Luwak is another interesting project that communicates a lot about how to do it. My understanding is that...
@mocobeta Oh sweet! I did not know! Thank you for the info!
Yes we ignore delete in `doc_freq`. We should update the documentation accordingly.
@cultpony Is it something that you personally need?
(Apologies this was closed by mistake.)
So method you are offering is interesting and should work on a single node, but it has some problems. One several node, it would require too much coordination. (no necessarily...
Possible inspiration source https://berlinbuzzwords.de/sites/berlinbuzzwords.de/files/media/documents/adrien_grand-_algorithms_and_data-structures_that_power_lucene_and_elasticsearch.pdf http://lemire.me/blog/2015/03/25/accelerating-intersections-with-simd-instructions/ https://github.com/lemire/SIMDCompressionAndIntersection/blob/master/src/intersection.cpp https://github.com/RedisLabsModules/RediSearch/tree/master/src
It sounds extremely slow indeed. Can you share the entire project with an index? I suspect there might be another problem lurking there. If you cannot, can you at least...
Yes it makes sense. It's actually very little work, as the hack exists already for facets. Note that you also have `&[u8]` fast fields, if your strings tend to be...
`global_ordinals` are extremely complicated, and have some side effects. Also they are very likely not required for your use case. You can still do top K using term ordinal on...