A Genetic Algorithm for Query Optimization in Database Grid by Dynamic Cost Estimation

Peyman Arebi, Navid Gonbadipoor
{"title":"A Genetic Algorithm for Query Optimization in Database Grid by Dynamic Cost Estimation","authors":"Peyman Arebi, Navid Gonbadipoor","doi":"10.1109/UKSIM.2011.25","DOIUrl":null,"url":null,"abstract":"increasing data volume in the database of organizations especially those that are multicluster and geographically extensive cause a lot of problems in data storage, retrieve and transmition. In addition, data integration related to database existed in different geographical positions is too risky with the respect of security and velocity of transaction executing and generally posses some disadvantages which can be solved by using the grid database and leads to more efficient function. Therefore, with internet extension among the organizations and institutes and also accordance of grid architecture to it, development of database in grid environments is inevitable. In order to establish a structure for data storing in the width of a grid environment in distributed and heterogonous from tries to storage and distribute data in a wide geographical region. Because of extension and high volume of data, transaction processing in such an environment is complexity and time-consuming. It is obvious that if non-optimal queries are used, transaction efficiency in this database will considerably be decreased. But if appropriate optimal algorithms are used, this efficiency will be so much increased. There are a lot of algorithms suggested for optimization of queries. However, due to difference of grid environments, different optimal algorithms are required. In this study presented algorithm is according to the structure of grid measurement and through a novel solving performs a good function in high data volume grid base systems.","PeriodicalId":161995,"journal":{"name":"2011 UkSim 13th International Conference on Computer Modelling and Simulation","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 UkSim 13th International Conference on Computer Modelling and Simulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/UKSIM.2011.25","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

increasing data volume in the database of organizations especially those that are multicluster and geographically extensive cause a lot of problems in data storage, retrieve and transmition. In addition, data integration related to database existed in different geographical positions is too risky with the respect of security and velocity of transaction executing and generally posses some disadvantages which can be solved by using the grid database and leads to more efficient function. Therefore, with internet extension among the organizations and institutes and also accordance of grid architecture to it, development of database in grid environments is inevitable. In order to establish a structure for data storing in the width of a grid environment in distributed and heterogonous from tries to storage and distribute data in a wide geographical region. Because of extension and high volume of data, transaction processing in such an environment is complexity and time-consuming. It is obvious that if non-optimal queries are used, transaction efficiency in this database will considerably be decreased. But if appropriate optimal algorithms are used, this efficiency will be so much increased. There are a lot of algorithms suggested for optimization of queries. However, due to difference of grid environments, different optimal algorithms are required. In this study presented algorithm is according to the structure of grid measurement and through a novel solving performs a good function in high data volume grid base systems.
基于动态代价估计的数据库网格查询优化遗传算法
随着组织数据库中数据量的不断增加,特别是对于多集群和地理分布广泛的组织来说,数据的存储、检索和传输都存在很多问题。此外,存在于不同地理位置的与数据库相关的数据集成在安全性和事务执行速度方面风险太大,通常存在一些缺点,这些缺点可以通过使用网格数据库来解决,从而提高功能的效率。因此,随着互联网在组织和机构之间的扩展,以及网格体系结构与之相适应,网格环境下的数据库开发是必然的。为了建立一种数据存储结构,在宽的网格环境下,从分布式和异构的角度尝试在宽的地理区域内存储和分布数据。由于扩展和大量数据,在这样的环境中处理事务既复杂又耗时。很明显,如果使用非最优查询,该数据库中的事务效率将大大降低。但如果使用适当的优化算法,效率将大大提高。有很多优化查询的算法。然而,由于网格环境的不同,需要不同的优化算法。本文提出的算法是根据网格测量的结构,通过一种新颖的求解方法,在大数据量的网格基系统中发挥了良好的作用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信