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.
dynamic index update size character-level
Lin Huo Yinglu Tan
Department of Computer and Electronic Information Guangxi University Nanning,China
国际会议
Third International Symposium on Information Science and Engineering(第三届信息科学与工程国际会议 ISISE 2010)
上海
英文
33-38
2010-12-24(万方平台首次上网日期,不代表论文的发表时间)