Non-relational Databases on FPGAs: Survey, Design Decisions, Challenges
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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
09 February 2023
|
| In: |
ACM computing surveys
Year: 2023, Volume: 55, Issue: 11 |
| ISSN: | 1557-7341 |
| DOI: | 10.1145/3568990 |
| Online Access: | Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1145/3568990
|
| Author Notes: | Jonas Dann, Daniel Ritter, Holger Fröning |
| Summary: | 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. |
|---|---|
| Item Description: | Gesehen am 24.05.2023 |
| Physical Description: | Online Resource |
| ISSN: | 1557-7341 |
| DOI: | 10.1145/3568990 |