基于婚姻的蜜蜂优化物化视角选择

B. Arun, T. Kumar
{"title":"基于婚姻的蜜蜂优化物化视角选择","authors":"B. Arun, T. Kumar","doi":"10.4018/IJNCR.2015070101","DOIUrl":null,"url":null,"abstract":"Data warehouse was designed to cater to the strategic decision making needs of an organization. Most queries posed on them are on-line analytical queries, which are complex and computation intensive in nature and have high query response times when processed against a large data warehouse. This time can be substantially reduced by materializing pre-computed summarized views and storing them in a data warehouse. All possible views cannot be materialized due to storage space constraints. Also, an optimal selection of subsets of views is shown to be an NP-Complete problem. This problem of view selection has been addressed in this paper by selecting a beneficial set of views, from amongst all possible views, using the swarm intelligence technique Marriage in Honey Bees Optimization MBO. An MBO based view selection algorithm MBOVSA, which aims to select views that incur the minimum total cost of evaluating all the views TVEC, is proposed. In MBOVSA, the search has been intensified by incorporating the royal jelly feeding phase into MBO. MBOVSA, when compared with the most fundamental greedy based view selection algorithm HRUA, is able to select comparatively better quality views.","PeriodicalId":369881,"journal":{"name":"Int. J. Nat. Comput. Res.","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":"{\"title\":\"Materialized View Selection using Marriage in Honey Bees Optimization\",\"authors\":\"B. Arun, T. Kumar\",\"doi\":\"10.4018/IJNCR.2015070101\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Data warehouse was designed to cater to the strategic decision making needs of an organization. Most queries posed on them are on-line analytical queries, which are complex and computation intensive in nature and have high query response times when processed against a large data warehouse. This time can be substantially reduced by materializing pre-computed summarized views and storing them in a data warehouse. All possible views cannot be materialized due to storage space constraints. Also, an optimal selection of subsets of views is shown to be an NP-Complete problem. This problem of view selection has been addressed in this paper by selecting a beneficial set of views, from amongst all possible views, using the swarm intelligence technique Marriage in Honey Bees Optimization MBO. An MBO based view selection algorithm MBOVSA, which aims to select views that incur the minimum total cost of evaluating all the views TVEC, is proposed. In MBOVSA, the search has been intensified by incorporating the royal jelly feeding phase into MBO. MBOVSA, when compared with the most fundamental greedy based view selection algorithm HRUA, is able to select comparatively better quality views.\",\"PeriodicalId\":369881,\"journal\":{\"name\":\"Int. J. Nat. Comput. Res.\",\"volume\":\"69 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"22\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Nat. Comput. Res.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4018/IJNCR.2015070101\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Nat. Comput. Res.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/IJNCR.2015070101","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 22

摘要

数据仓库的设计是为了满足组织的战略决策需求。对它们提出的大多数查询都是在线分析查询,这在本质上是复杂和计算密集型的,并且在针对大型数据仓库处理时具有很高的查询响应时间。通过物化预先计算的汇总视图并将其存储在数据仓库中,可以大大减少这段时间。由于存储空间的限制,无法实现所有可能的视图。此外,视图子集的最优选择被证明是一个np完全问题。本文通过在所有可能的视图中选择一组有益的视图来解决视图选择问题,并使用蜜蜂优化MBO中的群体智能技术婚姻。提出了一种基于MBO的视图选择算法MBOVSA,该算法的目标是选择计算所有视图TVEC的总成本最小的视图。在MBOVSA中,通过将蜂王浆饲喂阶段纳入MBO,搜索得到了加强。与最基本的基于贪婪的视图选择算法HRUA相比,MBOVSA能够选择质量相对更好的视图。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Materialized View Selection using Marriage in Honey Bees Optimization
Data warehouse was designed to cater to the strategic decision making needs of an organization. Most queries posed on them are on-line analytical queries, which are complex and computation intensive in nature and have high query response times when processed against a large data warehouse. This time can be substantially reduced by materializing pre-computed summarized views and storing them in a data warehouse. All possible views cannot be materialized due to storage space constraints. Also, an optimal selection of subsets of views is shown to be an NP-Complete problem. This problem of view selection has been addressed in this paper by selecting a beneficial set of views, from amongst all possible views, using the swarm intelligence technique Marriage in Honey Bees Optimization MBO. An MBO based view selection algorithm MBOVSA, which aims to select views that incur the minimum total cost of evaluating all the views TVEC, is proposed. In MBOVSA, the search has been intensified by incorporating the royal jelly feeding phase into MBO. MBOVSA, when compared with the most fundamental greedy based view selection algorithm HRUA, is able to select comparatively better quality views.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Insights Into Incorporating Trustworthiness and Ethics in AI Systems With Explainable AI Concept Drift Adaptation in Intrusion Detection Systems Using Ensemble Learning Natural Computing of Human Facial Emotion Using Multi-Learning Fuzzy Approach Detection of Small Oranges Using YOLO v3 Feature Pyramid Mechanism Performance Parameter Evaluation of 7nm FinFET by Tuning Metal Work Function and High K Dielectrics
×
引用
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