A novel query execution time prediction approach based on operator iterate-aware of the execution plan on the graph database

IF 5.2 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Journal of King Saud University-Computer and Information Sciences Pub Date : 2024-07-01 DOI:10.1016/j.jksuci.2024.102125
Zhenzhen He , Jiong Yu , Tiquan Gu
{"title":"A novel query execution time prediction approach based on operator iterate-aware of the execution plan on the graph database","authors":"Zhenzhen He ,&nbsp;Jiong Yu ,&nbsp;Tiquan Gu","doi":"10.1016/j.jksuci.2024.102125","DOIUrl":null,"url":null,"abstract":"<div><p>Query execution time prediction is essential for database query optimization tasks, such as query scheduling, progress monitoring, and resource allocation. In the query execution time prediction tasks, the query plan is often used as the modeling object of a prediction model. Although the learning-based prediction models have been proposed to capture plan features, there are two limitations need to be considered more. First, the parent–child dependencies between plan operators can be captured, but the operator’s branch independence cannot be distinguished. Second, each operator’s output row is its following operator input, but the data iterate transfer operations between operators are ignored. In this study, we propose a graph query execution time prediction model containing a plan module, a query module, a plan-query module, and a prediction module to improve prediction effectiveness. Specifically, the plan module is used to capture the data iterate transfer operations and distinguish independent of branch operators; the query module is used to learn features of query terms that have an influence on the composition of operators; the plan-query interaction module is used to learn the logical correlations of plan and query. The experiment on datasets proves the effectiveness of the operator iterate-aware and query-plan interaction method in our proposed graph query execution prediction model.</p></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":"36 6","pages":"Article 102125"},"PeriodicalIF":5.2000,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1319157824002143/pdfft?md5=ad7d539faf5eff6c98349863ba86037c&pid=1-s2.0-S1319157824002143-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of King Saud University-Computer and Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1319157824002143","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Query execution time prediction is essential for database query optimization tasks, such as query scheduling, progress monitoring, and resource allocation. In the query execution time prediction tasks, the query plan is often used as the modeling object of a prediction model. Although the learning-based prediction models have been proposed to capture plan features, there are two limitations need to be considered more. First, the parent–child dependencies between plan operators can be captured, but the operator’s branch independence cannot be distinguished. Second, each operator’s output row is its following operator input, but the data iterate transfer operations between operators are ignored. In this study, we propose a graph query execution time prediction model containing a plan module, a query module, a plan-query module, and a prediction module to improve prediction effectiveness. Specifically, the plan module is used to capture the data iterate transfer operations and distinguish independent of branch operators; the query module is used to learn features of query terms that have an influence on the composition of operators; the plan-query interaction module is used to learn the logical correlations of plan and query. The experiment on datasets proves the effectiveness of the operator iterate-aware and query-plan interaction method in our proposed graph query execution prediction model.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于操作员迭代感知图数据库执行计划的新型查询执行时间预测方法
查询执行时间预测对于查询调度、进度监控和资源分配等数据库查询优化任务至关重要。在查询执行时间预测任务中,查询计划通常被用作预测模型的建模对象。虽然基于学习的预测模型已被提出来捕捉计划特征,但有两个局限性需要更多考虑。首先,计划运算符之间的父子依赖关系可以捕获,但运算符分支的独立性无法区分。其次,每个操作符的输出行都是其后续操作符的输入,但忽略了操作符之间的数据迭代传输操作。在本研究中,我们提出了一种包含计划模块、查询模块、计划-查询模块和预测模块的图查询执行时间预测模型,以提高预测效果。具体来说,计划模块用于捕捉数据迭代转移操作并区分独立于分支算子的算子;查询模块用于学习对算子组成有影响的查询词特征;计划-查询交互模块用于学习计划和查询的逻辑关联。数据集实验证明了在我们提出的图查询执行预测模型中运算符迭代感知和查询计划交互方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
10.50
自引率
8.70%
发文量
656
审稿时长
29 days
期刊介绍: In 2022 the Journal of King Saud University - Computer and Information Sciences will become an author paid open access journal. Authors who submit their manuscript after October 31st 2021 will be asked to pay an Article Processing Charge (APC) after acceptance of their paper to make their work immediately, permanently, and freely accessible to all. The Journal of King Saud University Computer and Information Sciences is a refereed, international journal that covers all aspects of both foundations of computer and its practical applications.
期刊最新文献
Visually meaningful image encryption for secure and authenticated data transmission using chaotic maps Leukocyte segmentation based on DenseREU-Net Knowledge-embedded multi-layer collaborative adaptive fusion network: Addressing challenges in foggy conditions and complex imaging Feature-fused residual network for time series classification Low-light image enhancement: A comprehensive review on methods, datasets and evaluation metrics
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1