{"title":"流线型动态连续树动态指数研究","authors":"Lin Huo, Yinglu Tan","doi":"10.1109/ISISE.2010.35","DOIUrl":null,"url":null,"abstract":"Based on Streamline Dynamic Successive Trees, the paper proposes a dynamic index update method which update size is in character-level, The document-level index update algorithm and the character-level index update algorithm are based on SDST, and the performance of these 2 algorithms are compared, The efficiency of the character-level index update method is proved by experiment. The result shows that the performance of character-level update method is better than document-level.","PeriodicalId":206833,"journal":{"name":"2010 Third International Symposium on Information Science and Engineering","volume":"31 5","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Research on Dynamic Index of Streamline Dynamic Successive Trees\",\"authors\":\"Lin Huo, Yinglu Tan\",\"doi\":\"10.1109/ISISE.2010.35\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Based on Streamline Dynamic Successive Trees, the paper proposes a dynamic index update method which update size is in character-level, The document-level index update algorithm and the character-level index update algorithm are based on SDST, and the performance of these 2 algorithms are compared, The efficiency of the character-level index update method is proved by experiment. The result shows that the performance of character-level update method is better than document-level.\",\"PeriodicalId\":206833,\"journal\":{\"name\":\"2010 Third International Symposium on Information Science and Engineering\",\"volume\":\"31 5\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Third International Symposium on Information Science and Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISISE.2010.35\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Third International Symposium on Information Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISISE.2010.35","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Research on Dynamic Index of Streamline Dynamic Successive Trees
Based on Streamline Dynamic Successive Trees, the paper proposes a dynamic index update method which update size is in character-level, The document-level index update algorithm and the character-level index update algorithm are based on SDST, and the performance of these 2 algorithms are compared, The efficiency of the character-level index update method is proved by experiment. The result shows that the performance of character-level update method is better than document-level.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
