Record searching using dynamic blocking for entity resolution systems

Abstract

Entity Resolution also known as data matching or record linkage, is the task of identifying records from several databases that refer to the same entities. The efficiency of a blocking method is hindered by large blocks since the resulting number of record pairs is dominated by the sizes of these large blocks. So, the researchers are still doing researches on handling the problems of large blocks. Same blocking methods can yield bipolar results against different datasets, selecting a suitable blocking method for the given record linkage algorithm and dataset requires significant domain knowledge. Many researches in entity resolution has concentrated on either improving the matching quality, making entity resolution scalable to very large databases, or reducing the manual efforts required throughout the resolution process. In this paper, we propose an efficient record searching using dynamic blocking in entity resolution systems. © 2013 Springer-Verlag.