Universita' Roma Tre CCS Ingegneria Informatica Dip Informatica e Automazione
Sistemi informativi (nuovo ordinamento)
Anno accademico 2003-2004
Home page del corso Programma e materiale Avvisi

(nell'ambito della lezione del corso di Sistemi informativi, aperto a tutti gli interessati)

Venerdì 12 dicembre 2003, ore 14 aula N3

Approximate String Joins
Dr. Divesh Srivastava
AT&T Labs-Research (USA)

Lucidi pdf


String data is ubiquitous and is commonly used to correlate (or join) entities across autonomous, heterogeneous databases. The main challenge is to effectively deal with the noisy nature of string data, due to, for example, transcription errors, incomplete information, and multiple conventions for recording string valued attributes. Commercial databases do not support approximate string joins directly, and it is a challenge to implement this functionality efficiently. In this talk, I'll present techniques for performing approximate string joins, based on a variety of string similarity metrics, including variants of edit distance and cosine similarity. These techniques are scalable, and can be formulated to execute efficiently in a relational database management system.

This is joint work with Luis Gravano, Panagiotis G. Ipeirotis, H. V. Jagadish, Nick Koudas, and S. Muthukrishnan.

Paolo Atzeni, Dipartimento di Informatica e Automazione, Università Roma Tre
Ultima modifica 12/12/2003