| 摘要 |
PROBLEM TO BE SOLVED: To improve search speed without dropping search accuracy.SOLUTION: A host device uses a tree structure of kd-tree to divide vector group data in a database, organizes the vector group data in units of divided areas, copies the rearranged vector group data to a global memory of a GPU device, determines which area of the divided vector group data to be searched when receiving input of vector data of a query, and requests the GPU device for search in the determined area. The GPU device receiving the request performs a vector group in the divided area to be searched and distance calculation in parallel, obtains the shortest distance d and a vector ID(n) corresponding to it, and transfers those to a main memory of the host device side. Then, the host device outputs the distance d and the corresponding vector ID(n). |
