Incremental processing for string similarity join
by Cairong Yan; Bin Zhu; Yanglan Gan; Guangwei Xu
International Journal of Computational Science and Engineering (IJCSE), Vol. 20, No. 2, 2019

Abstract: String similarity join is an essential operation of data quality management and a key step to find the value of data. An incremental processing framework for string similarity join is proposed in this paper. Compared with the batching processing model, it can avoid the heavy time cost and the space cost brought by the duplicate similarity computation among historical strings and is suitable for processing data streams. We implement two algorithms: Inc-Join and Inp-Join. Inc-Join runs on a stand-alone machine while Inp-Join runs on a cluster with Spark environment. The experimental results show that this incremental processing framework can reduce the amount of string matching without affecting the join accuracy. When the data quantity becomes large, Inp-Join can make full use of the advantage of parallel processing and obtain a better performance than Inc-Join.

Online publication date: Fri, 29-Nov-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email