基于非反单调约束的冰山立方体计算方法

Yuntian Feng, Hongjun Zhang, Wenning Hao, Gang Chen
{"title":"基于非反单调约束的冰山立方体计算方法","authors":"Yuntian Feng, Hongjun Zhang, Wenning Hao, Gang Chen","doi":"10.1109/ISCC-C.2013.20","DOIUrl":null,"url":null,"abstract":"To compute iceberg cube based on non-antimonotonic constraint, we propose a modified Star-Cubing method by means of converting constraint by top-k. It uses a method of top-k to convert a constraint to an antimonotonic constraint and carries out the star-reduction in the base cuboid table, thus reduces the cost of the shared dimension pruning in Star-Cubing. Experimental results show that the method could compute iceberg cube based on non-antimonotonic constraint availably and improve the efficiency of computation method at the same time.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2013-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Method of Computing Iceberg Cube Based on Non-antimonotonic Constraint\",\"authors\":\"Yuntian Feng, Hongjun Zhang, Wenning Hao, Gang Chen\",\"doi\":\"10.1109/ISCC-C.2013.20\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To compute iceberg cube based on non-antimonotonic constraint, we propose a modified Star-Cubing method by means of converting constraint by top-k. It uses a method of top-k to convert a constraint to an antimonotonic constraint and carries out the star-reduction in the base cuboid table, thus reduces the cost of the shared dimension pruning in Star-Cubing. Experimental results show that the method could compute iceberg cube based on non-antimonotonic constraint availably and improve the efficiency of computation method at the same time.\",\"PeriodicalId\":313511,\"journal\":{\"name\":\"2013 International Conference on Information Science and Cloud Computing Companion\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Information Science and Cloud Computing Companion\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCC-C.2013.20\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Information Science and Cloud Computing Companion","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCC-C.2013.20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

为了计算基于非反单调约束的冰山立方体,我们提出了一种改进的Star-Cubing方法,通过top-k转换约束。它采用top-k方法将约束转换为反单调约束,并在基长方体表中进行星约简,从而降低了星立方中共享维修剪的成本。实验结果表明,该方法可以有效地计算基于非反单调约束的冰山立方体,同时提高了计算方法的效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Method of Computing Iceberg Cube Based on Non-antimonotonic Constraint
To compute iceberg cube based on non-antimonotonic constraint, we propose a modified Star-Cubing method by means of converting constraint by top-k. It uses a method of top-k to convert a constraint to an antimonotonic constraint and carries out the star-reduction in the base cuboid table, thus reduces the cost of the shared dimension pruning in Star-Cubing. Experimental results show that the method could compute iceberg cube based on non-antimonotonic constraint availably and improve the efficiency of computation method at the same time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Commercial Bank Stress Tests Based on Credit Risk An Instant-Based Qur'an Memorizer Application Interface Optimization of PID Parameters Based on Improved Particle-Swarm-Optimization The Universal Approximation Capabilities of 2pi-Periodic Approximate Identity Neural Networks Survey of Cloud Messaging Push Notification Service
×
引用
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