期刊文献+

StringB-tree在软件复用中的应用研究

Research on the Application of the String B-tree in Software Duplica tion
下载PDF
导出
摘要 提出了将StringB-tree用于解决软件复用中的参数化样式匹配问题(parameterizedpatternmatching)。通过对参数化字符串做一个变换,使用StringB-tree这种特殊的数据结构可提高匹配效率。文章的重点有两部分,一个是介绍了StringB-tree这种特殊的数据结构的优点及其构建过程;另一个是讲怎样利用StringB-tree解决参数化样式匹配问题。 this paper introduce that data structure String B-tree is used to solvethe parameterized pattern matching problem in software duplication.By making a small change and using the String B-tree,the identification efficiency of parameterized pattern matching can be boosted.The paper mainly includs two parts:one is the introduction of String B-tree and the other is the specific application of the String B tree in settling parameterized pattern matching.
出处 《计算机工程与应用》 CSCD 北大核心 2004年第29期166-168,共3页 Computer Engineering and Applications
关键词 字符串平衡树参数化字符串 参数化样式匹配 P-匹配 P-出现 String B-tree,P-string,parameterized pattern matching,P-match,P-occurance
  • 相关文献

参考文献7

  • 1Brenda S Baker. Parameterized Pattern Matching:Algorithms and Application[J].computer and system science
  • 2Paolo Ferragina,Roberto Grossi.The string B-tree :a new data structure for string search in external memory and it's applications[J].Journal of the ACM, 1999 ;46 (2): 236~280
  • 3B Baker. A theory of parameterized pattern matching:Algorithms and applications[C].In:proceedings of the 25th ACM Symposium on Theory of Computing, 1993
  • 4Bronda S Baker. Paraneterized Pattern Matching by Boyer-Moore-type Algorithm
  • 5Udi Manber,Gene Myer. Suffix arrays:A new method for on-line string searches. 1991
  • 6Stefan Burkhardt,Juha Karkkainen. Fast lightweight Suffix Array Construction and checking
  • 7http : //en. wikipedia.org/wiki/Patricia_trie

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部