Litehst: A tree embedding based method for similarity search

Y Zeng, Y Tong, L Chen - Proceedings of the ACM on Management of …, 2023 - dl.acm.org
Similarity search is getting increasingly useful in real applications. This paper focuses on the
in-memory similarity search, ie, the range query and k nearest neighbor (kNN) query, under …

Towards a learned index structure for approximate nearest neighbor search query processing

M Hünemörder, P Kröger, M Renz - … 29–October 1, 2021, Proceedings 14, 2021 - Springer
In this short paper, we outline the idea of applying the concept of a learned index structure to
approximate nearest neighbor query processing. We discuss different data partitioning …

Reverse k-Nearest Neighbors Centrality Measures and Local Intrinsic Dimension

O Pedreira, S Marchand-Maillet, E Chávez - International Conference on …, 2020 - Springer
The estimation of local intrinsic dimensionality has applications ranging from adversarial
attack disclosure to clustering and outlier detection, indexing, and data fingerprinting. In this …

Query Processing

MHP Kröger, M Renz - … Germany, September 29–October 1, 2021 …, 2021 - books.google.com
In this short paper, we outline the idea of applying the concept of a learned index structure to
approximate nearest neighbor query processing. We discuss different data partitioning …