ReJOOSp: Reinforcement Learning for Join Order Optimization in SPARQL

Author:

Warnke Benjamin1ORCID,Martens Kevin1,Winker Tobias1,Groppe Sven1ORCID,Groppe Jinghua1,Adhiyaman Prasad2,Srinivasan Sruthi2ORCID,Krishnakumar Shridevi2ORCID

Affiliation:

1. Institute of Information Systems, University of Lübeck, 23562 Lübeck, Germany

2. Centre for Advanced Data Science, Vellore Institute of Technology, Chennai 600127, India

Abstract

The choice of a good join order plays an important role in the query performance of databases. However, determining the best join order is known to be an NP-hard problem with exponential growth with the number of joins. Because of this, nonlearning approaches to join order optimization have a longer optimization and execution time. In comparison, the models of machine learning, once trained, can construct optimized query plans very quickly. Several efforts have applied machine learning to optimize join order for SQL queries outperforming traditional approaches. In this work, we suggest a reinforcement learning technique for join optimization for SPARQL queries, ReJOOSp. SPARQL queries typically contain a much higher number of joins than SQL queries and so are more difficult to optimize. To evaluate ReJOOSp, we further develop a join order optimizer based on ReJOOSp and integrate it into the Semantic Web DBMS Luposdate3000. The evaluation of ReJOOSp shows its capability to significantly enhance query performance by achieving high-quality execution plans for a substantial portion of queries across synthetic and real-world datasets.

Funder

Deutsche Forschungsgemeinschaft

German Federal Ministry of Education and Research within the funding program quantum technologies

Publisher

MDPI AG

Reference55 articles.

1. Scheufele, W., and Moerkotte, G. (1997, January 12–14). On the complexity of generating optimal plans with cross products. Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Tucson, AZ, USA.

2. Allam, J.R. (2018). Evaluation of a Greedy Join-Order Optimization Approach Using the IMDB Dataset. [Ph.D. Thesis, University of Magdeburg].

3. A Survey on Advancing the DBMS Query Optimizer: Cardinality Estimation, Cost Model, and Plan Enumeration;Lan;Data Sci. Eng.,2021

4. Amer-Yahia, S., Christophides, V., Kementsietsidis, A., Garofalakis, M.N., Idreos, S., and Leroy, V. (2014). Exploiting the query structure for efficient join ordering in SPARQL queries. EDBT, Proceedings of the International Conference on Extending Database Technology, Athens, Greece, 24–28 March 2014, Open Proceedings.

5. Marcus, R., and Papaemmanouil, O. (2018, January 10). Deep Reinforcement Learning for Join Order Enumeration. Proceedings of the First International Workshop on Exploiting Artificial Intelligence Techniques for Data Management, New York, NY, USA.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3