DocumentCode
2456651
Title
Joint Entity Resolution
Author
Whang, Steven Euijong ; Garcia-Molina, Hector
Author_Institution
Comput. Sci. Dept., Stanford Univ., Stanford, CA, USA
fYear
2012
fDate
1-5 April 2012
Firstpage
294
Lastpage
305
Abstract
Entity resolution (ER) is the problem of identifying which records in a database represent the same entity. Often, records of different types are involved (e.g., authors, publications, institutions, venues), and resolving records of one type can impact the resolution of other types of records. In this paper we propose a flexible, modular resolution framework where existing ER algorithms developed for a given record type can be plugged in and used in concert with other ER algorithms. Our approach also makes it possible to run ER on subsets of similar records at a time, important when the full data is too large to resolve together. We study the scheduling and coordination of the individual ER algorithms in order to resolve the full data set. We then evaluate our joint ER techniques on synthetic and real data and show the scalability of our approach.
Keywords
database management systems; file organisation; ER algorithm coordination; ER algorithms scheduling; joint entity resolution; Databases; Erbium; Joints; Organizations; Partitioning algorithms; Runtime; Scalability;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Engineering (ICDE), 2012 IEEE 28th International Conference on
Conference_Location
Washington, DC
ISSN
1063-6382
Print_ISBN
978-1-4673-0042-1
Type
conf
DOI
10.1109/ICDE.2012.119
Filename
6228092
Link To Document