Brief Announcement: Accelerating Distributed Search System with In-network Computation

Locality Sensitive Hashing (LSH) has proven to be an effective technique for indexing similar data in high-dimensional spaces, enabling efficient approximate nearest neighbor searches. However, as data sets continue to grow in size and complexity, traditional LSH-based distributed search systems face challenges in terms of network bottlenecks. Specifically, the transmission of large packets containing candidate answers to agent servers can significantly affect response time and throughput.