期刊文献+

基于q-gram的字符串相似性查询研究 被引量:4

Research on the String Similarity Query Based on q-gram
下载PDF
导出
摘要 相似性查询在实际应用中用途广泛,例如相似网页检测、相似图像检索、语言识别、数据清理等。而基于q-gram的字符串相似性查询作为主流方法之一,在查询的效率和灵活性上相对于其他方法都有很大的优势。实现基于q-gram的基本过滤器,并构成过滤器组合模型,用来过滤掉不匹配的字符串,得到候选集。实验结果表明,与传统的依靠编辑距离来比较每一对字符串的值相比,基于q-gram的过滤器能在保证相似性查询结果准确的前提下,在效率方面有显著的提升。 In practical applications, similarity query is widely used, such as detection of similar pages, similar image retrieval, language identifica- tion, data cleaning, and so on. As one of the main methods in similarity queries, q-gram method has a great advantage in both efficiency and flexibility. Based on the basic realization of the q-gram filter and the constitution of the filter pattern, and uses it to filter out the mismatching string to obtain the candidate set. The experimental result show that compared with the conventional edit distance method, the q-gram filter has markedly improved in efficiency while guarantee the accuracy of the similarity query results.
作者 米琳
出处 《现代计算机》 2014年第4期12-16,共5页 Modern Computer
基金 国家自然科学基金(No.61202161) 国家863项目(No.2012AA011804)
关键词 相似性查询 q-gram 过滤器 过滤器模型 Similarity Query q-gram Filter Filter Pattern
  • 相关文献

参考文献8

  • 1Jokinen P, Ukkonen E. Two Algorithms for Approximate String Matching in Static Texts[M]. Mathematical Foundations of Computer Science 1991. Springer Berlin Heidelberg, 1991:240-248.
  • 2Burkhardt S, Crauser A, Ferragina P, et al. Q-gram Based Database Searching Using a Suffix Array ( QUASAR ) [C]. Proceedings of the Third Annual International Conference on Computational Molecular Biology. ACM,1999:77-83.
  • 3Gravano L, Ipeirotis P G, Jagadish H V, et al. Approximate String Joins in a Database(almost)for Free[C]. VLDB. 2001, 1:491-500.
  • 4Li C, Lu J, Lu Y. Efficient Merging and Filtering Algorithms for Approximate String Searches[C]. Data Engineering, 2008. ICDE 2008. IEEE 24th International Conference on. IEEE, 2008:257-266.
  • 5Xiao C, Wang W, Lin X. Ed-join: an Efficient Algorithm for Similarity Joins with Edit Distance Constraints[J]. Proceedings of the VLDB Endowment, 2008, 1 (1): 933-9d4.
  • 6Sutinen E, Tarhio J. On Using Q-gram Locations in Approximate String Matching[M]. Algorithms--ESA'95. Springer Berlin Heidelberg, 1995:327-340.
  • 7Califano A, Rigoutsos I. FLASH: A Fast Look-Up Algorithm for String Homology[C]. Computer Vision and Pattern Recognition, 1993. Proceedings CVPR'93., 1993 IEEE Computer Society Conference on. IEEE, 1993:353-359.
  • 8Kernighan B W, Ritchie D M. The C Programming Language[M]. Englewood Cliffs: Prentice-Hall, 1988.

同被引文献5

引证文献4

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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