Optimizing Nested Recursive Queries
Proceedings of the ACM on Management of Data · 12.03.2024 · 2 (1) · 1-27
DOI: 10.1145/3639271 ↗Kurz gefasst
Fachartikel in der Zeitschrift Proceedings of the ACM on Management of Data, online erschienen am 26.03.2024. Verfasst von Amir Shaikhha und 3 weiteren Autor:innen. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 75 Literaturangaben. Gefördert von: NSF.
Abstract (Originalsprache)
Datalog is a declarative programming language that has gained popularity in various domains due to its simplicity, expressiveness, and efficiency. But "pure" Datalog is limited to monotone queries, and cannot be used in most practical applications. For that reason, newer systems are relaxing the language by allowing non-monotone queries to be freely combined with recursion. But by departing from the elegant fixpoint semantics of pure datalog, these systems often result in inefficient query execution, for example they perform redundant computations, or use redundant storage. In this paper, we propose Temporel, a system that allows recursion to be freely combined with non-monotone operators. Temporel optimizes the program by compiling it into a novel intermediate representation that we call TempoDL. Our experimental results show that our system outperforms a state-of-the-art Datalog engine as well as a vectorized and a compiled in-memory database system for a wide range of applications from machine learning to graph processing.
Förderung
- NSF
Zitieren
APA
Shaikhha, A., Suciu, D., Schleich, M., & Ngo, H. (2024). Optimizing Nested Recursive Queries. Proceedings of the ACM on Management of Data, 2(1), 1-27. https://doi.org/10.1145/3639271
Vancouver
Shaikhha A, Suciu D, Schleich M, Ngo H. Optimizing Nested Recursive Queries. Proceedings of the ACM on Management of Data. 2024;2(1):1-27. doi:10.1145/3639271
BibTeX
@article{Shaikhha2024,
author = {Shaikhha, Amir and Suciu, Dan and Schleich, Maximilian and Ngo, Hung},
title = {Optimizing Nested Recursive Queries},
journal = {Proceedings of the ACM on Management of Data},
year = {2024},
volume = {2},
number = {1},
pages = {1--27},
doi = {10.1145/3639271}
}
EUVIMED