EUVIMEDEUVIMED entdecken
Crossref

Evaluating String-Based Similarity Algorithms for Duplicate Record Identification in Databases

Mohammed Nasser Salem, Mohammed Fadhl Abdullah

Journal of Science and Technology · 14.02.2026 · 31 (2)

DOI: 10.20428/jst.v31i2.3566 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Science and Technology, online erschienen am 14.02.2026. Verfasst von Mohammed Nasser Salem und 1 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Duplicate records negatively affect the accuracy, reliability, and efficiency of database systems. This paper presents a comparative study of two widely used string-based similarity algorithms: Simil and Jaro–Winkler. Both algorithms measure textual similarity between records in order to identify entries that refer to the same real-world entity. The findings show that Simil is more operative for multi-word fields such as names and addresses, while Jaro–Winkler performs better for short words and typographical errors. The study highlights the strengths and limitations of both algorithms and provides practical guidance for their use in database duplicate detection systems. The study is helpful for academic interest and systems developers to get ideas about how to deal with unnecessary data and to improve the overall data quality.

Zitieren

APA

Salem, M. N., & Abdullah, M. F. (2026). Evaluating String-Based Similarity Algorithms for Duplicate Record Identification in Databases. Journal of Science and Technology, 31(2). https://doi.org/10.20428/jst.v31i2.3566

Vancouver

Salem MN, Abdullah MF. Evaluating String-Based Similarity Algorithms for Duplicate Record Identification in Databases. Journal of Science and Technology. 2026;31(2). doi:10.20428/jst.v31i2.3566

BibTeX
@article{Salem2026,
  author = {Salem, Mohammed Nasser and Abdullah, Mohammed Fadhl},
  title = {Evaluating String-Based Similarity Algorithms for Duplicate Record Identification in Databases},
  journal = {Journal of Science and Technology},
  year = {2026},
  volume = {31},
  number = {2},
  doi = {10.20428/jst.v31i2.3566}
}
Kostenlos starten →