ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “distributed vector databases”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.DCEmpiricalRecentOct 25, 2026

Failure-Resilient and Verifiable Distributed Approximate Nearest-Neighbor Retrieval

Abdullah Al-Mamun

TrustANN provides query-level trust for distributed approximate nearest-neighbor retrieval without modifying the underlying algorithm.

View →
cs.DBcs.IREmpiricalRecentJul 17, 2026

Efficient and Effective In-place Graph-based Vector Index Updates

Haotian Liu, Yujun He, Bo Tang

This paper proposes Yi, a system for efficient and effective in-place updates in large-scale vector indexing, achieving higher update and search throughput than state-of-the-art methods.

View →
cs.ARcs.DBcs.ETRecentJun 2, 2026

ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases

Md Mizanur Rahaman Nayan, Tianqi Zhang, Flavio Ponzina, Tajana Rosing +1 more

ACRONYM is a novel algorithm-hardware co-designed platform that enables high-recall, continuous approximate nearest neighbor search in memory for dynamic vector databases, achieving massive throughput…

View →
cs.DBcs.IREmpiricalRecentOct 30, 2026

Fidelity Synopses: Pre-Execution Plan Selection for Approximate Vector Search

Adithya Ramanatha, Sanskar S. Singh, Maya Ramanath

This paper proposes a synopsis-guided approach to optimize vector search in databases by predicting the fidelity of different configurations and selecting the most cost-effective one for each query.

View →
cs.IRcs.AIcs.LGRecentMay 28, 2026

No More K-means: Single-Stage Sparse Coding for Efficient Multi-Vector Retrieval

Lixuan Guo, Yifei Wang, Tiansheng Wen, Aosong Feng +2 more

The paper introduces Single-stage Sparse Retrieval (SSR), a method that replaces computationally expensive vector clustering with sparse autoencoding to achieve highly efficient multi-vector retrieval…

View →
cs.DScs.IRTheoreticalRecentJun 22, 2026

Multi-Vector Embeddings are Provably More Expressive than Single Vector Embeddings

Rajesh Jayaram

This paper proves that single-vector embeddings require a larger representation size than multi-vector embeddings to approximate certain similarities.

View →
cs.CRcs.IRApr 10, 2026

Trans-RAG: Query-Centric Vector Transformation for Secure Cross-Organizational Retrieval

Yu Liu, Kun Peng, Wenxiao Zhang, Fangfang Yuan +3 more

Trans-RAG introduces a novel query-centric vector transformation technique to enable secure, efficient, and accurate cross-organizational retrieval in RAG systems without plaintext decryption.

View →
cs.CRcs.DBApr 7, 2026

Can You Trust the Vectors in Your Vector Database? Black-Hole Attack from Embedding Space Defects

Hanxi Li, Jianan Zhou, Jiale Lao, Yibo Wang +4 more

The paper introduces the Black-Hole Attack, a poisoning vulnerability that exploits geometric defects in high-dimensional embedding spaces to force malicious vectors into the top-k results of vector d…

View →
cs.DSTheoreticalRecentSep 18, 2026

Faster SVP in Polynomial Space

Yansong Feng, Yiming Gao, Jiaqi Liu

The paper presents a randomized algorithm that solves the exact Euclidean shortest vector problem in polynomial space and improved time complexity.

View →
cs.DSTheoreticalRecentSep 18, 2026

The Complexity of Computing Class Probabilities in BID Probabilistic Databases

Sotiris Kanellopoulos, Ioannis Koutras, Aris Pagourtzis

Computes class probabilities in block-independent disjoint probabilistic databases.

View →
cs.DCEmpiricalRecentOct 13, 2026

A Distributed View from a Single GPU: RankLens for Distributed Training

Yufan Wang, Yihao Zhang, Yi Liu

RankLens is a single-rank emulation system that enables analysis, debugging, and tuning of distributed training with reduced resource requirements.

View →
cs.DBcs.IREmpiricalRecentJun 18, 2026

Query-aware Routing for Filtered Approximate Nearest Neighbors Search

Qianqian Xiong, Mengxuan Zhang

This paper proposes a query-aware routing framework for filtered ANN search to achieve state-of-the-art recall and QPS balance.

View →
cs.DSmath.NATheoreticalRecentJun 10, 2026

Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products

Christoper Musco, Indu Ramesh

This paper provides a nearly sharp characterization of the matvec query complexity of sparse matrix approximation.

View →
cs.DBcs.DCcs.ETEmpiricalRecentAug 5, 2026

Filtered Vector Search in a Disaggregated Lakehouse: Composing Table-Format Pruning with Per-File ANN

Rakesh Jain, Thomas Griffin, Syed Zawad

This paper embeds an IVF index in Parquet files' footers for approximate nearest-neighbor search in a lakehouse table, using existing file pruning for filtering and improving search performance.

View →
cs.IRcs.AIcs.ITTheoreticalRecentJun 10, 2026

What Limits Does Quantization Place on Dense Top-$k$ Retrieval? A Theoretical Study

Koki Okajima, Tsukasa Yoshida

Establishes conditions for embedding documents as vectors for top-k retrieval and analyzes the required dimension and precision.

View →