减少具有不同条件的非同义物化查询的查询处理时间

S. Chakraborty, Jyotika Doshi
{"title":"减少具有不同条件的非同义物化查询的查询处理时间","authors":"S. Chakraborty, Jyotika Doshi","doi":"10.4018/IJNCR.2019040104","DOIUrl":null,"url":null,"abstract":"Results of OLAP queries for strategic decision making are generated using warehouse data. For frequent queries, processing overhead increases as same results are generated by traversing through huge volume of warehouse data. Authors suggest saving time for frequent queries by storing them in a relational database referred as MQDB, along with its result and metadata information. Incremental updates for synonymous materialized queries are done using data marts. This article focusses on saving processing time for non-synonymous queries with differed criteria. Criteria is the query condition specified with ‘where' or a ‘having' clause apart from equijoin condition. Defined rules will determine if new results can be derived from existing stored results. If criteria of fired query are a subset of criteria in stored query, results are extracted from existing results using MINUS operation. When criteria are a superset of stored query criteria, new results are appended to existing results using the UNION operation.","PeriodicalId":369881,"journal":{"name":"Int. J. Nat. Comput. Res.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Reducing Query Processing Time for Non-Synonymous Materialized Queries With Differed Criteria\",\"authors\":\"S. Chakraborty, Jyotika Doshi\",\"doi\":\"10.4018/IJNCR.2019040104\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Results of OLAP queries for strategic decision making are generated using warehouse data. For frequent queries, processing overhead increases as same results are generated by traversing through huge volume of warehouse data. Authors suggest saving time for frequent queries by storing them in a relational database referred as MQDB, along with its result and metadata information. Incremental updates for synonymous materialized queries are done using data marts. This article focusses on saving processing time for non-synonymous queries with differed criteria. Criteria is the query condition specified with ‘where' or a ‘having' clause apart from equijoin condition. Defined rules will determine if new results can be derived from existing stored results. If criteria of fired query are a subset of criteria in stored query, results are extracted from existing results using MINUS operation. When criteria are a superset of stored query criteria, new results are appended to existing results using the UNION operation.\",\"PeriodicalId\":369881,\"journal\":{\"name\":\"Int. J. Nat. Comput. Res.\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Nat. Comput. Res.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4018/IJNCR.2019040104\",\"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.2019040104","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

用于战略决策制定的OLAP查询结果是使用仓库数据生成的。对于频繁的查询,处理开销会增加,因为通过遍历大量仓库数据生成相同的结果。作者建议将频繁查询与其结果和元数据信息一起存储在称为MQDB的关系数据库中,从而节省频繁查询的时间。同义物化查询的增量更新是使用数据集市完成的。本文主要关注如何节省具有不同标准的非同义查询的处理时间。Criteria是除equjoin条件外,用' where'或' having'子句指定的查询条件。已定义的规则将确定是否可以从现有存储的结果派生出新结果。如果触发查询的条件是存储查询中条件的子集,则使用MINUS操作从现有结果中提取结果。如果条件是存储查询条件的超集,则使用UNION操作将新结果附加到现有结果中。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Reducing Query Processing Time for Non-Synonymous Materialized Queries With Differed Criteria
Results of OLAP queries for strategic decision making are generated using warehouse data. For frequent queries, processing overhead increases as same results are generated by traversing through huge volume of warehouse data. Authors suggest saving time for frequent queries by storing them in a relational database referred as MQDB, along with its result and metadata information. Incremental updates for synonymous materialized queries are done using data marts. This article focusses on saving processing time for non-synonymous queries with differed criteria. Criteria is the query condition specified with ‘where' or a ‘having' clause apart from equijoin condition. Defined rules will determine if new results can be derived from existing stored results. If criteria of fired query are a subset of criteria in stored query, results are extracted from existing results using MINUS operation. When criteria are a superset of stored query criteria, new results are appended to existing results using the UNION operation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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