Distance browsing in distributed multimedia databases

• Authors: FALCHI Fabrizio; GENNARO Claudio; RABITTI Fausto; ZEZULA Pavel
• Year of publication: 2009
• Type: Article in Periodical
• Magazine / Source: Future Generation Computer Systems
• MU Faculty or unit: Faculty of Informatics
• Field: Informatics
• Keywords: distance; browsing;multimedia
• Description: In this paper, we present a Distributed Incremental Nearest Neighbor algorithm (DINN) for finding closest objects in an incremental fashion over data distributed among computer nodes, each able to perform its local Incremental Nearest Neighbor (local-INN) algorithm. We prove that our algorithm is optimum with respect to both the number of involved nodes and the number of local-INN invocations. An implementation of our DINN algorithm, on a real P2P system called MCAN, was used for conducting an extensive experimental evaluation on a real-life dataset.

Related projects

• Integrated approach to education of PhD students in the area of parallel and distributed systems
• Distributed Index Structures for Similarity Searching
• Complex similarity searching in very large data collections