The Library
State-of-the-art in string similarity search and join
Tools
Tools
Tools
Wandelt, Sebastian, Wang, Jiaying, Leser, Ulf, Deng, Dong, Gerdjikov, Stefan, Mishra, Shashwat, Mitankin, Petar, Patil, Manish, Siragusa, Enrico, Tiskin, Alexander and Wang, Wei (2014) State-of-the-art in string similarity search and join. SIGMOD Record, Volume 43 (Number 1). pp. 64-76. doi:10.1145/2627692.2627706
|
PDF
WRAP_Tiskin_p64-wandelt.pdf - Accepted Version - Requires a PDF viewer. Download (505Kb) | Preview |
Official URL: http://dx.doi.org/10.1145/2627692.2627706
Abstract
String similarity search and its variants are fundamental problems with many applications in areas such as data integration, data quality, computational linguistics, or bioinformatics. A plethora of methods have been developed over the last decades. Obtaining an overview of the state-of-the-art in this field is difficult, as results are published in various domains without much cross-talk, papers use different data sets and often study subtle variations of the core problems, and the sheer number of proposed methods exceeds the capacity of a single research group. In this paper, we report on the results of the probably largest benchmark ever performed in this field. To overcome the resource bottleneck, we organized the benchmark as an international competition, a workshop at EDBT/ICDT 2013. Various teams from different fields and from all over the world developed or tuned programs for two crisply defined problems. All algorithms were evaluated by an external group on two machines. Altogether, we compared 14 different programs on two string matching problems (k-approximate search and k-approximate join) using data sets of increasing sizes and with different characteristics from two different domains. We compare programs primarily by wall clock time, but also provide results on memory usage, indexing time, batch query effects and scalability in terms of CPU cores. Results were averaged over several runs and confirmed on a second, different hardware platform. A particularly interesting observation is that disciplines can and should learn more from each other, with the three best teams rooting in computational linguistics, databases, and bioinformatics, respectively.
| Item Type: | Journal Article | ||||
|---|---|---|---|---|---|
| Subjects: | Q Science > QA Mathematics > QA75 (Please use QA76 Electronic Computers. Computer Science) | ||||
| Divisions: | Faculty of Science > Computer Science | ||||
| Library of Congress Subject Headings (LCSH): | Text processing (Computer science), Information storage and retrieval systems, Computer algorithms, Bioinformatics | ||||
| Journal or Publication Title: | SIGMOD Record | ||||
| Publisher: | ACM | ||||
| ISSN: | 0163-5808 | ||||
| Official Date: | March 2014 | ||||
| Dates: |
|
||||
| Volume: | Volume 43 | ||||
| Number: | Number 1 | ||||
| Page Range: | pp. 64-76 | ||||
| DOI: | 10.1145/2627692.2627706 | ||||
| Status: | Peer Reviewed | ||||
| Publication Status: | Published | ||||
| Access rights to Published version: | Restricted or Subscription Access | ||||
| Embodied As: | 1 |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
Downloads
Downloads per month over past year
