Ed-Sjoin一种优化的字符串相似连接算法.pdfVIP

ISSN 计算机研究与发展 1000—1239／CN11-1777／TP of Researchand JournalComputer Development Ed—Sjoin：一种优化的字符串相似连接算法 李 璐‘王宏志 李建中 高 宏 (哈尔滨工业大学计算机科学与技术学院 哈尔滨 150001) (1ilu03555@163．com) for withEditDistance Joins Ed—sjoin：AnOptimalAlgorithmSimilarity Constraints Li Gao Lu，WangHongzhi，LiJianzhong，andHong (School Scienceand Institute 150001) ofComputer Technology，HarbinofTechnology。Harbin has Abstract been usedin asdata and Similarityjoin widely manyapplications，suchintegration ofthe edit—distance-basedisone cleaning，bioinformatics，andpatternrecognition．The similarityjoin most thereare basedon importantsimilarityjoinoperators．Recentlymanysimilarityjoinalgorithms editdistance．However，inthese isa amountofredundant algorithms，therelarge affectstheirefficiencies．Inthe ordertocalculate basedoneditdistance paper，In similarityjoin new two methodsand efficiently，a algorithm，Ed—Sjoin，isproposed，whichexploitsoptimalfiltering two redundant resultsshowthatthe prefix—based computationreducingmethods．Experimental inthis ismoreefficientthan algorithmpresentedpaper existingalgorithms． words Key similarityjoin；editdistance；prefix join)在数据清洗、生物信息、模式识别等应用领域中有着广泛应用，其中基 摘要相似连接(similarity 于编辑距离的字符串相似连接是一种重要的相似连接