A partition-based method for string similarity joins with edit-distance constraints

DOI10.1145/2487259.2487261zbMATH Open1321.68553OpenAlexW2073112656MaRDI QIDQ2943532FDOQ2943532

Authors: Guoliang Li, Dong Deng, Jianhua Feng 

Publication date: 3 September 2015

Published in: ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2487259.2487261

Recommendations

• Bounded occurrence edit distance: a new metric for string similarity joins with edit distance constraints
• scientific article; zbMATH DE number 1945887
• A near-optimal similarity join algorithm and performance evaluation

zbMATH Keywords

edit distancesegment filterstring similarity join

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Database theory (68P15) Algorithms on strings (68W32)

Cited In (2)

• Bounded occurrence edit distance: a new metric for string similarity joins with edit distance constraints
• Time and space efficient large scale link discovery using string similarities

This page was built for publication: A partition-based method for string similarity joins with edit-distance constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943532)