5 papers
ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases
Md Mizanur Rahaman Nayan, Tianqi Zhang, Flavio Ponzina +2
Vector database search with frequent updates is increasingly critical in applications such as retrieval augmented generation, recommendation systems, and large-scale embedding retr…
FaTRQ: Tiered Residual Quantization for LLM Vector Search in Far-Memory-Aware ANNS Systems
Tianqi Zhang, Flavio Ponzina, Tajana Rosing
Approximate Nearest-Neighbor Search (ANNS) is a key technique in retrieval-augmented generation (RAG), enabling rapid identification of the most relevant high-dimensional embedding…
SpANNS: Optimizing Approximate Nearest Neighbor Search for Sparse Vectors Using Near Memory Processing
Tianqi Zhang, Flavio Ponzina, Tajana Rosing
Approximate Nearest Neighbor Search (ANNS) is a fundamental operation in vector databases, enabling efficient similarity search in high-dimensional spaces. While dense ANNS has bee…
HERP: Hardware for Energy Efficient and Realtime DB Search and Cluster Expansion in Proteomics
Md Mizanur Rahaman Nayan, Zheyu Li, Flavio Ponzina +3
Database search and clustering are fundamental components of many data analytics problems, such as mass spectrometry-driven proteomics. Traditional full clustering and search algor…
FeNOMS: Enhancing Open Modification Spectral Library Search with In-Storage Processing on Ferroelectric NAND (FeNAND) Flash
Sumukh Pinge, Ashkan Moradifirouzabadi, Keming Fan +29
The rapid expansion of mass spectrometry (MS) data, now exceeding hundreds of terabytes, poses significant challenges for efficient, large-scale library search - a critical compone…