DocumentCode :
1688891
Title :
Approximate string joins
Author :
Srivastava, Divesh
Author_Institution :
AT/spl and/T Labs-Res., Florham Park, NJ, USA
fYear :
2003
Firstpage :
7
Abstract :
Summary form only given. 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 value attributes. Commercial databases do not support approximate string joins directly, and it is a challenge to implement this functionality efficiently. The author presents techniques for performing approximate string joins, based n 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.
Keywords :
distributed databases; relational databases; string matching; approximate string joins; autonomous database; cosine similarity; database management system; edit distance; heterogeneous database; relational database; similarity metrics; string data; string value; Conference management; Relational databases;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Scientific and Statistical Database Management, 2003. 15th International Conference on
ISSN :
1099-3371
Print_ISBN :
0-7695-1964-4
Type :
conf
DOI :
10.1109/SSDM.2003.1214944
Filename :
1214944
Link To Document :
بازگشت