{"title":"一种有效的开源存储库增量分析算法","authors":"Zhanyu Yang, Fu Xu, Zhibo Chen, Yu Sun","doi":"10.1145/3230348.3230461","DOIUrl":null,"url":null,"abstract":"Mining code repositories is a significant practice to detect the reuse of open source code in software engineering. As the existing analysis algorithms fail to meet the requirements of efficient large-scale open source analysis, this paper proposes an effective incremental analysis algorithm that can extract incremental text modifications by comparing snapshots in code repositories and then transform the above-mentioned text modifications into incremental functions through the application of mapping algorithm. Meanwhile, a fingerprint algorithm targeting incremental functions is put forward for efficient comparisons of functions. The experiments indicate that when dealing with large-scale code, the incremental analysis algorithm outperforms the traditional ones with less storage space and faster analysis speed.","PeriodicalId":188878,"journal":{"name":"Proceedings of the 2018 1st International Conference on Internet and e-Business","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Effective Incremental Analysis Algorithm of Open Source Repository\",\"authors\":\"Zhanyu Yang, Fu Xu, Zhibo Chen, Yu Sun\",\"doi\":\"10.1145/3230348.3230461\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mining code repositories is a significant practice to detect the reuse of open source code in software engineering. As the existing analysis algorithms fail to meet the requirements of efficient large-scale open source analysis, this paper proposes an effective incremental analysis algorithm that can extract incremental text modifications by comparing snapshots in code repositories and then transform the above-mentioned text modifications into incremental functions through the application of mapping algorithm. Meanwhile, a fingerprint algorithm targeting incremental functions is put forward for efficient comparisons of functions. The experiments indicate that when dealing with large-scale code, the incremental analysis algorithm outperforms the traditional ones with less storage space and faster analysis speed.\",\"PeriodicalId\":188878,\"journal\":{\"name\":\"Proceedings of the 2018 1st International Conference on Internet and e-Business\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-04-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2018 1st International Conference on Internet and e-Business\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3230348.3230461\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2018 1st International Conference on Internet and e-Business","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3230348.3230461","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Effective Incremental Analysis Algorithm of Open Source Repository
Mining code repositories is a significant practice to detect the reuse of open source code in software engineering. As the existing analysis algorithms fail to meet the requirements of efficient large-scale open source analysis, this paper proposes an effective incremental analysis algorithm that can extract incremental text modifications by comparing snapshots in code repositories and then transform the above-mentioned text modifications into incremental functions through the application of mapping algorithm. Meanwhile, a fingerprint algorithm targeting incremental functions is put forward for efficient comparisons of functions. The experiments indicate that when dealing with large-scale code, the incremental analysis algorithm outperforms the traditional ones with less storage space and faster analysis speed.