Chun-Wei Lin, T. Hong, Hong-Yu Lee, Shyue-Liang Wang
{"title":"动态数据库中预大型FUSP树的维护","authors":"Chun-Wei Lin, T. Hong, Hong-Yu Lee, Shyue-Liang Wang","doi":"10.1109/IBICA.2011.54","DOIUrl":null,"url":null,"abstract":"In the past, pre-large fast-updated sequential pattern trees (pre-large FUSP tree) were proposed for efficiently mining large sequences for record insertion and deletion, respectively. In this paper, we thus proposed a maintenance approach for efficiently maintaining pre-large FUSP trees and effectively deriving desired large sequences when data in databases are modified. Experimental results also show that the proposed algorithm has a better performance in execution time.","PeriodicalId":158080,"journal":{"name":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Maintenance of Pre-large FUSP Trees in Dynamic Databases\",\"authors\":\"Chun-Wei Lin, T. Hong, Hong-Yu Lee, Shyue-Liang Wang\",\"doi\":\"10.1109/IBICA.2011.54\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the past, pre-large fast-updated sequential pattern trees (pre-large FUSP tree) were proposed for efficiently mining large sequences for record insertion and deletion, respectively. In this paper, we thus proposed a maintenance approach for efficiently maintaining pre-large FUSP trees and effectively deriving desired large sequences when data in databases are modified. Experimental results also show that the proposed algorithm has a better performance in execution time.\",\"PeriodicalId\":158080,\"journal\":{\"name\":\"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IBICA.2011.54\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Second International Conference on Innovations in Bio-inspired Computing and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IBICA.2011.54","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Maintenance of Pre-large FUSP Trees in Dynamic Databases
In the past, pre-large fast-updated sequential pattern trees (pre-large FUSP tree) were proposed for efficiently mining large sequences for record insertion and deletion, respectively. In this paper, we thus proposed a maintenance approach for efficiently maintaining pre-large FUSP trees and effectively deriving desired large sequences when data in databases are modified. Experimental results also show that the proposed algorithm has a better performance in execution time.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
