Hardware based accelerator for database query using M-tree

• Auteur principal: Chai, Kah Hieng
• Format: Thèse
• Langue: anglais
• Publié: 2018
• Sujets: TK Electrical engineering. Electronics Nuclear engineering
• Accès en ligne: http://eprints.utm.my/79262/1/ChaiKahHiengMFKE2018.pdf

Fast indexing is an indexing methods that sort the database and enable content to be accessed quickly. Fast query is part of fast indexing which able to perform the query within a narrow range to reduce the query time. In fast query, machine learning has played an important role on automate the tasks. In state-of-the-art, fast query algorithm are built using software where the performance of the query process is based on the performance of the general-purposed CPU. Besides, the total query time is linearly proportional to the data size where the difficulty of fast query is increasing as the data size increase which result in longer query time. Thus, a hardware accelerator for fast query is proposed in this work. M-tree is a fast indexing algorithm using tree data structure. M-tree data structure is constructed based on metric space and relied on triangle inequality which offer efficient range and k-nearest neighbor (k-NN) queries. The hardware accelerator is implemented using Xilinx’s Vivado Design Suite which targeted on FPGA platform. The hardware accelerator is coded using System Verilog HDL. The hardware accelerator is focusing on the fast query algorithm. The hardware accelerator is designed to be generic which could be implement on different FPGA board. The hardware accelerator has been evaluated by running the comparison on the performance with the existing work which is the M-tree algorithm running in software. The hardware accelerator is able to achieve significant speedup at approximatly 1000 times on the performance of query process compare to the M-tree running in software. The overall performance of the hardware accelerator for several scenario also shown the speedup compare to software based fast query.