FPGA-based Query Acceleration for Non-Relational Databases
Summary: This project is a collaboration with SAP SE on the use of reconfigurable logic in the form of FPGAs for non-relational databases, such as graph databases or document databases. FPGAs are chosen as their low power consumption and high energy efficiency enables an unconstrained deployment at system level, thus they can easily be placed for instance in between main processor and memory. Then, FPGAs can take over complex, memory-intensive tasks to offload the CPU from this work. Graph Computations are a prime example for such memory-intensive computations, as their execution is highly data-driven and thus very often exhibits irregular memory access patterns. Other prime examples for such workload include other non-relational database workloads, such as for instance document processing by parsing JSON data.
People
- Holger Fröning (co-PI)
- Daniel Ritter (researcher at SAP)
- Jonas Dann (external PhD student)
- Royden Wagner (master student)
Collaborators
- Jana Giceva (TU Munich)
- Tobias Götz (SAP and TU Munich)
- Christian Faerber (Intel)
Contact
Dissemination
2024
- GraphScale: Scalable Processing on FPGAs for HBM and Large GraphsACM Trans. Reconfigurable Technol. Syst., 17(2), Association for Computing Machinery, 2024
@article{10.1145/3616497, author = {Dann, Jonas and Ritter, Daniel and Fr\"{o}ning, Holger}, title = {GraphScale: Scalable Processing on FPGAs for HBM and Large Graphs}, year = {2024}, issue_date = {June 2024}, publisher = {Association for Computing Machinery}, address = {New York, NY, USA}, volume = {17}, number = {2}, issn = {1936-7406}, url = {https://doi.org/10.1145/3616497}, doi = {10.1145/3616497}, journal = {ACM Trans. Reconfigurable Technol. Syst.}, month = mar, articleno = {22}, numpages = {23}, keywords = {FPGA, Graph processing, HBM}, }
- GraphMatch: Subgraph Query Processing on FPGAsCoRR, abs/2402.17559, 2024
@article{dann2024graphmatch, title = {GraphMatch: Subgraph Query Processing on FPGAs}, author = {Dann, Jonas and Götz, Tobias and Ritter, Daniel and Giceva, Jana and Fröning, Holger}, year = {2024}, volume = {abs/2402.17559}, journal = {CoRR}, url = {https://arxiv.org/abs/2402.17559}, doi = {10.48550/ARXIV.2402.17559}, }
2023
- Non-relational Databases on FPGAs: Survey, Design Decisions, ChallengesACM Comput. Surv., 55(11), 225:1–225:37, 2023
@article{DBLP:journals/csur/DannRF23, author = {Dann, Jonas and Ritter, Daniel and Fr{\"{o}}ning, Holger}, title = {Non-relational Databases on FPGAs: Survey, Design Decisions, Challenges}, journal = {{ACM} Comput. Surv.}, volume = {55}, number = {11}, pages = {225:1--225:37}, year = {2023}, url = {https://doi.org/10.1145/3568990}, doi = {10.1145/3568990}, timestamp = {Fri, 02 Jun 2023 01:00:00 +0200}, }
2022
- PipeJSON: Parsing JSON at Line Speed on FPGAsInternational Conference on Management of Data, DaMoN 2022, Philadelphia, PA, USA, 13 June 2022, 3:1–3:7, ACM, 2022
@inproceedings{DBLP:conf/damon/DannW0FF22, author = {Dann, Jonas and Wagner, Royden and Ritter, Daniel and Faerber, Christian and Fr{\"{o}}ning, Holger}, editor = {Blanas, Spyros and May, Norman}, title = {PipeJSON: Parsing {JSON} at Line Speed on FPGAs}, booktitle = {International Conference on Management of Data, DaMoN 2022, Philadelphia, PA, USA, 13 June 2022}, pages = {3:1--3:7}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3533737.3535094}, doi = {10.1145/3533737.3535094}, timestamp = {Wed, 15 Jun 2022 13:47:16 +0200}, }
- GraphScale: Scalable Bandwidth-Efficient Graph Processing on FPGAs32nd International Conference on Field-Programmable Logic and Applications, FPL 2022, Belfast, United Kingdom, August 29 - Sept. 2, 2022, 24–32, IEEE, 2022
@inproceedings{DBLP:conf/fpl/Dann0F22, author = {Dann, Jonas and Ritter, Daniel and Fr{\"{o}}ning, Holger}, title = {GraphScale: Scalable Bandwidth-Efficient Graph Processing on FPGAs}, booktitle = {32nd International Conference on Field-Programmable Logic and Applications, {FPL} 2022, Belfast, United Kingdom, August 29 - Sept. 2, 2022}, pages = {24--32}, publisher = {{IEEE}}, year = {2022}, url = {https://doi.org/10.1109/FPL57034.2022.00016}, doi = {10.1109/FPL57034.2022.00016}, timestamp = {Mon, 20 Feb 2023 17:38:16 +0100}, }
2021
- Exploring Memory Access Patterns for Graph Processing AcceleratorsDatenbanksysteme für Business, Technologie und Web (BTW 2021), 19. Fachtagung des GI-Fachbereichs ,,Datenbanken und Informationssysteme" (DBIS), 13.-17. September 2021, Dresden, Germany, Proceedings (LNI), P-311, 101–122, Gesellschaft für Informatik, Bonn, 2021
@inproceedings{DBLP:conf/btw/Dann0F21, author = {Dann, Jonas and Ritter, Daniel and Fr{\"{o}}ning, Holger}, editor = {Sattler, Kai{-}Uwe and Herschel, Melanie and Lehner, Wolfgang}, title = {Exploring Memory Access Patterns for Graph Processing Accelerators}, booktitle = {Datenbanksysteme f{\"{u}}r Business, Technologie und Web {(BTW} 2021), 19. Fachtagung des GI-Fachbereichs ,,Datenbanken und Informationssysteme" (DBIS), 13.-17. September 2021, Dresden, Germany, Proceedings}, series = {{LNI}}, volume = {{P-311}}, pages = {101--122}, publisher = {Gesellschaft f{\"{u}}r Informatik, Bonn}, year = {2021}, url = {https://doi.org/10.18420/btw2021-05}, doi = {10.18420/BTW2021-05}, timestamp = {Tue, 04 Jul 2023 17:43:09 +0200}, }
- Demystifying memory access patterns of FPGA-based graph processing acceleratorsGRADES-NDA ’21: 4th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA), Virtual Event, China, 20 June 2021, 3:1–3:10, ACM, 2021
@inproceedings{DBLP:conf/sigmod/Dann0F21, author = {Dann, Jonas and Ritter, Daniel and Fr{\"{o}}ning, Holger}, editor = {Kalavri, Vasiliki and Yakovets, Nikolay}, title = {Demystifying memory access patterns of FPGA-based graph processing accelerators}, booktitle = {{GRADES-NDA} '21: 4th {ACM} {SIGMOD} Joint International Workshop on Graph Data Management Experiences {\&} Systems {(GRADES)} and Network Data Analytics (NDA), Virtual Event, China, 20 June 2021}, pages = {3:1--3:10}, publisher = {{ACM}}, year = {2021}, url = {https://doi.org/10.1145/3461837.3464512}, doi = {10.1145/3461837.3464512}, timestamp = {Wed, 14 Jul 2021 16:01:02 +0200}, }
- Demystifying Memory Access Patterns of FPGA-Based Graph Processing AcceleratorsCoRR, abs/2104.07776, 2021
@article{DBLP:journals/corr/abs-2104-07776, author = {Dann, Jonas and Ritter, Daniel and Fr{\"{o}}ning, Holger}, title = {Demystifying Memory Access Patterns of FPGA-Based Graph Processing Accelerators}, journal = {CoRR}, volume = {abs/2104.07776}, year = {2021}, url = {https://arxiv.org/abs/2104.07776}, eprinttype = {arXiv}, eprint = {2104.07776}, timestamp = {Mon, 19 Apr 2021 01:00:00 +0200}, }
2020
- Non-Relational Databases on FPGAs: Survey, Design Decisions, ChallengesCoRR, abs/2007.07595, 2020
@article{DBLP:journals/corr/abs-2007-07595, author = {Dann, Jonas and Ritter, Daniel and Fr{\"{o}}ning, Holger}, title = {Non-Relational Databases on FPGAs: Survey, Design Decisions, Challenges}, journal = {CoRR}, volume = {abs/2007.07595}, year = {2020}, url = {https://arxiv.org/abs/2007.07595}, eprinttype = {arXiv}, eprint = {2007.07595}, timestamp = {Tue, 21 Jul 2020 01:00:00 +0200}, }
- Exploring Memory Access Patterns for Graph Processing AcceleratorsCoRR, abs/2010.13619, 2020
@article{DBLP:journals/corr/abs-2010-13619, author = {Dann, Jonas and Ritter, Daniel and Fr{\"{o}}ning, Holger}, title = {Exploring Memory Access Patterns for Graph Processing Accelerators}, journal = {CoRR}, volume = {abs/2010.13619}, year = {2020}, url = {https://arxiv.org/abs/2010.13619}, eprinttype = {arXiv}, eprint = {2010.13619}, timestamp = {Mon, 02 Nov 2020 00:00:00 +0100}, }