Call For Paper Volume:4 Issue:8 Aug'2017 |

Top-k Similarity Join Algorithm: An Indexing based approach

Publication Date : 29/06/2015



Author(s) :

Sneha Kolhe , Prof. V. B. Patil.


Volume/Issue :
Volume 2
,
Issue 6
(06 - 2015)



Abstract :

There is a wide range of applications that require finding the top-k most similar pairs of records in a given database. However, computing such top-k similarity joins is a challenging problem today, as there is an increasing trend of applications that expect to deal with vast amounts of data. An algorithm, top k-join, is proposed to answer top-k similarity join efficiently. It is based on the prefix filtering principle and employs tight upper bounding of similarity values of unseen pairs. It also uses inverted indexes to find out candidates pairs i.e an indexed based approach. Experimental results demonstrate the efficiency of the proposed algorithm on large-scale real datasets.


No. of Downloads :

0


Indexing

Web Design MymensinghPremium WordPress ThemesWeb Development

Top-k Similarity Join Algorithm: An Indexing based approach

June 29, 2015