Non-relational Databases on FPGAs

• Verfasst von: Dann, Jonas [VerfasserIn]
• Verfasst von: Ritter, Daniel [VerfasserIn]
• Verfasst von: Fröning, Holger [VerfasserIn]
• Titel: Non-relational Databases on FPGAs
• Titelzusatz: Survey, Design Decisions, Challenges
• Verf.angabe: Jonas Dann, Daniel Ritter, Holger Fröning
• E-Jahr: 2023
• Jahr: 09 February 2023
• Umfang: 37 S.
• Fussnoten: Gesehen am 24.05.2023
• Titel Quelle: Enthalten in: Association for Computing MachineryACM computing surveys
• Ort Quelle: New York, NY : Association for Computing Machinery, 1969
• Jahr Quelle: 2023
• Band/Heft Quelle: 55(2023), 11, Artikel-ID $p1-37
• ISSN Quelle: 1557-7341
• DOI: doi:10.1145/3568990
• Datenträger: Online-Ressource
• Sprache: eng
• Sach-SW: Document
• Sach-SW: FPGA
• Sach-SW: graph
• Sach-SW: hardware acceleration
• Sach-SW: key-value
• Sach-SW: non-relational databases
• K10plus-PPN: 1846075254

Abstract

Non-relational database systems (NRDS) such as graph and key-value have gained attention in various trending business and analytical application domains. However, while CPU performance scaling becomes increasingly more difficult, field-programmable gate arrays (FPGA)- accelerated NRDS have not been systematically studied yet. This survey describes and categorizes the inherent differences and non-trivial tradeoffs of relevant NRDS classes (i.e., graph, document, key-value, and wide-column) as well as their commonalities in the context of common design decisions when building such a system with FPGAs. In particular, we highlight accelerator tasks, FPGA placement, accelerator design patterns, and justification for using FPGAs in different system contexts. We close with open research and engineering challenges to outline the future of FPGA-accelerated NRDS.