HJG: An effective hierarchical joint graph for ANNS in multi-metric spaces

• Main Authors: ZHU, Yifan, CHEN, Lu, GAO, Yunjun, MA, Ruiyao, ZHENG, Baihua, ZHAO, Jingwen
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2024
• Subjects: Accuracy; Costs; Filtering; Scalability; Graphics processing units; Extraterrestrial measurements; Search problems; Databases and Information Systems
• Online Access: https://ink.library.smu.edu.sg/sis_research/9285
• Institution: Singapore Management University

Owing to the widespread deployment of smartphones and networked devices, massive amount of data in different types are generated every day, including numeric data, locations, text data, images, etc. Nearest neighbour search in multi-metric spaces has attracted much attention, as it can accommodate any type of data and support search on flexible combinations of multiple metrics. However, most existing methods focus on single metric queries, failing to answer multi-metric queries efficiently due to the complex metric combinations. In this paper, for the first time, we study the approximate nearest neighbour search (ANNS) in multi-metric spaces, and propose HJG, a hierarchical joint graph, to solve the multi-metric query efficiently and effectively. HJG constructs hierarchical graphs for modeling objects of various types, and applies our presented balancing techniques to improve the graph distribution. To support efficient and accurate nearest neighbour search, we join individual graphs dynamically with high efficiency, and develop filtering techniques with efficient search strategy for HJG. Extensive experiments on four datasets demonstrate the superior effectiveness and scalability of our proposed HJG.