Re:Writing a full-text search engine using Bloom filters (2013)
by bule0bird on Wednesday June 10, 2020 @12:41AM
(#23473986)
The indexing task can be done during static site generation and results shipped as resources, but the query part (search string parsing, ranking, snippet generation, etc) needs some code running locally (browser, js).
We've used Minimal Perfect Hash Function with bloom filter to reduce the mem of a service from ~27G to ~8G, as the data was static. Probably something like that can be used here too, to make indices small.
[ Parent
| on HN ]
There are no comments on this comment yet.