基于改进灰狼优化的多目标多连接查询优化

Q3 Engineering
Deepak Kumar, Sushil Kumar, Rohit Bansal
{"title":"基于改进灰狼优化的多目标多连接查询优化","authors":"Deepak Kumar, Sushil Kumar, Rohit Bansal","doi":"10.1504/IJAIP.2020.10019251","DOIUrl":null,"url":null,"abstract":"Nowadays information retrieved by a query is based upon extracting data across the world, which are located in different data sites. In distributed database management systems (DDBMS), due to partitioning or replication of data among several sites the relations required for an answer of a query may be stored at several data sites (DS). Many experimental results have showed that combination of optimal join order (OJO) and optimal selection of relations in query plan (QP) gives out better results compare to the several existing query optimising methodologies like teacher-learner based optimisation (TLBO), genetic algorithm (GA), etc. In this paper an approach has been proposed to compute a best optimal QP that could answer the user query with minimal cost values and minimum time using modified grey wolf optimisation algorithm (MGWO) which is multi-objective constrained. Proposed approach also aims for producing OJO in order to reduce the dimensionality complexity of the QP.","PeriodicalId":38797,"journal":{"name":"International Journal of Advanced Intelligence Paradigms","volume":"17 1","pages":"67-79"},"PeriodicalIF":0.0000,"publicationDate":"2020-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi-objective Multi-Join Query Optimization using Modified Grey Wolf Optimization\",\"authors\":\"Deepak Kumar, Sushil Kumar, Rohit Bansal\",\"doi\":\"10.1504/IJAIP.2020.10019251\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Nowadays information retrieved by a query is based upon extracting data across the world, which are located in different data sites. In distributed database management systems (DDBMS), due to partitioning or replication of data among several sites the relations required for an answer of a query may be stored at several data sites (DS). Many experimental results have showed that combination of optimal join order (OJO) and optimal selection of relations in query plan (QP) gives out better results compare to the several existing query optimising methodologies like teacher-learner based optimisation (TLBO), genetic algorithm (GA), etc. In this paper an approach has been proposed to compute a best optimal QP that could answer the user query with minimal cost values and minimum time using modified grey wolf optimisation algorithm (MGWO) which is multi-objective constrained. Proposed approach also aims for producing OJO in order to reduce the dimensionality complexity of the QP.\",\"PeriodicalId\":38797,\"journal\":{\"name\":\"International Journal of Advanced Intelligence Paradigms\",\"volume\":\"17 1\",\"pages\":\"67-79\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-04-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Advanced Intelligence Paradigms\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJAIP.2020.10019251\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Advanced Intelligence Paradigms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJAIP.2020.10019251","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0

摘要

如今,查询获取的信息是基于提取世界各地的数据,这些数据位于不同的数据站点。在分布式数据库管理系统(DDBMS)中,由于数据在多个站点之间进行分区或复制,查询答案所需的关系可能存储在多个数据站点(DS)中。许多实验结果表明,与基于教师-学习者的优化(TLBO)、遗传算法(GA)等几种现有的查询优化方法相比,查询计划(QP)中最优连接顺序(OJO)和关系最优选择相结合的查询优化方法具有更好的结果。本文提出了一种基于多目标约束的改进灰狼优化算法(MGWO),以最小的代价值和最短的时间来计算最优QP的方法。提出的方法还旨在生成OJO,以降低QP的维数复杂度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi-objective Multi-Join Query Optimization using Modified Grey Wolf Optimization
Nowadays information retrieved by a query is based upon extracting data across the world, which are located in different data sites. In distributed database management systems (DDBMS), due to partitioning or replication of data among several sites the relations required for an answer of a query may be stored at several data sites (DS). Many experimental results have showed that combination of optimal join order (OJO) and optimal selection of relations in query plan (QP) gives out better results compare to the several existing query optimising methodologies like teacher-learner based optimisation (TLBO), genetic algorithm (GA), etc. In this paper an approach has been proposed to compute a best optimal QP that could answer the user query with minimal cost values and minimum time using modified grey wolf optimisation algorithm (MGWO) which is multi-objective constrained. Proposed approach also aims for producing OJO in order to reduce the dimensionality complexity of the QP.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.70
自引率
0.00%
发文量
92
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信