Fast And Exact Nearest Neighbor Search In Hamming Space On Full-Text Search Engines

SIMILARITY SEARCH AND APPLICATIONS (SISAP 2019)(2019)

引用 2|浏览17
暂无评分
摘要
A growing interest has been witnessed recently from both academia and industry in building nearest neighbor search (NNS) solutions on top of full-text search engines. Compared with other NNS systems, such solutions are capable of effectively reducing main memory consumption, coherently supporting multi-model search and being immediately ready for production deployment. In this paper, we continue the journey to explore specifically how to empower full-text search engines with fast and exact NNS in Hamming space (i.e., the set of binary codes). By revisiting three techniques (bit operation, subs-code filtering and data preprocessing with permutation) in information retrieval literature, we develop a novel engineering solution for full-text search engines to efficiently accomplish this special but important NNS task. In the experiment, we show that our proposed approach enables full-text search engines to achieve significant speed-ups over its state-of-the-art term match approach for NNS within binary codes.
更多
查看译文
关键词
Full-text search engine, Nearest neighbor search, Hamming space, Semantic binary embedding, Elasticsearch, Lucene
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要