On the Cost of Mining Very Large Open Source Repositories

Sean Banerjee, B. Cukic
{"title":"On the Cost of Mining Very Large Open Source Repositories","authors":"Sean Banerjee, B. Cukic","doi":"10.1109/BIGDSE.2015.16","DOIUrl":null,"url":null,"abstract":"Open source bug tracking systems provide a rich information suite that is actively used by software engineering researchers to design solutions to triaging, duplicate classification and developer assignment problems. Today, open repositories often contain in excess of 100, 000 reports, and in cases of RedHat and Mozilla, over a million. Obtaining and analyzing the contents of such datasets are both time and resource consuming. By summarizing the related work we demonstrate that researchers often focused on smaller subsets of the data, and seldom embrace the “big-dataism”. With the emergence of cloud based computation systems such as Amazon EC2, one expects it to be easier to perform large scale analyses. However, our detailed time and cost analysis indicates that significant challenges still remain. Acquiring the open source data can be time intensive, and prone to being misinterpreted as Denial of Service attacks. Generating similarity scores for all prior reports, for example, is a polynomial time problem. In this paper, we present actual costs that we incurred when analyzing the complete repositories from Eclipse, Firefox and Open Office. In our approach, we relied on computing clusters to process the data in an attempt to reduce the cost of analyzing large datasets on the cloud. We present estimated costs for a researcher attempting to analyze complete datasets from Eclipse, Mozilla, Novell and RedHat using the best possible resources. In an ideal situation, with no bottlenecks, a researcher investing just over $40, 000 and 2 weeks of non stop computing time would be able to measure similarity of problem reports within all four datasets.","PeriodicalId":122056,"journal":{"name":"2015 IEEE/ACM 1st International Workshop on Big Data Software Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE/ACM 1st International Workshop on Big Data Software Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BIGDSE.2015.16","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

Open source bug tracking systems provide a rich information suite that is actively used by software engineering researchers to design solutions to triaging, duplicate classification and developer assignment problems. Today, open repositories often contain in excess of 100, 000 reports, and in cases of RedHat and Mozilla, over a million. Obtaining and analyzing the contents of such datasets are both time and resource consuming. By summarizing the related work we demonstrate that researchers often focused on smaller subsets of the data, and seldom embrace the “big-dataism”. With the emergence of cloud based computation systems such as Amazon EC2, one expects it to be easier to perform large scale analyses. However, our detailed time and cost analysis indicates that significant challenges still remain. Acquiring the open source data can be time intensive, and prone to being misinterpreted as Denial of Service attacks. Generating similarity scores for all prior reports, for example, is a polynomial time problem. In this paper, we present actual costs that we incurred when analyzing the complete repositories from Eclipse, Firefox and Open Office. In our approach, we relied on computing clusters to process the data in an attempt to reduce the cost of analyzing large datasets on the cloud. We present estimated costs for a researcher attempting to analyze complete datasets from Eclipse, Mozilla, Novell and RedHat using the best possible resources. In an ideal situation, with no bottlenecks, a researcher investing just over $40, 000 and 2 weeks of non stop computing time would be able to measure similarity of problem reports within all four datasets.
关于挖掘超大型开源存储库的成本
开源bug跟踪系统提供了丰富的信息套件,软件工程研究人员积极使用它来设计分类、重复分类和开发人员分配问题的解决方案。今天,开放存储库通常包含超过10万个报告,在RedHat和Mozilla的案例中,超过100万个。获取和分析这些数据集的内容既费时又耗资源。通过对相关工作的总结,我们发现研究人员往往只关注较小的数据子集,很少拥抱“大数据主义”。随着基于云计算系统(如Amazon EC2)的出现,人们期望执行大规模分析变得更加容易。然而,我们详细的时间和成本分析表明,重大挑战仍然存在。获取开源数据可能非常耗时,而且容易被误解为拒绝服务攻击。例如,为所有先前的报告生成相似性分数是一个多项式时间问题。在本文中,我们展示了在分析来自Eclipse、Firefox和Open Office的完整存储库时所产生的实际成本。在我们的方法中,我们依靠计算集群来处理数据,试图降低分析云上大型数据集的成本。我们给出了研究人员使用最好的资源分析来自Eclipse、Mozilla、Novell和RedHat的完整数据集的估计成本。在没有瓶颈的理想情况下,研究人员只需投入超过40,000美元和两周的不间断计算时间,就可以测量所有四个数据集中问题报告的相似性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信