Efficient Compilation of Regular Path Queries
| dc.contributor.author | Tetzel, Frank | |
| dc.contributor.author | Lehner, Wolfgang | |
| dc.contributor.author | Kasperovics, Romans | |
| dc.date.accessioned | 2021-05-04T09:38:37Z | |
| dc.date.available | 2021-05-04T09:38:37Z | |
| dc.date.issued | 2020 | |
| dc.description.abstract | Ad hoc code generation is a state-of-the-art processing paradigm for database execution engines. It minimizes resource consumption by generating specialized code, tailored and streamlined for the single query at hand. In this work, we apply ad hoc code generation to regular path queries (RPQs), an advanced query type in declarative graph query languages. We investigate code generation from multiple angles. We propose COAT, an embedded domain specific language (EDSL) in C++ to improve accessibility of code generation by simplifying the interaction with compiler APIs. Furthermore, we analyze and compare two back ends for COAT providing the just-in-time (JIT) compilation functionality: LLVM, a compiler framework popularly used in databases for code generation, and AsmJit, a JIT assembler with very low compilation latency. We evaluate various compilation techniques for RPQs on different synthetic graph workloads. | de |
| dc.identifier.doi | 10.1007/s13222-020-00353-9 | |
| dc.identifier.pissn | 1610-1995 | |
| dc.identifier.uri | http://dx.doi.org/10.1007/s13222-020-00353-9 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/36413 | |
| dc.publisher | Springer | |
| dc.relation.ispartof | Datenbank-Spektrum: Vol. 20, No. 3 | |
| dc.relation.ispartofseries | Datenbank-Spektrum | |
| dc.subject | Code generation | |
| dc.subject | Embedded domain specific language | |
| dc.subject | Regular path queries | |
| dc.title | Efficient Compilation of Regular Path Queries | de |
| dc.type | Text/Journal Article | |
| gi.citation.endPage | 259 | |
| gi.citation.startPage | 243 |