This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License
|
||||||||
|
Paper Details
Paper Title
Survey on String Similarity Joins
Authors
  Ritika Jaiswal ,  Priyanka Nikam
Abstract
In case of the databases containing large number of data values in the form of strings, string similarity join operation plays an important role. Similarity join is used in data integration and data cleansing to find similar string pairs from two sets of strings. If the database contains very large number of rows, then such a comparison becomes extremely expensive. There are various algorithms to perform similarity join on strings, but each has its own pros and cons. It becomes very strenuous for the practitioners to decide which algorithm should be used in which scenario.
To help practitioners choose a suitable algorithm, we provide a comparative study on the existing string similarity join algorithms. We arrange the algorithms in different classes, based on their methodology. We also mention the strengths and weaknesses of these algorithms, to help practitioners pick an appropriate algorithm.
Keywords-
Publication Details
Unique Identification Number - IJEDR1602054Page Number(s) - 309-312Pubished in - Volume 4 | Issue 2 | April 2016DOI (Digital Object Identifier) -    Publisher - IJEDR (ISSN - 2321-9939)
Cite this Article
  Ritika Jaiswal ,  Priyanka Nikam,   "Survey on String Similarity Joins", International Journal of Engineering Development and Research (IJEDR), ISSN:2321-9939, Volume.4, Issue 2, pp.309-312, April 2016, Available at :http://www.ijedr.org/papers/IJEDR1602054.pdf
Article Preview
|
|
||||||
|