2015 IEEE 31st International Conference on Data Engineering (ICDE) (2015)
Seoul, South Korea
April 13, 2015 to April 17, 2015
Takanori Maehara , JST, ERATO, Kawarabayashi Large Graph Project, Japan
Mitsuru Kusumoto , National Institute of Informatics, 2-1-2, Hitotsubashi, Chiyoda-ku, Tokyo, Japan
Ken-ichi Kawarabayashi , JST, ERATO, Kawarabayashi Large Graph Project, Japan
Similarity join finds all pairs of objects (i, j) with similarity score s(i, j) greater than some specified threshold θ. This is a fundamental query problem in the database research community, and is used in many practical applications, such as duplicate detection, merge/purge, record linkage, object matching, and reference conciliation.
Approximation algorithms, Algorithm design and analysis, Memory management, Monte Carlo methods, Accuracy, Couplings, Complexity theory
T. Maehara, M. Kusumoto and K. Kawarabayashi, "Scalable SimRank join algorithm," 2015 IEEE 31st International Conference on Data Engineering (ICDE), Seoul, South Korea, 2015, pp. 603-614.