4.7 Article

A Learned Index for Exact Similarity Search in Metric Spaces

Journal

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
Volume 35, Issue 8, Pages 7624-7638

Publisher

IEEE COMPUTER SOC
DOI: 10.1109/TKDE.2022.3206441

Keywords

Learned index; multi-dimension; metric space

Ask authors/readers for more resources

This paper proposes a novel indexing approach called LIMS, which uses data clustering, pivot-based data transformation techniques, and learned indexes to support efficient similarity query processing in metric spaces. LIMS partitions the underlying data into clusters with relatively uniform data distribution and utilizes a small number of pivots for data redistribution. Similar data are mapped into compact regions with totally ordinal mapped values. Machine learning models approximate the position of each data record on disk, and efficient algorithms are designed for range queries, nearest neighbor queries, and index maintenance with dynamic updates.
Indexing is an effective way to support efficient query processing in large databases. Recently the concept of learned index, which replaces or complements traditional index structures with machine learning models, has been actively explored to reduce storage and search costs. However, accurate and efficient similarity query processing in high-dimensional metric spaces remains to be an open challenge. In this paper, we propose a novel indexing approach called LIMS that uses data clustering, pivot-based data transformation techniques and learned indexes to support efficient similarity query processing in metric spaces. In LIMS, the underlying data is partitioned into clusters such that each cluster follows a relatively uniform data distribution. Data redistribution is achieved by utilizing a small number of pivots for each cluster. Similar data are mapped into compact regions and the mapped values are totally ordinal. Machine learning models are developed to approximate the position of each data record on disk. Efficient algorithms are designed for processing range queries and nearest neighbor queries based on LIMS, and for index maintenance with dynamic updates. Extensive experiments on real-world and synthetic datasets demonstrate the superiority of LIMS compared with traditional indexes and state-of-the-art learned indexes.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available