SQUASH: Serverless And Distributed Quantization-based Attributed Vector Similarity Search

Abstract

Vector similarity search presents significant challenges in terms of scalability for large and high-dimensional datasets, as well as in providing native support for hybrid queries. Serverless computing and cloud functions offer attractive benefits such as elasticity and cost-effectiveness, but are difficult to apply to data-intensive workloads. Jointly addressing these two main challenges, we present SQUASH, the first fully serverless vector search solution with rich support for hybrid queries. It features OSQ, an optimized and highly parallelizable quantization-based approach for vectors and attributes. Its segment-based storage mechanism enables significant compression in resource-constrained settings and offers efficient dimensional extraction operations. SQUASH performs a single distributed pass to guarantee the return of sufficiently many vectors satisfying the filter predicate, achieving high accuracy and avoiding redundant computation for vectors which fail the predicate. A mult

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyoakley2025squash

Related papers

• Interleaved Composite Quantization For High-dimensional Similarity Search (2019)0.00
• Leanvec: Searching Vectors Faster By Making Them Fit (2023)0.00
• Zoom: Ssd-based Vector Search For Optimizing Accuracy, Latency And Memory (2018)0.00
• Distributed Tera-scale Similarity Search With MPI: Provably Efficient Similarity Search Over Billions Without A Single Distance Computation (2020)0.00
• High-dimensional Similarity Search With Quantum-assisted Variational Autoencoder (2020)8.82
• SAQ: Pushing The Limits Of Vector Quantization Through Code Adjustment And Dimension Segmentation (2025)0.00
• Passing The Baton: High Throughput Distributed Disk-based Vector Search With Batann (2025)0.00
• Central Similarity Quantization For Efficient Image And Video Retrieval (2019)23.49