Vector Search for the Future: From Memory-Resident, Static Heterogeneous Storage, to Cloud-Native Architectures
Open Access
- 30 May 2026
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 580-587
Abstract
No abstract availableAll Related Versions
Funding Information
- Hong Kong RGC grant (12202024)
- Hong Kong RGC grant (12201925)
This publication has 18 references indexed in Scilit:
- Vector Database Management Techniques and Systems2024
- Starling: An I/O-Efficient Disk-Resident Graph Index Framework for High-Dimensional Vector Similarity Search on Data SegmentProceedings of the ACM on Management of Data, 2024
- Efficient Approximate Nearest Neighbor Search in Multi-dimensional DatabasesProceedings of the ACM on Management of Data, 2023
- EI-LSH: An early-termination driven I/O efficient incremental c-approximate nearest neighbor searchThe VLDB Journal, 2020
- I-LSH: I/O Efficient c-Approximate Nearest Neighbor Search in High-Dimensional Space2019
- PQBF2017
- Scalable Nearest Neighbor Algorithms for High Dimensional DataIEEE Transactions on Pattern Analysis and Machine Intelligence, 2014
- Balanced K-Means for Clustering2014
- Efficient and accurate nearest neighbor and closest pair search in high-dimensional spaceACM Transactions on Database Systems, 2010
- Genetic K-means algorithmIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 1999