{"title":"基于蚁群算法的移动数据库失效缓存模型","authors":"Yan Chu, Jianpei Zhang, Jing Yang","doi":"10.1109/ICICSE.2008.25","DOIUrl":null,"url":null,"abstract":"Mobile databases are always the core technique of the dynamic data management. Cache technique, as one of the key techniques in mobile databases, is able to reduce the contention of bandwidth and save the power energy. As the character of ant colony algorithm is choice, update, cooperation mechanism, which is accorded with the mobile agent. An invalidation cache model based on ant colony algorithm is proposed. Mobile agents are looked as different ants which are able to divide the work. Thus, the optimum result is received. The experimental results indicate that the enhancement is practical.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Invalidation Cache Model Based on Ant Colony Algorithm in Mobile Databases\",\"authors\":\"Yan Chu, Jianpei Zhang, Jing Yang\",\"doi\":\"10.1109/ICICSE.2008.25\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mobile databases are always the core technique of the dynamic data management. Cache technique, as one of the key techniques in mobile databases, is able to reduce the contention of bandwidth and save the power energy. As the character of ant colony algorithm is choice, update, cooperation mechanism, which is accorded with the mobile agent. An invalidation cache model based on ant colony algorithm is proposed. Mobile agents are looked as different ants which are able to divide the work. Thus, the optimum result is received. The experimental results indicate that the enhancement is practical.\",\"PeriodicalId\":333889,\"journal\":{\"name\":\"2008 International Conference on Internet Computing in Science and Engineering\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-01-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Conference on Internet Computing in Science and Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICSE.2008.25\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Internet Computing in Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICSE.2008.25","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Invalidation Cache Model Based on Ant Colony Algorithm in Mobile Databases
Mobile databases are always the core technique of the dynamic data management. Cache technique, as one of the key techniques in mobile databases, is able to reduce the contention of bandwidth and save the power energy. As the character of ant colony algorithm is choice, update, cooperation mechanism, which is accorded with the mobile agent. An invalidation cache model based on ant colony algorithm is proposed. Mobile agents are looked as different ants which are able to divide the work. Thus, the optimum result is received. The experimental results indicate that the enhancement is practical.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
