Loading article...
Loading article...
Stream/Area:
-
Subject:
-
Paper ID:
IJSREM64759
Volume:
10 |
6 |
Jun 2026
Pages:
1-5
Publication Frequency:
Monthly (12 issues per year)
License:International Journal of Scientific Research in Engineering and Management follows the Creative Commons Attribution 4.0 (CC BY 4.0) License, allowing free use and distribution with proper attribution.

Computer Science and Engineering
Sarvepalli Radhakrishnan University, Bhopal, India
Computer Science and Engineering
Sarvepalli Radhakrishnan University, Bhopal, India
As artificial intelligence workloads become increasingly latency-sensitive, the optimization of vector database query performance has emerged as a critical research concern. While foundational work has established the architectural primitives of vector storage systems, comparatively little attention has been directed toward the engineering strategies required to achieve consistent sub-millisecond retrieval latency at billion-vector scale. This paper presents a systematic examination of query optimization techniques applicable to AI-powered vector databases, including adaptive index selection, batched query execution, hardware-aware quantization, and cache-coherent memory layout strategies. We further analyze the performance trade-offs introduced by concurrent write operations in dynamic vector collections, and evaluate the effectiveness of write-optimized buffer structures in mitigating index degradation. Benchmarks are conducted across Milvus, Qdrant, and Weaviate under controlled synthetic and real-world workloads. Results demonstrate that workload-aware parameter tuning can reduce average query latency by up to 63% while preserving recall rates above 0.95. The paper concludes by proposing a performance optimization framework applicable to production AI systems requiring real-time vector retrieval.
KEYWORDS
This paper has presented a comprehensive investigation of query optimization strategies for AI-powered vector databases, demonstrating that systematic performance engineering can yield substantial latency reductions without sacrificing retrieval quality. Our experimental evaluation across Milvus, Qdrant, and Weaviate established that optimized parameter configurations reduce p50 query latency by 42-63% relative to default settings while maintaining recall above 0.93. The proposed four-stage optimization framework provides practitioners with a structured methodology for achieving production-grade vector retrieval performance. As AI applications continue to demand increasingly responsive semantic search capabilities, the optimization techniques and analytical frameworks presented in this paper will play a central role in enabling reliable, high-throughput vector database deployments at scale.
[1] M. Aumüller, E. Bernhardsson, and A. Faithfull, "ANN-Benchmarks: A benchmarking tool for approximate nearest neighbor algorithms," Information Systems, vol. 87, pp. 1–13, 2020. [2] Y. A. Malkov and D. A. Yashunin, "Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 42, no. 4, pp. 824–836, 2020. [3] E. Aguerrebere et al., "Locally-adaptive quantization for streaming vector search," Proceedings of the ACM on Management of Data, vol. 1, no. 2, pp. 1–25, 2023. [4] C. Wang et al., "Milvus: A purpose-built vector data management system," Proceedings of ACM SIGMOD, pp. 2614–2627, 2021. [5] J. Johnson, M. Douze, and H. Jégou, "Billion-scale similarity search with GPUs," IEEE Transactions on Big Data, vol. 7, no. 3, pp. 535–547, 2019. [6] H. Jégou, M. Douze, and C. Schmid, "Product quantization for nearest neighbor search," IEEE TPAMI, vol. 33, no. 1, pp. 117–128, 2011. [7] J. Pan et al., "Survey of vector database management systems," The VLDB Journal, vol. 33, pp. 1591–1615, 2024. [8] N. Reimers and I. Gurevych, "Sentence-BERT: Sentence embeddings using siamese BERT-networks," Proceedings of EMNLP, pp. 3982–3992, 2019. [9] L. Boytsov and B. Naidan, "Engineering efficient and effective non-metric space library," Proceedings of SISAP, pp. 280–293, 2013. [10] T. Ge, K. He, Q. Ke, and J. Sun, "Optimized product quantization," IEEE TPAMI, vol. 36, no. 4, pp. 744–755, 2014.
Publication Date
6/11/2026
Peer Review Type
Double-Blind Peer Review
Review Rounds: 2
Documents
Article Views
0
Total views since publication
PDF Downloads
5
Total downloads since publication
Geographic Reach
5
Digital Preservation: This article is permanently archived on Zenodo and complies with all data preservation standards across major indexing platforms.
Plagiarism Screening
This manuscript has been checked for plagiarism using TurnitinPlagiarismChecker software.
Conflict of Interest
The authors declare no conflict of interest related to this research work.
Funding Information
No funding information available for this research.
Related research in the same subject area
Loading similar articles...