Project Akupara header: DiskANN graph on black background

DiskANN: Vector Search for All

Publications

View by:

- Welfarist Formulations for Diverse Similarity Search
  
  Siddharth Barman, Nirjhar Das, Shivam Gupta, Kiran Shiragur
  
  ICLR 2026 | February 2026
  
  Publication
- Sort Before You Prune: Improved Worst-Case Guarantees of the DiskANN Family of Graphs
  
  Siddharth Gollapudi, Ravishankar Krishnaswamy, Kirankumar Shiragur, Harsh Wardhan
  
  2025 International Conference on Machine Learning | December 2025
  
  Publication
- DistributedANN: Efficient Scaling of a Single DiskANN Graph Across Thousands of Computers
  
  Philip Adams, Menghao Li, Shi Zhang, Li Tan, Mingqin Li, Qi Chen, Knut Magne Risvik, Jason (Zengzhong) Li, Harsha Simhadri
  
  The 1st Workshop on Vector Databases at the 2025 International Conference on Machine Learning | July 2025
  
  PDF
- Graph-Based Algorithms for Diverse Similarity Search
  
  Piyush Anand, Piotr Indyk, Ravishankar Krishnaswamy, S. Mahabadi, V. Raykar, Kirankumar Shiragur, Haike Xu
  
  ArXiv | February 2025, Vol abs/2502.13336
  
  DOI Publication Publication
- The DiskANN library: Graph-Based Indices for Fast, Fresh and Filtered Vector Search
  
  Ravishankar Krishnaswamy, Ravishankar Krishnaswamy, M. Manohar, Harsha Simhadri
  
  IEEE Data Eng. Bull. | December 2024, Vol 48: pp. 20-42
  
  Publication
- Results of the Big ANN: NeurIPS’23 competition
  
  Harsha Simhadri, Martin Aumuller, Amir Ingber, Matthijs Douze, George Williams, M. Manohar, Dmitry Baranchuk, Edo Liberty, Frank Liu, Benjamin Landrum, Mazin Karjikar, Laxman Dhulipala, Meng Chen, Yue Chen, Rui Ma, Kai Zhang, Yuzheng Cai, Jiayang Shi, Yizhuo Chen, Weiguo Zheng, Zihao Wan, Jie Yin, Ben Huang
  
  NeurIPS 2025 | September 2024
  
  DOI Publication Publication
- OOD-DiskANN: Efficient and Scalable Graph ANNS for Out-of-Distribution Queries
  
  Harsha Simhadri
  
  November 2022
  
  Publication
- Results of the NeurIPS’21 Challenge on Billion-Scale Approximate Nearest Neighbor Search
  
  Harsha Simhadri
  
  NeurIPS | November 2021
  
  Publication
- FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search
  
  Harsha Simhadri, Ravishankar Krishnaswamy
  
  May 2021
  
  Publication
- DiskANN: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node
  
  Suhas Jayaram Subramanya, Devvrit, Rohan Kadekodi, Ravishankar Krishnaswamy, Harsha Simhadri
  
  NeurIPS 2019 | November 2019
  
  PDF Github

- Welfarist Formulations for Diverse Similarity Search
  
  Siddharth Barman, Nirjhar Das, Shivam Gupta, Kiran Shiragur
  
  ICLR 2026 | February 2026
  
  Publication
- Sort Before You Prune: Improved Worst-Case Guarantees of the DiskANN Family of Graphs
  
  Siddharth Gollapudi, Ravishankar Krishnaswamy, Kirankumar Shiragur, Harsh Wardhan
  
  2025 International Conference on Machine Learning | December 2025
  
  Publication
- Graph-Based Algorithms for Diverse Similarity Search
  
  Piyush Anand, Piotr Indyk, Ravishankar Krishnaswamy, S. Mahabadi, V. Raykar, Kirankumar Shiragur, Haike Xu
  
  ArXiv | February 2025, Vol abs/2502.13336
  
  DOI Publication Publication
- The DiskANN library: Graph-Based Indices for Fast, Fresh and Filtered Vector Search
  
  Ravishankar Krishnaswamy, Ravishankar Krishnaswamy, M. Manohar, Harsha Simhadri
  
  IEEE Data Eng. Bull. | December 2024, Vol 48: pp. 20-42
  
  Publication
- OOD-DiskANN: Efficient and Scalable Graph ANNS for Out-of-Distribution Queries
  
  Harsha Simhadri
  
  November 2022
  
  Publication
