PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Gennaro C. Scalable similarity self join in a metric DHT system. In: SEBD 2009 - 17th Italian Symposium on Advanced Database Systems (Camogli, Genova, 21-24 June 2009). Atti, pp. 81 - 88. Seneca Edizioni, 2009.
 
 
Abstract
(English)
Efficient processing of similarity joins is important for a large class of data analysis and data-mining applications. This primitive finds all pairs of records within a predefined distance threshold of each other. We present MCAN+, an extension of MCAN (a Content-Addressable Network for metric objects) to support similarity self join queries. The challenge of the proposed approach is to address the problem of the intrinsic quadratic complexity of similarity joins, with the aim of bounding the elaboration time, by involving an increasing number of computational nodes as the dataset size grows. To test the scalability of MCAN+, we used a real-life dataset of color features extracted from one million images of the Flickr photo sharing website.
Subject Similarity Join
Content-Addressable Network
Metric Space
H.3.3 Information Search and Retrieval


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional