GTS: GPU-based Tree Index for Fast Similarity Search

Similarity search, the task of identifying objects most similar to a given query object under a specific metric, has gathered significant attention due to its practical applications. However, the absence of coordinate information to accelerate similarity search and the high computational cost of mea...

Full description

Saved in:
Bibliographic Details
Main Authors: ZHU, Yifan, MA, Ruiyao, ZHENG, Baihua, KE, Xiangyu, CHEN, Lu, GAO, Yunjun
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2024
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/9041
https://ink.library.smu.edu.sg/context/sis_research/article/10044/viewcontent/GTS_av.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-10044
record_format dspace
spelling sg-smu-ink.sis_research-100442024-07-25T07:55:06Z GTS: GPU-based Tree Index for Fast Similarity Search ZHU, Yifan MA, Ruiyao ZHENG, Baihua KE, Xiangyu CHEN, Lu GAO, Yunjun Similarity search, the task of identifying objects most similar to a given query object under a specific metric, has gathered significant attention due to its practical applications. However, the absence of coordinate information to accelerate similarity search and the high computational cost of measuring object similarity hinder the efficiency of existing CPU-based methods. Additionally, these methods struggle to meet the demand for high throughput data management. To address these challenges, we propose GTS, a GPU-based tree index designed for the parallel processing of similarity search in general metric spaces, where only the distance metric for measuring object similarity is known. The GTS index utilizes a pivot-based tree structure to efficiently prune objects and employs list tables to facilitate GPU computing. To efficiently manage concurrent similarity queries with limited GPU memory, we have developed a two-stage search method that combines batch processing and sequential strategies to optimize memory usage. The paper also introduces an effective update strategy for the proposed GPU-based index, encompassing streaming data updates and batch data updates. Additionally, we present a cost model to evaluate search performance. Extensive experiments on five real-life datasets demonstrate that GTS achieves efficiency gains of up to two orders of magnitude over existing CPU baselines and up to 20x efficiency improvements compared to state-of-the-art GPU-based methods. 2024-06-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/9041 info:doi/10.1145/3654945 https://ink.library.smu.edu.sg/context/sis_research/article/10044/viewcontent/GTS_av.pdf http://creativecommons.org/licenses/by/3.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Metric Space Concurrent Similarity Search GPU-based Index Databases and Information Systems Numerical Analysis and Scientific Computing
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Metric Space
Concurrent Similarity Search
GPU-based Index
Databases and Information Systems
Numerical Analysis and Scientific Computing
spellingShingle Metric Space
Concurrent Similarity Search
GPU-based Index
Databases and Information Systems
Numerical Analysis and Scientific Computing
ZHU, Yifan
MA, Ruiyao
ZHENG, Baihua
KE, Xiangyu
CHEN, Lu
GAO, Yunjun
GTS: GPU-based Tree Index for Fast Similarity Search
description Similarity search, the task of identifying objects most similar to a given query object under a specific metric, has gathered significant attention due to its practical applications. However, the absence of coordinate information to accelerate similarity search and the high computational cost of measuring object similarity hinder the efficiency of existing CPU-based methods. Additionally, these methods struggle to meet the demand for high throughput data management. To address these challenges, we propose GTS, a GPU-based tree index designed for the parallel processing of similarity search in general metric spaces, where only the distance metric for measuring object similarity is known. The GTS index utilizes a pivot-based tree structure to efficiently prune objects and employs list tables to facilitate GPU computing. To efficiently manage concurrent similarity queries with limited GPU memory, we have developed a two-stage search method that combines batch processing and sequential strategies to optimize memory usage. The paper also introduces an effective update strategy for the proposed GPU-based index, encompassing streaming data updates and batch data updates. Additionally, we present a cost model to evaluate search performance. Extensive experiments on five real-life datasets demonstrate that GTS achieves efficiency gains of up to two orders of magnitude over existing CPU baselines and up to 20x efficiency improvements compared to state-of-the-art GPU-based methods.
format text
author ZHU, Yifan
MA, Ruiyao
ZHENG, Baihua
KE, Xiangyu
CHEN, Lu
GAO, Yunjun
author_facet ZHU, Yifan
MA, Ruiyao
ZHENG, Baihua
KE, Xiangyu
CHEN, Lu
GAO, Yunjun
author_sort ZHU, Yifan
title GTS: GPU-based Tree Index for Fast Similarity Search
title_short GTS: GPU-based Tree Index for Fast Similarity Search
title_full GTS: GPU-based Tree Index for Fast Similarity Search
title_fullStr GTS: GPU-based Tree Index for Fast Similarity Search
title_full_unstemmed GTS: GPU-based Tree Index for Fast Similarity Search
title_sort gts: gpu-based tree index for fast similarity search
publisher Institutional Knowledge at Singapore Management University
publishDate 2024
url https://ink.library.smu.edu.sg/sis_research/9041
https://ink.library.smu.edu.sg/context/sis_research/article/10044/viewcontent/GTS_av.pdf
_version_ 1814047714895200256