- Results of the NeurIPS’21 Challenge on Billion-Scale Approximate Nearest Neighbor Search
  
  Harsha Simhadri
  
  NeurIPS | November 2021
  
  Publication
- FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search
  
  Harsha Simhadri, Ravishankar Krishnaswamy
  
  May 2021
  
  Publication
- DiskANN: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node
  
  Suhas Jayaram Subramanya, Devvrit, Rohan Kadekodi, Ravishankar Krishnaswamy, Harsha Simhadri
  
  NeurIPS 2019 | November 2019
  
  PDF Github
- Welfarist Formulations for Diverse Similarity Search
  
  Siddharth Barman, Nirjhar Das, Shivam Gupta, Kiran Shiragur
  
  ICLR 2026 | February 2026
  
  Publication
- Results of the Big ANN: NeurIPS’23 competition
  
  Harsha Simhadri, Martin Aumuller, Amir Ingber, Matthijs Douze, George Williams, M. Manohar, Dmitry Baranchuk, Edo Liberty, Frank Liu, Benjamin Landrum, Mazin Karjikar, Laxman Dhulipala, Meng Chen, Yue Chen, Rui Ma, Kai Zhang, Yuzheng Cai, Jiayang Shi, Yizhuo Chen, Weiguo Zheng, Zihao Wan, Jie Yin, Ben Huang
  
  NeurIPS 2025 | September 2024
  
  DOI Publication Publication
- Welfarist Formulations for Diverse Similarity Search
  
  Siddharth Barman, Nirjhar Das, Shivam Gupta, Kiran Shiragur
  
  ICLR 2026 | February 2026
  
  Publication
- Welfarist Formulations for Diverse Similarity Search
  
  Siddharth Barman, Nirjhar Das, Shivam Gupta, Kiran Shiragur
  
  ICLR 2026 | February 2026
  
  Publication
- DistributedANN: Efficient Scaling of a Single DiskANN Graph Across Thousands of Computers
  
  Philip Adams, Menghao Li, Shi Zhang, Li Tan, Mingqin Li, Qi Chen, Knut Magne Risvik, Jason (Zengzhong) Li, Harsha Simhadri
  
  The 1st Workshop on Vector Databases at the 2025 International Conference on Machine Learning | July 2025
  
  PDF
- Results of the Big ANN: NeurIPS’23 competition
  
  Harsha Simhadri, Martin Aumuller, Amir Ingber, Matthijs Douze, George Williams, M. Manohar, Dmitry Baranchuk, Edo Liberty, Frank Liu, Benjamin Landrum, Mazin Karjikar, Laxman Dhulipala, Meng Chen, Yue Chen, Rui Ma, Kai Zhang, Yuzheng Cai, Jiayang Shi, Yizhuo Chen, Weiguo Zheng, Zihao Wan, Jie Yin, Ben Huang
  
  NeurIPS 2025 | September 2024
  
  DOI Publication Publication
- OOD-DiskANN: Efficient and Scalable Graph ANNS for Out-of-Distribution Queries
  
  Harsha Simhadri
  
  November 2022
  
  Publication
- Results of the NeurIPS’21 Challenge on Billion-Scale Approximate Nearest Neighbor Search
  
  Harsha Simhadri
  
  NeurIPS | November 2021
  
  Publication
- FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search
  
  Harsha Simhadri, Ravishankar Krishnaswamy
  
  May 2021
  
  Publication

- Welfarist Formulations for Diverse Similarity Search
  
  Siddharth Barman, Nirjhar Das, Shivam Gupta, Kiran Shiragur
  
  ICLR 2026 | February 2026
  
  Publication
- Sort Before You Prune: Improved Worst-Case Guarantees of the DiskANN Family of Graphs
  
  Siddharth Gollapudi, Ravishankar Krishnaswamy, Kirankumar Shiragur, Harsh Wardhan
  
  2025 International Conference on Machine Learning | December 2025
  
  Publication
- DistributedANN: Efficient Scaling of a Single DiskANN Graph Across Thousands of Computers
  
  Philip Adams, Menghao Li, Shi Zhang, Li Tan, Mingqin Li, Qi Chen, Knut Magne Risvik, Jason (Zengzhong) Li, Harsha Simhadri
  
  The 1st Workshop on Vector Databases at the 2025 International Conference on Machine Learning | July 2025
  
  PDF
