Publication details
Distance browsing in distributed multimedia databases
| Basic information | |
|---|---|
| Original title: | Distance browsing in distributed multimedia databases |
| Authors: | Fabrizio Falchi, Claudio Gennaro, Fausto Rabitti, Pavel Zezula |
| Further information | |
|---|---|
| Citation: | FALCHI, Fabrizio  - GENNARO, Claudio - RABITTI, Fausto - ZEZULA, Pavel. Distance browsing in distributed multimedia databases. Future Generation Computer Systems, Amsterdam, The Netherlands, Elsevier Science, The Nederlands. ISSN 0167-739X, 2009, vol. 25/2009, no. 1, pp. 64-76. |
| Original language: | English |
| Field: | Informatika |
| Type: | Article in Periodical |
| Keywords: | distance; browsing;multimedia |
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
