MinJoin++: a fast algorithm for string similarity joins under edit distance

We study the problem of computing similarity joins under edit distance on a set of strings. Edit similarity joins is a fundamental problem in databases, data mining and bioinformatics. It finds many applications in data cleaning and integration, collaborative filtering, genome sequence assembly, etc...

Full description

Bibliographic Details

Published in:	The VLDB journal Vol. 33; no. 2; pp. 281 - 299
Main Authors:	Karpov, Nikolai, Zhang, Haoyu, Zhang, Qin
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2024 Springer Nature B.V
Subjects:	Accuracy Algorithms Bioinformatics Computer Science Data mining Database Management Datasets Genomes Regular Paper Run time (computers) Similarity Strings String similarity joins Edit distance Local hash minima
ISSN:	1066-8888, 0949-877X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!