- Results of the Big ANN: NeurIPS’23 competition
  
  Harsha Simhadri, Martin Aumuller, Amir Ingber, Matthijs Douze, George Williams, M. Manohar, Dmitry Baranchuk, Edo Liberty, Frank Liu, Benjamin Landrum, Mazin Karjikar, Laxman Dhulipala, Meng Chen, Yue Chen, Rui Ma, Kai Zhang, Yuzheng Cai, Jiayang Shi, Yizhuo Chen, Weiguo Zheng, Zihao Wan, Jie Yin, Ben Huang
  
  NeurIPS 2025 | September 2024
  
  DOI Publication Publication
- Results of the NeurIPS’21 Challenge on Billion-Scale Approximate Nearest Neighbor Search
  
  Harsha Simhadri
  
  NeurIPS | November 2021
  
  Publication
- DiskANN: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node
  
  Suhas Jayaram Subramanya, Devvrit, Rohan Kadekodi, Ravishankar Krishnaswamy, Harsha Simhadri
  
  NeurIPS 2019 | November 2019
  
  PDF Github
- Graph-Based Algorithms for Diverse Similarity Search
  
  Piyush Anand, Piotr Indyk, Ravishankar Krishnaswamy, S. Mahabadi, V. Raykar, Kirankumar Shiragur, Haike Xu
  
  ArXiv | February 2025, Vol abs/2502.13336
  
  DOI Publication Publication
- The DiskANN library: Graph-Based Indices for Fast, Fresh and Filtered Vector Search
  
  Ravishankar Krishnaswamy, Ravishankar Krishnaswamy, M. Manohar, Harsha Simhadri
  
  IEEE Data Eng. Bull. | December 2024, Vol 48: pp. 20-42
  
  Publication
- OOD-DiskANN: Efficient and Scalable Graph ANNS for Out-of-Distribution Queries
  
  Harsha Simhadri
  
  November 2022
  
  Publication
- FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search
  
  Harsha Simhadri, Ravishankar Krishnaswamy
  
  May 2021
  
  Publication

DiskANN: Vector Search for All

Publications

Welfarist Formulations for Diverse Similarity Search

Sort Before You Prune: Improved Worst-Case Guarantees of the DiskANN Family of Graphs

DistributedANN: Efficient Scaling of a Single DiskANN Graph Across Thousands of Computers

Graph-Based Algorithms for Diverse Similarity Search

The DiskANN library: Graph-Based Indices for Fast, Fresh and Filtered Vector Search

Results of the Big ANN: NeurIPS’23 competition

OOD-DiskANN: Efficient and Scalable Graph ANNS for Out-of-Distribution Queries

Results of the NeurIPS’21 Challenge on Billion-Scale Approximate Nearest Neighbor Search

FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search

DiskANN: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node

Welfarist Formulations for Diverse Similarity Search

Sort Before You Prune: Improved Worst-Case Guarantees of the DiskANN Family of Graphs

Graph-Based Algorithms for Diverse Similarity Search

The DiskANN library: Graph-Based Indices for Fast, Fresh and Filtered Vector Search

OOD-DiskANN: Efficient and Scalable Graph ANNS for Out-of-Distribution Queries

Results of the NeurIPS’21 Challenge on Billion-Scale Approximate Nearest Neighbor Search

FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search

DiskANN: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node

Welfarist Formulations for Diverse Similarity Search

Results of the Big ANN: NeurIPS’23 competition

Welfarist Formulations for Diverse Similarity Search

Welfarist Formulations for Diverse Similarity Search

DistributedANN: Efficient Scaling of a Single DiskANN Graph Across Thousands of Computers

Results of the Big ANN: NeurIPS’23 competition

OOD-DiskANN: Efficient and Scalable Graph ANNS for Out-of-Distribution Queries

Results of the NeurIPS’21 Challenge on Billion-Scale Approximate Nearest Neighbor Search

FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search

Welfarist Formulations for Diverse Similarity Search

Sort Before You Prune: Improved Worst-Case Guarantees of the DiskANN Family of Graphs

DistributedANN: Efficient Scaling of a Single DiskANN Graph Across Thousands of Computers

Results of the Big ANN: NeurIPS’23 competition

Results of the NeurIPS’21 Challenge on Billion-Scale Approximate Nearest Neighbor Search

DiskANN: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node

Graph-Based Algorithms for Diverse Similarity Search

The DiskANN library: Graph-Based Indices for Fast, Fresh and Filtered Vector Search

OOD-DiskANN: Efficient and Scalable Graph ANNS for Out-of-Distribution Queries

FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search