Challenges and Opportunities of Graph-Based Algorithms for Similarity Search (Invited Talk)

Indyk, Piotr

doi:10.4230/LIPIcs.ISAAC.2025.1

Document

Challenges and Opportunities of Graph-Based Algorithms for Similarity Search (Invited Talk)

Author Piotr Indyk

Part of: Volume: 36th International Symposium on Algorithms and Computation (ISAAC 2025)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: International Symposium on Algorithms and Computation (ISAAC)
License: Creative Commons Attribution 4.0 International license
Publication Date: 2025-11-27

PDF

File

PDF

LIPIcs.ISAAC.2025.1.pdf

Filesize: 248 kB
1 pages

Document Identifiers

DOI: 10.4230/LIPIcs.ISAAC.2025.1
URN: urn:nbn:de:0030-drops-249092

Subject Classification

ACM Subject Classification

Theory of computation

Keywords

Similarity search

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Abstract

Over the last few years, graph-based approaches to nearest neighbor search have attracted renewed interest. Algorithms such as HNSW, NSG, and DiskANN have become popular tools in practice. These algorithms are highly versatile and come with efficient implementations. At the same time, their correctness, performance guarantees, and functionality remain poorly understood. In this talk, I will discuss the challenges and opportunities presented by this class of algorithms.

Cite As Get BibTex

Piotr Indyk. Challenges and Opportunities of Graph-Based Algorithms for Similarity Search (Invited Talk). In 36th International Symposium on Algorithms and Computation (ISAAC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 359, p. 1:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ISAAC.2025.1

Author Details

Piotr Indyk

Massachusetts Institute of Technology, Cambridge, MA, USA

Any Issues?

Feedback on the Current Page

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail