In recent years, relational databases successfully leverage reinforcement learning to optimize query plans. For graph databases and RDF quad stores, such research has been limited, so there is a need to understand the impact of reinforcement learning techniques. We explore a reinforcement learning-based join plan optimizer that we design specifically for optimizing join plans during SPARQL query planning. This paper presents key aspects of this method and highlights open research problems. We argue that while we can reuse aspects of relational database optimization, SPARQL query optimization presents unique challenges not encountered in relational databases. Nevertheless, initial benchmarks show promising results that warrant further exploration.
CITATION STYLE
Eschauzier, R., Taelman, R., Morren, M., & Verborgh, R. (2023). Reinforcement Learning-Based SPARQL Join Ordering Optimizer. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 13998 LNCS, pp. 43–47). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-43458-7_8
Mendeley helps you to discover research relevant for your work.