Özalp, S. A.Ulusoy, Özgür2016-02-082016-02-08200597835402941460302-9743http://hdl.handle.net/11693/27360Conference name: 20th International SymposiumDate of Conference: 26-28 October 2005Text 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.EnglishBibliographic retrieval systemsComputation theoryComputer operating proceduresData miningData reductionInformation retrievalIntegrationQuery languagesApplication domainsData queryingFilter heuristicsText similarityText processingConference Paper10.1007/11569596_8110.1007/11569596