Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3665283.3665287acmotherconferencesArticle/Chapter ViewAbstractPublication PagesheartConference Proceedingsconference-collections
research-article
Open access

Learned Index Acceleration with FPGAs: A SMART Approach

Published: 19 June 2024 Publication History

Abstract

Indexes in database systems such as B+trees and hash tables are designed for fast data retrieval. These are created on columns of a table and serve as a pointer to map a key to the position of a record on a table. Much research has been conducted on topics related to the faster index. A learned index is one such area of study. Learned index approaches can achieve significant performance improvement over traditional indexing techniques. However, query performance with learned indexes is limited by the constraints imposed by the CPU architecture. FPGAs, on the other hand, offer a suitable alternative by offering energy efficiency and potentially better performance. This paper proposes a new methodology that considers the advantages of the learned index and FPGAs. This methodology is called the Selective Mathematical Operation AcceleRaTion (SMART) approach with an FPGA for an end-to-end acceleration of learned indexes. Being a hybrid between a CPU approach and an FPGA approach, the SMART model of index acceleration achieves higher throughput than the CPU-based implementation while maintaining the data structure storage on the CPU. Our SMART approach accelerated the radix spline (RS) learned index using a single FPGA without any off-chip memory resources. The resulting index, called SMART-RS, achieves an overall speedup of 5.5 × as compared to a CPU-based RS index on the SOSD benchmark datasets.

References

[1]
Amazon. [n. d.]. Amazon EC2. https://aws.amazon.com/ec2/instance-types/f1/.
[2]
Rajeev Bansal. 2017. Fundamentals of Numerical Methods. Chapter 4.13.
[3]
Jae Min Cho and Kiyoung Choi. 2014. An FPGA implementation of high-throughput key-value store using Bloom filter. In Technical Papers of 2014 International Symposium on VLSI Design, Automation and Test. 1–4. https://doi.org/10.1109/VLSI-DAT.2014.6834868
[4]
Paolo Ferragina and Giorgio Vinciguerra. 2020. The PGM-Index: A Fully-Dynamic Compressed Learned Index with Provable Worst-Case Bounds. Proc. VLDB Endow. 13, 8 (apr 2020), 1162–1175. https://doi.org/10.14778/3389133.3389135
[5]
Alex Galakatos, Michael Markovitch, Carsten Binnig, Rodrigo Fonseca, and Tim Kraska. 2019. FITing-Tree: A Data-Aware Index Structure. In Proceedings of the International Conference on Management of Data (Amsterdam, Netherlands) (SIGMOD ’19). 1189–1206. https://doi.org/10.1145/3299869.3319860
[6]
Zsolt István, Gustavo Alonso, Michaela Blott, and Kees Vissers. 2013. A flexible hash table design for 10GBPS key-value stores on FPGAS. In 2013 23rd International Conference on Field programmable Logic and Applications. 1–8. https://doi.org/10.1109/FPL.2013.6645520
[7]
Andreas Kipf, Ryan Marcus, Alexander van Renen, Mihail Stoian, Alfons Kemper, Tim Kraska, and Thomas Neumann. 2020. RadixSpline: A Single-Pass Learned Index. In Proceedings of the Third International Workshop on Exploiting Artificial Intelligence Techniques for Data Management (Portland, Oregon) (aiDM ’20). Article 5, 5 pages. https://doi.org/10.1145/3401071.3401659
[8]
Tim Kraska, Alex Beutel, Ed H. Chi, Jeffrey Dean, and Neoklis Polyzotis. 2018. The Case for Learned Index Structures. In Proceedings of the International Conference on Management of Data (Houston, TX, USA) (SIGMOD ’18). 489–504. https://doi.org/10.1145/3183713.3196909
[9]
Ryan Marcus, Andreas Kipf, and Alex van Renen. 2019. Searching on Sorted Data. https://doi.org/10.7910/DVN/JGVF9A
[10]
Thomas Neumann and Sebastian Michel. 2008. Smooth Interpolating Histograms with Error Guarantees. In Proceedings of the 25th British National Conference on Databases: Sharing Data, Information and Knowledge (Cardiff, Wales, UK) (BNCOD ’08). 126–138. https://doi.org/10.1007/978-3-540-70504-8_12
[11]
Patrick O’Neil, Edward Cheng, Dieter Gawlick, and Elizabeth O’Neil. 1996. The Log-Structured Merge-Tree (LSM-Tree). Acta Inf. 33, 4 (Jun 1996), 351–385. https://doi.org/10.1007/s002360050048
[12]
Weikang Qiao, Licheng Guo, Zhenman Fang, Mau-Chung Frank Chang, and Jason Cong. 2022. TopSort: A High-Performance Two-Phase Sorting Accelerator Optimized on HBM-based FPGAs. arxiv:2205.07991 [cs.AR]
[13]
Yunhui Qiu, Hankun Lv, Jinyu Xie, Wenbo Yin, and Lingli Wang. 2018. Ultra-Low-Latency and Flexible In-memory Key-Value Store System Design on CPU-FPGA. In 2018 International Conference on Field-Programmable Technology (FPT). 142–149. https://doi.org/10.1109/FPT.2018.00030
[14]
Nikola Samardzic, Weikang Qiao, Vaibhav Aggarwal, Mau-Chung Frank Chang, and Jason Cong. [n. d.]. Bonsai: High-Performance Adaptive Merge Tree Sorting. In Proceedings of the ACM/IEEE 47th Annual International Symposium on Computer Architecture (Virtual Event) (ISCA ’20). 282–294. https://doi.org/10.1109/ISCA45697.2020.00033
[15]
Nathan Zhang, Matthew Feldman, and Kunle Olukotun. 2021. High performance lattice regression on FPGAs via a high level hardware description language. In 2021 International Conference on Field-Programmable Technology (ICFPT). 1–10. https://doi.org/10.1109/ICFPT52863.2021.9609893

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
HEART '24: Proceedings of the 14th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies
June 2024
147 pages
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 June 2024

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. FPGA
  2. Learned Index
  3. SQL.

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Conference

HEART 2024

Acceptance Rates

Overall Acceptance Rate 22 of 50 submissions, 44%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 188
    Total Downloads
  • Downloads (Last 12 months)188
  • Downloads (Last 6 weeks)38
Reflects downloads up to 01 Jan 2025

Other Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format.

HTML Format

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media