Work

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

Year: 2025

Type: conference-paper

Abstract: 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.

Source: ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)

DOI: 10.1145/3694906.3743306

Author: Penghao Zhang

Institution: Shanxi University

Language: English

Topic: Advanced Image and Video Retrieval Techniques

Subfield: Computer Vision and Pattern Recognition

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funders: National Natural Science Foundation of China, Natural Science Foundation of Shanxi Province

OpenAlex ID: W4412482058

FWCI:

Cites: 10

Cited by:

Related to: 10