Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art

I Azizi, K Echihabi, T Palpanas - … of the ACM on Management of Data, 2025 - dl.acm.org
Vector data is prevalent across business and scientific applications, and its popularity is
growing with the proliferation of learned embeddings. Vector data collections often reach …

[PDF][PDF] Graph-and Tree-based Indexes for High-dimensional Vector Similarity Search: Analyses, Comparisons, and Future Directions.

Z Wang, P Wang, T Palpanas… - IEEE Data Eng …, 2023 - helios2.mi.parisdescartes.fr
Approximate nearest neighbor search on high-dimensional vectors is a crucial component
for numerous applications in various fields. To solve this problem efficiently, dozens of …

Steiner-Hardness: A Query Hardness Measure for Graph-Based ANN Indexes

Z Wang, Q Wang, X Cheng, P Wang… - Proceedings of the …, 2024 - dl.acm.org
Graph-based indexes have been widely employed to accelerate approximate similarity
search of high-dimensional vectors. However, the performance of graph indexes to answer …

Investigating neural audio codecs for speech language model-based speech generation

J Li, D Wang, X Wang, Y Qian, L Zhou… - 2024 IEEE Spoken …, 2024 - ieeexplore.ieee.org
Neural audio codec tokens serve as the fundamental building blocks for speech language
model (SLM)-based speech generation. However, there is no systematic understanding on …

Det-lsh: a locality-sensitive hashing scheme with dynamic encoding tree for approximate nearest neighbor search

J Wei, B Peng, X Lee, T Palpanas - arxiv preprint arxiv:2406.10938, 2024 - arxiv.org
Locality-sensitive hashing (LSH) is a well-known solution for approximate nearest neighbor
(ANN) search in high-dimensional spaces due to its robust theoretical guarantee on query …

[PDF][PDF] Querying Time-Series Data: A Comprehensive Comparison of Distance Measures.

J Paparrizos, C Liu, AJ Elmore, MJ Franklin - IEEE Data Eng. Bull., 2023 - paparrizos.org
Distance measures are core building blocks in time-series analysis and the subject of active
research for decades. Unfortunately, the most detailed experimental study in this area is …

DeepSketch: A Query Sketching Interface for Deep Time Series Similarity Search

Z Zhang, Z Shao, A Crotty - Proceedings of the VLDB Endowment, 2024 - dl.acm.org
By empowering domain experts to perform interactive exploration of large time series
datasets, sketch-based query interfaces have revitalized interest in the well-studied problem …

Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search

J Wei, X Lee, Z Liao, T Palpanas, B Peng - Proceedings of the ACM on …, 2025 - dl.acm.org
Approximate Nearest Neighbor (ANN) search in high-dimensional Euclidean spaces is a
fundamental problem with a wide range of applications. However, there is currently no ANN …

Efficient Similarity Search Algorithms for Large Datasets

BN Arunakumari, V Swain… - 2024 15th International …, 2024 - ieeexplore.ieee.org
Efficiently finding similar items in large datasets is a crucial task with applications in various
domains. This abstract presents a survey of algorithms and techniques designed for this …