Distance browsing in distributed multimedia databases

Citations of this article
Mendeley users who have this article in their library.
Get full text


The state of the art of searching for non-text data (e.g., images) is to use extracted metadata annotations or text, which might be available as a related information. However, supporting real content-based audiovisual search, based on similarity search on features, is significantly more expensive than searching for text. Moreover, such search exhibits linear scalability with respect to the dataset size, so parallel query execution is needed. 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. The proposed algorithm is being used in two running projects: SAPIR and NeP4B. © 2008 Elsevier B.V. All rights reserved.




Falchi, F., Gennaro, C., Rabitti, F., & Zezula, P. (2009). Distance browsing in distributed multimedia databases. Future Generation Computer Systems, 25(1), 64–76. https://doi.org/10.1016/j.future.2008.02.007

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free