Handling data-skewness in character based string similarity join using Hadoop
| Autor: | Devendra K. Tayal, Oscar Castillo, Amita Jain, Kanak Meena |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Theoretical computer science
Zipf's law Computer science Joins 02 engineering and technology Computer Science Applications Set (abstract data type) Similarity (network science) Skewness 020204 information systems Scalability 0202 electrical engineering electronic engineering information engineering Join (sigma algebra) 020201 artificial intelligence & image processing String metric Software Information Systems |
| Zdroj: | Applied Computing and Informatics. 18:22-44 |
| ISSN: | 2210-8327 2634-1964 |
| DOI: | 10.1016/j.aci.2018.11.001 |
| Popis: | The scalability of similarity joins is threatened by the unexpected data characteristic of data skewness. This is a pervasive problem in scientific data. Due to skewness, the uneven distribution of attributes occurs, and it can cause a severe load imbalance problem. When database join operations are applied to these datasets, skewness occurs exponentially. All the algorithms developed to date for the implementation of database joins are highly skew sensitive. This paper presents a new approach for handling data-skewness in a character- based string similarity join using the MapReduce framework. In the literature, no such work exists to handle data skewness in character-based string similarity join, although work for set based string similarity joins exists. Proposed work has been divided into three stages, and every stage is further divided into mapper and reducer phases, which are dedicated to a specific task. The first stage is dedicated to finding the length of strings from a dataset. For valid candidate pair generation, MR-Pass Join framework has been suggested in the second stage. MRFA concepts are incorporated for string similarity join, which is named as “MRFA-SSJ” (MapReduce Frequency Adaptive – String Similarity Join) in the third stage which is further divided into four MapReduce phases. Hence, MRFA-SSJ has been proposed to handle skewness in the string similarity join. The experiments have been implemented on three different datasets namely: DBLP, Query log and a real dataset of IP addresses & Cookies by deploying Hadoop framework. The proposed algorithm has been compared with three known algorithms and it has been noticed that all these algorithms fail when data is highly skewed, whereas our proposed method handles highly skewed data without any problem. A set-up of the 15-node cluster has been used in this experiment, and we are following the Zipf distribution law for the analysis of skewness factor. Also, a comparison among existing and proposed techniques has been shown. Existing techniques survived till Zipf factor 0.5 whereas the proposed algorithm survives up to Zipf factor 1. Hence the proposed algorithm is skew insensitive and ensures scalability with a reasonable query processing time for string similarity database join. It also ensures the even distribution of attributes. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|