Abstract
Approximate nearest neighbor search (ANNS) is the most basic and important algorithm in Database, Machine Learning and other applications. With the expansion of cloud computing, the academia focuses on the study of how to optimize distributed frameworks based on approximate nearest neighbor search such as MapReduce, and Memcached. We implement a new distributed ANNS search framework (NetANNS). The main contributions of NetANNS are to accelerate the data preprocessing with programmable switch, and integrate a variety of efficient ANNS algorithms so that it can choose the most suitable algorithm for each datasets. The experiments show that the search efficiency of NetANNS is about 2x than the common distributed ANNS frameworks which are implemented based on the framework of MapReduce.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
