Effective early termination techniques for text similarity join operator
dc.citation.epage | 801 | en_US |
dc.citation.spage | 791 | en_US |
dc.citation.volumeNumber | 3733 | en_US |
dc.contributor.author | Özalp, S. A. | en_US |
dc.contributor.author | Ulusoy, Özgür | en_US |
dc.coverage.spatial | Istanbul, Turkey | en_US |
dc.date.accessioned | 2016-02-08T11:51:23Z | |
dc.date.available | 2016-02-08T11:51:23Z | en_US |
dc.date.issued | 2005 | en_US |
dc.department | Department of Computer Engineering | en_US |
dc.description | Conference name: 20th International Symposium | en_US |
dc.description | Date of Conference: 26-28 October 2005 | en_US |
dc.description.abstract | Text similarity join operator joins two relations if their join attributes are textually similar to each other, and it has a variety of application domains including integration and querying of data from heterogeneous resources; cleansing of data; and mining of data. Although, the text similarity join operator is widely used, its processing is expensive due to the huge number of similarity computations performed. In this paper, we incorporate some short cut evaluation techniques from the Information Retrieval domain, namely Harman, quit, continue, and maximal similarity filter heuristics, into the previously proposed text similarity join algorithms to reduce the amount of similarity computations needed during the join operation. We experimentally evaluate the original and the heuristic based similarity join algorithms using real data obtained from the DBLP Bibliography database, and observe performance improvements with continue and maximal similarity filter heuristics. © Springer-Verlag Berlin Heidelberg 2005. | en_US |
dc.description.provenance | Made available in DSpace on 2016-02-08T11:51:23Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2005 | en_US |
dc.identifier.doi | 10.1007/11569596_81 | en_US |
dc.identifier.doi | 10.1007/11569596 | en_US |
dc.identifier.isbn | 9783540294146 | en_US |
dc.identifier.issn | 0302-9743 | |
dc.identifier.uri | http://hdl.handle.net/11693/27360 | en_US |
dc.language.iso | English | en_US |
dc.publisher | Springer, Berlin, Heidelberg | en_US |
dc.relation.isversionof | https://doi.org/10.1007/11569596_81 | en_US |
dc.relation.isversionof | https://doi.org/10.1007/11569596 | en_US |
dc.source.title | Computer and Information Sciences - ISCIS 2005 | en_US |
dc.subject | Bibliographic retrieval systems | en_US |
dc.subject | Computation theory | en_US |
dc.subject | Computer operating procedures | en_US |
dc.subject | Data mining | en_US |
dc.subject | Data reduction | en_US |
dc.subject | Information retrieval | en_US |
dc.subject | Integration | en_US |
dc.subject | Query languages | en_US |
dc.subject | Application domains | en_US |
dc.subject | Data querying | en_US |
dc.subject | Filter heuristics | en_US |
dc.subject | Text similarity | en_US |
dc.subject | Text processing | en_US |
dc.title | Effective early termination techniques for text similarity join operator | en_US |
dc.type | Conference Paper | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Effective early termination techniques for text similarity join operator.pdf
- Size:
- 228.4 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version