{"total":16,"rows":[{"id":"2310.11703","title":"A Comprehensive Survey on Vector Database: Storage and Retrieval Technique, Challenge","created":"2023-10-18","cited_by_count":55,"area":null},{"id":"2402.00943","title":"Approximate Nearest Neighbor Search with Window Filters","created":"2024-02-01","cited_by_count":11,"area":null},{"id":"2506.16444","title":"REIS: A High-Performance and Energy-Efficient Retrieval System with In-Storage Processing","created":"2025-06-19","cited_by_count":4,"area":null},{"id":"2312.03940","title":"PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search","created":"2023-12-06","cited_by_count":3,"area":null},{"id":"2511.15557","title":"B+ANN: A Fast Billion-Scale Disk-based Nearest-Neighbor Index","created":"2025-11-19","cited_by_count":2,"area":null},{"id":"2412.01555","title":"Optimizing Domain-Specific Image Retrieval: A Benchmark of FAISS and Annoy with Fine-Tuned Features","created":"2024-12-02","cited_by_count":1,"area":null},{"id":"2601.07048","title":"GPU-Accelerated ANNS: Quantized for Speed, Built for Change","created":"2026-01-11","cited_by_count":1,"area":null},{"id":"2502.06163","title":"Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search","created":"2025-02-10","cited_by_count":0,"area":null},{"id":"2505.15636","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","created":"2025-05-21","cited_by_count":0,"area":null},{"id":"2511.07139","title":"Trading Vector Data in Vector Databases","created":"2025-11-10","cited_by_count":0,"area":null},{"id":"2602.06633","title":"Graph-Based Nearest-Neighbor Search without the Spread","created":"2026-02-06","cited_by_count":0,"area":null},{"id":"2605.00826","title":"Understanding the Performance Plateau in Text-to-Video Retrieval: A Comprehensive Empirical and Linguistic Analysis","created":"2026-03-07","cited_by_count":0,"area":null},{"id":"2607.17582","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","created":"2026-07-20","cited_by_count":0,"area":null},{"id":"2607.29606","title":"QASP: Query-Adaptive Robust Vector Search Policy","created":"2026-07-31","cited_by_count":0,"area":null},{"id":"2608.14648","title":"Stop Indexing at Full Precision: Revisiting Clustering for Vector Embeddings","created":"2026-07-30","cited_by_count":0,"area":null},{"id":"2609.02143","title":"A Power Law in Logarithm's Clothing: On the Scalability of Graph-Based Vector Search","created":"2026-09-02","cited_by_count":0,"area":null}],"next_cursor":null}